All-to-all wavelength-routing in all-optical compound networks

被引：17

作者：

Amar, D ^{[1
]}

Raspaud, A ^{[1
]}

Togni, O ^{[1
]}

机构：

[1] Univ Bordeaux 1, Dept Informat, LaBRI UMR 5800, F-33405 Talence, France

来源：

DISCRETE MATHEMATICS | 2001年 / 235卷 / 1-3期

关键词：

D O I：

10.1016/S0012-365X(00)00289-2

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We give theoretical results obtained for wavelength routings in certain all-optical networks. In all-optical networks a single physical optical link can carry several logical signals provided that they are transmitted on different wavelengths. An all-to-all routing in a n-node network is a set of n(n - 1) simple paths specified for every ordered pair (x, y) of nodes. The routing will be feasible if an assignment of wavelengths to the paths can be given such that no link will carry in the same direction two different paths of the routing on the same wavelength. With such a routing, it is possible to perform the gossiping in one round. The cost of the routing depends on the number of wavelengths it handles. We give the smallest necessary number of wavelength over all possible routings for networks based on certain compound graphs. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：353 / 363

页数：11

共 13 条

[1]

Beauquier B, 1999, NETWORKS, V33, P179, DOI 10.1002/(SICI)1097-0037(199905)33:3<179::AID-NET4>3.0.CO

[2]

2-6

[3] TABLE OF LARGE (DELTA,D)-GRAPHS [J].

BERMOND, JC ;

DELORME, C ;

QUISQUATER, JJ .

DISCRETE APPLIED MATHEMATICS, 1992, 37-8 :575-577

[4]

BERMOND JC, 1996, P 23 ICALP96 PAD GER

[5]

BERMOND JC, 1983, ANN DISCRETE MATH, V17, P65

[6]

Gauyacq G, 1998, LECT NOTES COMPUT SC, V1517, P227

[7]

GAUYACQ G, 1995, THESIS U BORDEAUX I

[8]

GOMEZ J, 1990, J ARS COMBIN B, V29, P33

[9] ON FORWARDING INDEXES OF NETWORKS [J].

HEYDEMANN, MC ;

MEYER, JC ;

SOTTEAU, D .

DISCRETE APPLIED MATHEMATICS, 1989, 23 (02) :103-123

[10]

HEYDEMANN MC, GRAPH SYMMETRY, P167

← 1 2 →