By Topic

Dynamic and static packet routing on symmetric communication 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
$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

4 Author(s)
Grammatikakis, M.D. ; Inst. for Comput. Sci., FORTH, Heraklion, Greece ; Jwo, J.-S. ; Kraetzl, M. ; Suh-Hui Wang

For dynamic routing on any vertex and edge symmetric topology we relate network contention to the packet generation rate, and the degree and average distance of the underlying topology. As a direct consequence we show that the star graph becomes saturated as the packet generating rate approaches one. Also, for graphs of approximately the same order, the average delay of a packet routed on an alternating-group graph is smaller than the corresponding delays on the hypercube and the star graph. Similar conclusions are drawn from comparisons based on various static permutation routing problems. Our theoretical results compare favorably with simulations of considerably large systems

Published in:

Global Telecommunications Conference, 1994. GLOBECOM '94. Communications: The Global Bridge., IEEE  (Volume:3 )

Date of Conference:

28 Nov- 2 Dec 1994