Abstract
Virtual-circuit routing is a widely used method of routing traffic sessions between an origin-destination pair in a data communication network. It consists of setting up a fixed path of communication channels from the origin node to the destination node and then routing all the traffic for a particular session on that path. Several sessions and their virtual circuits are allowed to share channels and the data is transmitted through these channels in a store-and-forward fashion. Thus no traffic is lost and the effect of load is felt only through higher queueing delays in getting the messages to the destination nodes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bertsekas, D. and R.G. Gallager (1987). Data Networks, Prentice~Hall, Englewood Cliffs, NJ.
Gallager, R.G. and S.J. Golestaani (1980). Flow control and routing algorithms for data networks, Proc. 5th Intern. Conf. Compo Commun., 779–784.
Gelenbe, E. and I. Mitrani (1980). Analysis and Synthesis of Computer Systems, Academic Press, NY.
Hariharan, R., V.G. Kulkarni and S. Stidham, Jr. (1990). A survey of research relevant to virtual-circuit routing in telecommunication networks, UNC/OR/ TR90-13, Dept. of Oper. Res., Univ. of North Carolina, Chapel Hill, NC.
Kelly, F.P. (1979). Reversibility and Stochastic Networks, Wiley & Sons, NY.
Kulkarni, V.G. and S. Stidham, Jr. (1991). A queueing network model for halfduplex routing in data communications networks. UNC/OR/TR91-9, Dept. of Operations Research, University of North Carolina, Chapel Hill, NC.
Sauer, C.H. and K.M. Chandy (1981). Computer Systems Performance Modeling, Prentice-Hall, Englewood Cliffs, NJ.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Kulkarni, V.G., Stidham, S. (1992). A Queueing-Network Model for Half-Duplex Routing in Data Communication Networks. In: Perros, H. (eds) High-Speed Communication Networks. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3450-1_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3450-1_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6527-3
Online ISBN: 978-1-4615-3450-1
eBook Packages: Springer Book Archive