Performance of Multi-hop Communications Using Logical Topologies on Optical Torus Networks

Yuan, Xin; Melhem, Rami; Gupta, Rajiv

doi:10.1006/jpdc.2000.1711

Cited by 7 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A simple form of the torus network is its two-dimensional version which is a mesh and grid network with wraparound of rows and columns [10]. The importance of this work stems from the fact that torus is a useful candidate for the construction of an optical network with a multihop virtual topology based on wavelength division multiplexing (WDM) [11].…”

Section: Introductionmentioning

confidence: 99%

Analytical modeling and comparison of fault-tolerant message flow control mechanisms in torus-connected networks

Safaei

Khonsari

2010

J Supercomput

View full text Add to dashboard Cite

In many environments, rather than minimizing message latency or maximizing network performance, the ability to survive beyond the failure of individual network components is the main issue of interests. The nature of Wormhole Switching (WS) leads to high network throughput and low message latencies. However, in the vicinity of faulty regions, these behaviors cause rapid congestion, provoking the network becomes deadlocked. While techniques such as adaptive routing can alleviate the problem, they cannot completely solve the problem. Thus, there have been extreme studies on other types of switching mechanisms in networking and multicomputers communities. In this paper, we present a general mathematical model to assess the relative performance merits of three well-known fault-tolerant switching methods in tori, namely Scouting Switching (SS), Pipelined Circuit Switching (PCS), and Circuit Switching (CS). We have carried out extensive simulation experiments, the results of which are used to validate the proposed analytical models. We have also conducted an extensive comparative performance analysis, by means of analytical modeling, of SS, PCS, and CS under various working conditions. The analytical results reveal that SS shows substantial performance improvements for low to moderate failure rates over PCS and CS, which achieves close to WS performance. PCS can provide superior performance over CS and behaves the same or in some occasions worse than SS, under light and moderate traffic, especially with the same hardware requirements.

show abstract

Section: Introductionmentioning

confidence: 99%

Analytical modeling and comparison of fault-tolerant message flow control mechanisms in torus-connected networks

Safaei

Khonsari

2010

J Supercomput

View full text Add to dashboard Cite

show abstract

“…In addition, each hop requires the use of a transmitter at its head and a receiver at its terminus. Thus, minimizing the maximum hop distance is an objective of interest for both resource usage as well as for performance, particularly in networks in which hop latency dominates channel propagation latency [5], [10], [11], [18].…”

mentioning

confidence: 99%

Virtual topologies for multicasting with multiple originators in WDM networks

Ferrel

Mettler

Miller

et al. 2006

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

In this paper, we consider the problem of multicasting with multiple originators in WDM optical networks. In this problem, we are given a set of source nodes and a set of destination nodes in a network. All source nodes are capable of providing data to any destination node. Our objective is to find a virtual topology in the WDM network which satisfies given constraints on available resources and is optimal with respect to minimizing the maximum hop distance. Although the corresponding decision problem is NP-complete in general, we give polynomial time algorithms for the cases of unidirectional paths and rings.

show abstract