For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Modification of the Shufflenet Connectivity Graph for Balancing the Load in the Case of Uniform Traffic
Andrea BORELLA Franco CHIARALUCE
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/02/25
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Graphs and Networks
multihop optical networks, WDM, connectivity graph,
Full Text: PDF>>
We propose a modification of the perfect shuffle connectivity graph used in optical networks, which ensures the balance of the traffic load on the WDM channels. When applied to the simple but popular case of 8 nodes, connected through a shortest path routing algorithm, it allows to increase the aggregate capacity of more than 14%.