Hypercube connected rings: A scalable and fault-tolerant logical topology for optical networks

S. Banerjee, Dilip Sarkar

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

A new, fault-tolerant, scalable, and modular virtual topology for lightwave networks employing wavelength division multiplexing is proposed. The proposed architecture is based on a hypercube connected ring structure that enjoys the rich topological properties of a hypercube, but it also overcomes one of its drawbacks. In a hypercube, the nodal degree increases with the number of nodes. Hence, the per-node cost of the network increases as the network size grows. However, in a hypercube connected ring network (HCRNet) the nodal degree is small and it remains constant, independent of the network population. A HCRNet, like a hypercube, is perfectly symmetric in the sense that the average internodal distance in an N-node HCRNet is the same from any source node. Its average internodal distance is in the order of log N and it is comparable to other regular structures such as the Trous and ShuffleNet. The HCRNet is based on the Cube Connected Cycle (CCC) interconnection pattern proposed for multiprocessor architectures. However, the HCRNet improves on CCC by rearranging its hypercube links, which results in a significantly lower average internodal distance. In this paper we present the structural properties of HCRNet, and address the issues of scalability, and fast routing in complete as well as incomplete HCRNet.

Original languageEnglish (US)
Pages (from-to)1060-1079
Number of pages20
JournalComputer Communications
Volume24
Issue number11
DOIs
StatePublished - Jun 15 2001

Fingerprint

Fiber optic networks
Wavelength division multiplexing
Scalability
Structural properties
Topology
Costs

Keywords

  • Cube connected cycles
  • Hypercube
  • Interconnection network
  • Regular multihop networks
  • Routing
  • Scalability
  • Virtual topology
  • Wavelength division multiplexing

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Hypercube connected rings : A scalable and fault-tolerant logical topology for optical networks. / Banerjee, S.; Sarkar, Dilip.

In: Computer Communications, Vol. 24, No. 11, 15.06.2001, p. 1060-1079.

Research output: Contribution to journalArticle

@article{dc5cc8eb13ad4064a8d255fd00e06f78,
title = "Hypercube connected rings: A scalable and fault-tolerant logical topology for optical networks",
abstract = "A new, fault-tolerant, scalable, and modular virtual topology for lightwave networks employing wavelength division multiplexing is proposed. The proposed architecture is based on a hypercube connected ring structure that enjoys the rich topological properties of a hypercube, but it also overcomes one of its drawbacks. In a hypercube, the nodal degree increases with the number of nodes. Hence, the per-node cost of the network increases as the network size grows. However, in a hypercube connected ring network (HCRNet) the nodal degree is small and it remains constant, independent of the network population. A HCRNet, like a hypercube, is perfectly symmetric in the sense that the average internodal distance in an N-node HCRNet is the same from any source node. Its average internodal distance is in the order of log N and it is comparable to other regular structures such as the Trous and ShuffleNet. The HCRNet is based on the Cube Connected Cycle (CCC) interconnection pattern proposed for multiprocessor architectures. However, the HCRNet improves on CCC by rearranging its hypercube links, which results in a significantly lower average internodal distance. In this paper we present the structural properties of HCRNet, and address the issues of scalability, and fast routing in complete as well as incomplete HCRNet.",
keywords = "Cube connected cycles, Hypercube, Interconnection network, Regular multihop networks, Routing, Scalability, Virtual topology, Wavelength division multiplexing",
author = "S. Banerjee and Dilip Sarkar",
year = "2001",
month = "6",
day = "15",
doi = "10.1016/S0140-3664(00)00336-4",
language = "English (US)",
volume = "24",
pages = "1060--1079",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "11",

}

TY - JOUR

T1 - Hypercube connected rings

T2 - A scalable and fault-tolerant logical topology for optical networks

AU - Banerjee, S.

AU - Sarkar, Dilip

PY - 2001/6/15

Y1 - 2001/6/15

N2 - A new, fault-tolerant, scalable, and modular virtual topology for lightwave networks employing wavelength division multiplexing is proposed. The proposed architecture is based on a hypercube connected ring structure that enjoys the rich topological properties of a hypercube, but it also overcomes one of its drawbacks. In a hypercube, the nodal degree increases with the number of nodes. Hence, the per-node cost of the network increases as the network size grows. However, in a hypercube connected ring network (HCRNet) the nodal degree is small and it remains constant, independent of the network population. A HCRNet, like a hypercube, is perfectly symmetric in the sense that the average internodal distance in an N-node HCRNet is the same from any source node. Its average internodal distance is in the order of log N and it is comparable to other regular structures such as the Trous and ShuffleNet. The HCRNet is based on the Cube Connected Cycle (CCC) interconnection pattern proposed for multiprocessor architectures. However, the HCRNet improves on CCC by rearranging its hypercube links, which results in a significantly lower average internodal distance. In this paper we present the structural properties of HCRNet, and address the issues of scalability, and fast routing in complete as well as incomplete HCRNet.

AB - A new, fault-tolerant, scalable, and modular virtual topology for lightwave networks employing wavelength division multiplexing is proposed. The proposed architecture is based on a hypercube connected ring structure that enjoys the rich topological properties of a hypercube, but it also overcomes one of its drawbacks. In a hypercube, the nodal degree increases with the number of nodes. Hence, the per-node cost of the network increases as the network size grows. However, in a hypercube connected ring network (HCRNet) the nodal degree is small and it remains constant, independent of the network population. A HCRNet, like a hypercube, is perfectly symmetric in the sense that the average internodal distance in an N-node HCRNet is the same from any source node. Its average internodal distance is in the order of log N and it is comparable to other regular structures such as the Trous and ShuffleNet. The HCRNet is based on the Cube Connected Cycle (CCC) interconnection pattern proposed for multiprocessor architectures. However, the HCRNet improves on CCC by rearranging its hypercube links, which results in a significantly lower average internodal distance. In this paper we present the structural properties of HCRNet, and address the issues of scalability, and fast routing in complete as well as incomplete HCRNet.

KW - Cube connected cycles

KW - Hypercube

KW - Interconnection network

KW - Regular multihop networks

KW - Routing

KW - Scalability

KW - Virtual topology

KW - Wavelength division multiplexing

UR - http://www.scopus.com/inward/record.url?scp=0035876426&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035876426&partnerID=8YFLogxK

U2 - 10.1016/S0140-3664(00)00336-4

DO - 10.1016/S0140-3664(00)00336-4

M3 - Article

AN - SCOPUS:0035876426

VL - 24

SP - 1060

EP - 1079

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 11

ER -