Cart (Loading....) | Create Account
Close category search window
 

Look-ahead traffic distribution in wormhole-routed 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

2 Author(s)
Wei-Ming Lin ; Div. of Eng., Texas Univ., San Antonio, TX, USA ; Chunhui Zhao

A new approach, look-ahead traffic distribution, is proposed in this paper to improve the performance of adaptive routing algorithms in wormhole routed networks. In most adaptive routing algorithms, a packet changes its forwarding direction only if its requesting channel is not available, i.e., the routing decision is based only on the traffic information (buffer availability) in adjacent nodes. The performance of these adaptive routing algorithms usually is far from optimal due to such a crude routing decision-making process without taking into consideration traffic information in non-adjacent nodes which a packet potentially is to be forwarded to at a later time. By adding minimal hardware to the router, the proposed approach allows neighboring routers to exchange integrated traffic information and each router to re-integrate information gathered before further propagation. It is intended to use a small amount of such integrated information to give each router a sketch of semi-global traffic information and degree of congestion in an extended local area. Such information is then used for a more intelligent routing decision-making process in each router. Experimental results show that the communication latency and the saturation point have been significantly improved by applying such an add-on feature to existing adaptive algorithms

Published in:

Reliable Distributed Systems, 1998. Proceedings. Seventeenth IEEE Symposium on

Date of Conference:

20-23 Oct 1998

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.