Abstract
In Unspecified Bit Rate (UBR) service provided by ATM networks, user sends cells into networks with no feedback, no guarantee cells may be dropped during congestion. This paper describes a congestion control scheme using active network technology to avoid congestion in a conventional ATM network. Ants routing algorithm for congestion control and associated with active network fashion is implemented. The routing algorithm uses information that is monitored and revised according to the congestion status of output ports and sends commands and executable bits stream to other switching elements. The Active switching elements share information about traffic levels of an interconnection network and reciprocate customized programs to rerouting cells in the presence of congestion at switching element’s output ports. As a result, it is possible to build active switching network that can avoid congestion in a conventional ATM network.
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
ATM Forum Technical Committee: Traffic Management Specification Version 4.0, (1996) af-tm-0056.00.
E. Rashid, H. Kobayashi, T. Nakamura: Ants Routing: An adaptive Packets Flow Control Scheme in Multimedia Networks. Proc. of the IEEE ICUPC’ 93 (CANADA), (1993) 228–234.
W. J. Dally:Virtual-Channel Flow Control. IEEE Transactions on Parallel and Dist. Sys., vol. 3, no. 2, (1992) 194–205.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rashid, E., Araki, T., Nakamura, T. (2001). An Active Network for Improving Performance of Traffic Flow over Conventional ATM Service. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_61
Download citation
DOI: https://doi.org/10.1007/3-540-47734-9_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42303-4
Online ISBN: 978-3-540-47734-1
eBook Packages: Springer Book Archive