By Topic

Virtual embeddings on regular topology networks

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
$33 $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

1 Author(s)
B. Yener ; Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

The paper considers distributed processing over a switch-based LAN and addresses loss-free routing of non-reserved, bursty data traffic. The approach is based on embedding multiple virtual rings onto the underlying network topology with the following two constraints: (i) each virtual ring is Hamiltonian (i.e., includes each node exactly once), and (ii) rings are mutually edge disjoint. New techniques to obtain such virtual rings in the hypercube and circulant networks are presented. Each virtual ring may operate like a buffer insertion ring with fairness. The routing algorithm on the multiple virtual rings is a generalization of convergence routing and it ensures loss-free and deterministic delivery of bursty traffic. The bounds on the length of routing are studied both analytically and computationally. It is shown that an upper bound of O(N/d) on the maximum length of routing can be obtained on the networks with d virtual ring embeddings

Published in:

Parallel and Distributed Processing, 1996., Eighth IEEE Symposium on

Date of Conference:

23-26 Oct 1996