By Topic

Hyper-cluster: a scalable and reconfigurable wide-area lightwave network architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Guo, D. ; Citicorp Securities Inc., New York, NY, USA ; Acampora, A.S. ; Zhang, Z.

This paper presents a network architecture called hyper-cluster employing wavelength-routing, multi-hop packet switching and optical reconfiguration. It is modularly scalable to very large configurations on both hardware and operational bases. A hyper-cluster uses a logical hierarchy for the purpose of addressing but guarantees that all access nodes have a constant number of transceivers. It is a cluster of regular graphs; the clustering structure follows the traffic distribution in a grand granularity. The issue of operational scalability is addressed by presenting a scalable routing protocol. When using shuffle-net as the building block, we also present a novel routing scheme called quantified deflection routing, which improves the call blocking performance significantly. The network throughput and virtual call blocking performance is obtained via simulation on large networks (with size beyond 200 nodes). Numerical results presented by Guo, Acampora and Zhang (see SPIE- The International Society for Optical Engineering, Voice, Video, and Data Communications, Dallas, 1997) show that the dynamic self-routing protocol, combined with quantified deflection routing for the shuffle-net, can achieve excellent resource utilization efficiency for very large networks. When the call arrival rate is below 0.3, the capacity provided by the hyper-cluster dynamic routing algorithm is close to that of an infinite capacity centralized switch (lowest possible call blocking caused exclusively by congestion on the finite capacity user input/output links, never by the switch fabric itself)

Published in:

Global Telecommunications Conference, 1997. GLOBECOM '97., IEEE  (Volume:2 )

Date of Conference:

3-8 Nov 1997