Abstract
This paper presents an idea of dynamic channel selection to balance traffic for a mesh network. The key idea is to maintain the history of channel utilization in each node and based on the recorded information the node router can predict the current load of the network and route packets through less trafficked or more appropriate channels to avoid congestion. Three dynamic channel selection policies, DCS-I, DCS-II and DCS-III, have been designed, each with specific advantages, to fit different situations. Performance of six established adaptive routing algorithms with five channel selection policies are evaluated through simulation. The results exhibit that when network traffic gets heavy, the proposed DCS-II and DCS-III yield constantly better performance in terms of throughput and communication latency than the other selection policies. DCS-II and DCS-III are also shown to bring about more even buffer utilization — manifesting the important link between balanced network traffic and desired 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
Ni, L. M., McKinley, P. K.: A survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer, Vol. 26, No. 2 (1993) 62–76.
Dally, W. J.: Virtual Channel Flow Control. IEEE Trans. on Parallel and Distributed Systems, Vol. 3, No. 3 (1992) 194–205.
Dally, W. J., Akoi, H.: Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels. IEEE Trans. on Parallel and Distributed Systems, Vol. 4, No. 4 (1993) 466–475.
Chuang, P.-J., Chen, J.-T., Jiang, Y.-T.: Balancing Buffer Utilization in Meshes Using a “Restricted Area” Concept. IEEE Trans. on Parallel and Distributed Systems, Vol. 13, No. 8 (2002) 814–827.
Upadhyay, J., Varavithya, V., Mohapatra, P.: A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes. IEEE Trans. on Computers, Vol. 46, No. 2 (1997) 190–197.
Glass, C. J., Ni, L. M.: The Turn Model for Adaptive Routing. J. ACM, Vol. 41, No. 5 (1994) 874–902.
Su, C.-C., Shin, K. G.: Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel. Proc. 22nd Int’l Conf. on Parallel Processing, Vol. I (1993) 227–231.
Boura, Y. M., Das, C. R.: Efficient Fully Adaptive Wormhole Routing in n-Dimensional Meshes. Proc. 14th Int’l Conf. on Distributed Computing Systems (1994) 589–596.
Dally, W. J.: Performance Analysis of k-ary n-cube Interconnection Networks. IEEE Trans. on Computers, Vol. 39, No. 6 (1990) 775–785.
Glass, C. J., Ni, L. M.: Adaptive Routing in Mesh-Connected Networks. Proc. 1992 Int’l Conf. on Distributed Computing Systems (1992) 12–19
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chuang, PJ., Jiang, YT. (2003). Balancing Traffic in Meshes by Dynamic Channel Selection. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_11
Download citation
DOI: https://doi.org/10.1007/3-540-37619-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40523-8
Online ISBN: 978-3-540-37619-4
eBook Packages: Springer Book Archive