A PERFORMANCE COMPARISON BETWEEN GRAPH AND HYPERGRAPH TOPOLOGIES FOR PASSIVE STAR WDM LIGHTWAVE NETWORKS

Citation
H. Bourdin et al., A PERFORMANCE COMPARISON BETWEEN GRAPH AND HYPERGRAPH TOPOLOGIES FOR PASSIVE STAR WDM LIGHTWAVE NETWORKS, Computer networks and ISDN systems, 30(8), 1998, pp. 805-819
Citations number
15
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Computer Science Information Systems",Telecommunications,"Engineering, Eletrical & Electronic","Computer Science Information Systems
ISSN journal
0169-7552
Volume
30
Issue
8
Year of publication
1998
Pages
805 - 819
Database
ISI
SICI code
0169-7552(1998)30:8<805:APCBGA>2.0.ZU;2-F
Abstract
Wavelength division multiplexing (WDM) allows the huge bandwidth of op tical fiber to be divided into several high-speed channels in optical passive star based networks. For such processor networks, most of the proposed architectures for interconnecting nodes are based on graph to pologies. Recently, topologies based on the hypergraph theory have eme rged, motivated by the observation that each multiplexed channel can a ctually be seen as a logical resource shared among many processors, an d not only between two of them. In this paper, we show that these hype rgraph passive star WDM lightwave networks present many advantages wit h respect to graph-based ones, in terms of simulated packet delivery t ime, average number of hops, link utilization, and throughput. Further more, they use only a constant number of transceivers per node, and a sub-linear number of multiplexed channels. (C) 1998 Elsevier Science B .V.