GRADE OF SERVICE AND OPTIMIZATION OF DISTRIBUTED PACKET-SWITCHED NETWORKS

被引：1

作者：

CHARDAIRE, P ^{[1
]}

LESK, M ^{[1
]}

机构：

[1] CTR NATL ETUD TELECOMMUN,DIV ATR,DEPT NETWORK PLANNING,F-92131 ISSY MOULINEAUX,FRANCE

来源：

COMPUTER NETWORKS AND ISDN SYSTEMS | 1986年 / 12卷 / 03期

关键词：

COMPUTER PROGRAMMING - Algorithms - COMPUTER SOFTWARE - OPTIMIZATION;

D O I：

10.1016/0169-7552(86)90052-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Packet-switched network optimization leads to specific problems related notably to the quality of service requirements to be taken into account. The aim of this paper is to present methods for taking these quality of service constraints into account in the optimization process, particularly for heterogeneous networks (i. e. networks using several types of switch and several line capacities). These methods are based on the notion of diameter of graphs, and have been implemented in the computer programs Credo and Credo H, currently used to plan the French public packet-switched network Transpac.

引用

页码：139 / 146

页数：8

共 11 条

[1]

Bermond J.-C., 1981, C NUMER, V32, P3

[2] A SHORTEST-PATH ALGORITHM WITH EXPECTED TIME O(N2 LOG N LOGSTAR N) [J].

BLONIARZ, PA .

SIAM JOURNAL ON COMPUTING, 1983, 12 (03) :588-600

[3]

CHUNG, DIAMETER BOUNDS ALTE

[4] TOPOLOGICAL DESIGN OF DISTRIBUTED COMPUTER-NETWORKS [J].

GERLA, M ;

KLEINROCK, L .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) :48-60

[5]

LAVIA, 1975, 4TH P DAT COMM S

[6]

LESK, 1984, RAIRO OPERATIONS RES, V18, P247

[7]

LESK, 3RD INT NETW PLANN S, P159

[8]

LESK, INT S DATA COMMUNICA, P159

[9]

MEPUIS, 1982, ECHO RECHERCHES OCT, P53

[10]

MINOUX, 1975, ANN TELECOMMUNICATIO, V30

← 1 2 →