Abstract
Routing policy, also known as selection function, is an important constituent of adaptive routing algorithm for interconnection networks. However, relatively very small research effort has been put on it until now. In this paper, we analyze how routing policy affects network performance. It is disclosed that routing policy actually works as a traffic scheduler. Five generic routing policies are proposed independent of particular routing algorithm. They explicitly schedule the real-time network traffic based on traffic measurement. Counters are used as cost-effective measurement facilities. To standardize the design, constituents of the counter-based routing policy (CRP) are formally specified. Simulations covering extensive traffic patterns exhibit potentials of CRP in maximizing the network performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Badr, H.G., Podar, S.: An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies. IEEE Transactions on Computes 10, 1362–1371 (1989)
Feng, W., Shin, K.G.: Impact of Selection Functions on Routing Algorithm Performance in Multicomputer Networks. In: Proceedings of the 11th Annual Conference on Supercomputing (1997)
Lui, J.C.S., Muntz, R., Towsley, D.: Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: an Algorithm Approach. IEEE Transactions on Computes 12, 1371–1382 (1995)
Rao, R.: Utilization Imbalance in Wormhole Routed Networks. Master’s Thesis. Ohio State University (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, X., Xiang, Y., Li, T.J. (1999). Counter-Based Routing Policies. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive