Article

Free access

Packet routing algorithms for integrated switching networks

Authors:

Daniel A. Reed,

Chong-kwon KimAuthors Info & Claims

SIGMETRICS '87: Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Pages 7 - 15

https://doi.org/10.1145/29903.29907

Published: 01 May 1987 Publication History

PDF eReader

Abstract

Repeated studies have shown that a single switching technique, either circuit or packet switching, cannot optimally support a heterogeneous traffic mix composed of voice, video and data. Integrated networks support such heterogeneous traffic by combining circuit and packet switching in a single network. To manage the statistical variations of network traffic, we introduce a new, adaptive routing algorithm called hybrid, weighted routing. Simulations show that hybrid, weighted routing is preferable to other adaptive routing techniques for both packet switched networks and integrated networks.

References

[1]

R.R. Boorstyn, and A. Livne, "A Technique for Adaptive Routing in Networks," IEEE Transactions on Communications, Vol. COM-29, No. 4, April 198t, pp. 474-480.

Google Scholar

[2]

W. Chou, A. W. Bragg, and A. A. Nilsson, "The Need for Adaptive Routing in the Chaotic and Unbalanced Traffic Environment," IEEE Trar#saction8 or# Communicationz, Vol. COM-29, No. 4, April 1981, pp. 481-490.

Google Scholar

[3]

G.J. Cov#ello, and P. A. Vena, "Integration of Circult/Packet Switchiag by a SENET (Slotted Envelope Network) Concept," Proceedings of the National Telecommunications Conferer#ce, 1975, pp. (42-12)-(42-17).

Google Scholar

[4]

M.J. Fischer, and T. C. Harris, "A Model for Evaluating the Performance of an Integrated Circuit-and Packet-Switched Multiplex Structure," IEEE Transactiou8 on Communication.e, Vol. COM-24, No. 2, February 1978, pp. 195-202.

Google Scholar

[5]

G.L. Fultz, and L. Kleinrock, "Adaptive Routing Techniques for Store-and-Forward Computer-Communication Networks," Proceedings of the International Conference on Communicatior#8, Montreal, P.Q., Canada, June t97t, pp. (39-1)-(39-8).

Google Scholar

[6]

P. Kermani, and L. Kleinrock, "A Tradeoff Study of Switching Systems in Computer Communication Networks," IEEE Transactions on Communications, Vol. COM-29, No. 12, December 1980, pp. 1052-1080.

Google Scholar

[7]

C.-K. Kim, Integrated Switching Networks: A Performance Study, Ph.D. Dissertation, Department of Computer Science, University of Illinois at Urbana-Champaign, in preparation, 1987. '

Digital Library

Google Scholar

[8]

A.G. Konheim, and R. L. Pickholtz, "Analysis of Integrated Voice/Data Multiplexing," IEEE Transactions on Communications, Vol. COM-32, No. 2, February 1984, pp. 140-147.

Google Scholar

[9]

T.Y. Liang, "A Simpler Approach to "Analysis of Integrated Voice/Data Multiplexing"," IEEE Tran.saction8 on Communications, Vol. COM-33, No. 1, January 1985, pp. 104-108.

Google Scholar

[10]

H. Miyahara, T. Hasegawa, and Y. Teshigawasa, "A Comparative Evaluation of Switching Methods in Computer Communication Networks," Proceedings of the International Conference or# Communications, San Francisco, CA., t975, pp. (6-6)-(6- #o).

Google Scholar

[11]

H. Rudin, "On Routing and "Delta Routing": A Taxonomy and Performance Comparison of Techniques for Packet-Switched Networks," {FEE Transactions on Communieatior#8, Vo|. COM-24, No. l, January 1976, pp. 43-59.

Google Scholar

[12]

H. }#udln, "Studies on the #ntegration of Circuit and Packet Switching," Proceedings of the International Conference on Communications, Toronto, Ontario, Canada, June 1978, pp. 20.2.1-20.2.7.

Google Scholar

[13]

C. J. Weinstein, M. L. Malpass, and M. J. Fischer, "Data Traffic Performance of an Integrated Circuit- and Packet- Switched Multiplex Structure," International Conference on Communleations# Boston, MA.# June 1979# pp. 24.3.i-24.3.5.

Google Scholar

[14]

G. F. Williams, and A. Leon-Garcia, "Performance Analysis of integrated Voice and Data Hybrid-Switched binks," IEEE Transactions on Communications, Vol. COM-32, No. 8, June 1984, pp. 695-706.

Google Scholar

Cited By

View all

Vasilakos APaximadis G(1994)Fault-tolerant routing algorithms using estimator discretized learning automata for high-speed packet-switched networksIEEE Transactions on Reliability10.1109/24.37022243:4(582-593)Online publication date: Jan-1994
https://doi.org/10.1109/24.370222
Vasilakos A(1991)On the behaviour of learning algorithms in a changing environment with application to data network routing problemComputer Standards & Interfaces10.1016/0920-5489(90)90069-R11:1(29-39)Online publication date: 2-Jan-1991
https://dl.acm.org/doi/10.1016/0920-5489%2890%2990069-R
Kim CReed D(1988)Adaptive packet routing in a hypercubeProceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 110.1145/62297.62382(625-630)Online publication date: 1-Jan-1988
https://dl.acm.org/doi/10.1145/62297.62382

Index Terms

Packet routing algorithms for integrated switching networks

Recommendations

Packet routing algorithms for integrated switching networks

Repeated studies have shown that a single switching technique, either circuit or packet switching, cannot optimally support a heterogeneous traffic mix composed of voice, video and data. Integrated networks support such heterogeneous traffic by ...
Packet switching networks and routing algorithms
Design and analysis of high-speed packet switching fabrics for integrated broadband networks

Comments

Information & Contributors

Information

Published In

SIGMETRICS '87: Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems

August 1987

267 pages

ISBN:089791225X

DOI:10.1145/29903

Editor:
Rich Bunt
Gen. Chairman

ACM SIGMETRICS Performance Evaluation Review Volume 15, Issue 1
May 1987
265 pages
ISSN:0163-5999
DOI:10.1145/29904
Editor:
Blaine D. Gaither
Gould, Inc., San Diego, CA
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMETRICS87

Sponsor:

SIGMETRICS

SIGMETRICS87: The ACM Conference on Measurement and Modeling of Computer Systems

May 11 - 14, 1987

Banff, Alberta, Canada

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
536
Total Downloads

Downloads (Last 12 months)42
Downloads (Last 6 weeks)10

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Vasilakos APaximadis G(1994)Fault-tolerant routing algorithms using estimator discretized learning automata for high-speed packet-switched networksIEEE Transactions on Reliability10.1109/24.37022243:4(582-593)Online publication date: Jan-1994
https://doi.org/10.1109/24.370222
Vasilakos A(1991)On the behaviour of learning algorithms in a changing environment with application to data network routing problemComputer Standards & Interfaces10.1016/0920-5489(90)90069-R11:1(29-39)Online publication date: 2-Jan-1991
https://dl.acm.org/doi/10.1016/0920-5489%2890%2990069-R
Kim CReed D(1988)Adaptive packet routing in a hypercubeProceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 110.1145/62297.62382(625-630)Online publication date: 1-Jan-1988
https://dl.acm.org/doi/10.1145/62297.62382
Kim CReed D(1988)Adaptive packet routing in a hypercubeProceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 110.1145/62297.62382(625-630)Online publication date: 1-Jan-1988
https://dl.acm.org/doi/10.1145/62297.62382

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Packet routing algorithms for integrated switching networks

Packet switching networks and routing algorithms

Design and analysis of high-speed packet switching fabrics for integrated broadband networks