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

A conflict-free traffic assignment algorithm using forward planning

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)
Yau, V. ; Dept. of Comput. Sci., Canterbury Univ., Christchurch, New Zealand ; Pawlikowski, K.

In multichannel telecommunication networks, switching systems and processor-memory interconnects the need for conflict-free traffic assignment arises whenever packets (or requests) are to be directed from input buffers (processors) to specific outlets (modules). We present an algorithm, based on forward planning, which can be used in the above-mentioned applications for scheduling conflict-free transfers of packets from inputs to outputs. The performance of the algorithm is evaluated in the sense of throughput and delay, and compared with that of the system of distinct representatives (SDR), an earlier proposed algorithm featuring 100% assignment efficiency. Then, its worst case computational complexity is compared with that of SDR and several suboptimal low-complexity algorithms reported in literature. It is shown that forward planning of packet transmissions offers significant performance improvements if the finite capacity of buffers is taken into account. Furthermore, the proposed algorithm has the lowest order of computational complexity and permits simpler buffer organisation and access modes.

Published in:

INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE  (Volume:3 )

Date of Conference:

24-28 March 1996

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.