article

Free access

Dynamic adaptive windows for high speed data networks: theory and simulations

Authors:

J. B. SeeryAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 20, Issue 4

Pages 30 - 40

https://doi.org/10.1145/99517.99527

Published: 01 August 1990 Publication History

Abstract

Recent results on the asymptotically optimal design of sliding windows for virtual circuits in high speed, geographically dispersed data networks in a stationary environment are exploited here in the synthesis of algorithms for adapting windows in realistic, non-stationary environments. The algorithms proposed here require each virtual circuit's source to measure the round trip response times of its packets and to use these measurements to dynamically adjust its window. Our design philosophy is quasi-stationary: we first obtain, for a complete range of parameterized stationary conditions, the relation, called the “design equation”, that exists between the window and the mean response time in asymptotically optimal designs; the adaptation algorithm is simply an iterative algorithm for tracking the root of the design equation as conditions change in a non-stationary environment. A report is given of extensive simulations of networks with data rates of 45 Mbps and propagation delays of up to 47 msecs. The simulations generally confirm that the realizations of the adaptive algorithms give stable, efficient performance and are close to theoretical expectations when these exist.

References

[1]

M. Reiser, "A queueing-network analysis of computer communication networks with window ttow control," IEEE Trans. Comm., COM-27, 1979. pp. 11#-1209.

[2]

M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis, Addison-Wesley, Reading, Mass., 1987.

Digital Library

[3]

A. S. Tanenbaum, Computer Networks, Prentice HalL Englewood Cliffs, HJ, 1988.

Digital Library

[4]

D. Bertsekas and R. Gallager, Data Ne#ork.~, Prentice Hall, Englewood Cliffs, NJ, 1987.

[5]

$. P. Morgan, "Window flow control on a trunked byte-stream virtual circuit," IEEE Trans. Commun., COM-36, July 1988, pp. 816-825.

[6]

V. Jacobsen, "Congestion avoidance and control," Prec. ACM SIGCOMM, 1988, pp. 314-329.

Digital Library

[7]

P. Karn and C. Partridge., "Improving round.trip time estimates in reliable transport protocols," Prec. ACM SIGCOMM 1987, pp. 2-7.

Digital Library

[8]

K. K. Ramak:rishnan and R. Jaln, "A binary feedback scheme for congestion avoidance in computer networks with a connccdonless network layer," Prec. ACM SIGCOMM, 1988, pp. 303-313.

Digital Library

[9]

R. Jain. "A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks," Report DEC-TR-556, 1988, Digital Equipment Corp.

[10]

D. Mitra. "Optimal design of windows for high speed data networks," Prec. IEEE INFOCOM'90, IEEE Computer Society Press, 1990, pp. 1156-1163. This paper reports partial results fa'om "Optimal design of congestion control for high speed data networks," AT&T Bell Laboratories report, 1989, submitted for publication.

[11]

R. lain, K. Ramalcrishnan and D. Chiu, "Congestion avoidance in computer networks with a connectionless network layer," in Innovations in lrdernetworldng, Altech House, 1988.

Digital Library

[12]

L. Zhang, A New Architecture for Packet Switching Network Protocols, MIT Ph.D. thesis, Laboratory for Computer Science, Cambridge, Mass., 02139.

[13]

A. E. Eckberg, D. T. Luan and D. M. Lucantoni, "Bandwidth management: a congestion control strategy for broadband packet networks: characterizing the thtoughput-bursdness filter," Prec. 1TC Specialist Seminar, Adelaide., 1989, paper no. 4.4.

[14]

J. McKerma, D. Mitra and K. G. Ramakrishnan, "A class of closed Markovian queueing networks: integral representations, asymptotic expansions and generalizations," Bell System Tech. L, 60, 1981, pp. 599-641.

[15]

J. McKenna and D. Mitra, "Asymptotic expansions and integral representations of moments of queue lengths in closed queueing networks," J. ACM, 31, no. 2, 1984, pp. 346-36O.

Digital Library

[16]

D. Mitra and K. G. Ramakrishnan, "A numerical investigation on the optimal design of congestion controls for high speed data networks," Prec. ICCC. New Delhi, 1990.

[17]

A. Giessler, J. Hanle, A. Konig and E. Pade, "Free buffer allocation- an investigation by simulation," Comput. Networks, 2, 1978.

[18]

L. Kleinrock. "'On detemdnistic rules for probabilisdc problems in computer communications," Proc. ICC, vol. 3, June 1979.

[19]

D. Mitra and I. Mitrani, "Asymptotic optimality of the go-back-n protocol in high speed data networks with small buffers," Prec. Fourth International Conf. on Data Communications Systems and Their Performance, IHP, Barcelona, June 1990, pp. 17-31.

[20]

K. G. Ramakrishnan and D. Mi{ra, "PANACEA: An integrated set of tools for performance analysis," in Modelling Techniques and Tools for Computer Evaluations, F,d. R. Puigjanet and D. Potier, Plenum Press. N.Y. 1988.

[21]

J.B. Seery, "Customizing PANACEMSimulation," internal AT&T Bell Laboratories memorandum.

[22]

D. Mitra and J. B. Seery, "Dynamic Adaptive Windows for High Speed Data Networks: Theory and Simulations," AT&T Bell Laboratories report, April 1990, submitted for publication.

Cited By

Liu WDuan HWu JLi XRen P(2004)Algorithms for Congestion Detection and ControlGrid and Cooperative Computing - GCC 2004 Workshops10.1007/978-3-540-30207-0_47(374-381)Online publication date: 2004
https://doi.org/10.1007/978-3-540-30207-0_47
Jain MDovrolis C(2003)End-to-end available bandwidthIEEE/ACM Transactions on Networking10.1109/TNET.2003.81530411:4(537-549)Online publication date: 1-Aug-2003
https://dl.acm.org/doi/10.1109/TNET.2003.815304
Ranasinghe DGray WDavidson A(1995)Stability and Optimality of Continuous Time M-ary Rate Control MechanismsComputer Networks, Architecture and Applications10.1007/978-0-387-34887-2_3(33-51)Online publication date: 1995
https://doi.org/10.1007/978-0-387-34887-2_3
Show More Cited By

Index Terms

Dynamic adaptive windows for high speed data networks: theory and simulations
1. Networks

Recommendations

Dynamic adaptive windows for high speed data networks: theory and simulations
SIGCOMM '90: Proceedings of the ACM symposium on Communications architectures & protocols

Recent results on the asymptotically optimal design of sliding windows for virtual circuits in high speed, geographically dispersed data networks in a stationary environment are exploited here in the synthesis of algorithms for adapting windows in ...
Dynamic Vehicle-Cargo Matching Based on Adaptive Time Windows
Web and Big Data
Abstract
The core task of vehicle-cargo matching is to dispatch the cargoes to the trucks. The existing matching policies mainly focus on maximizing the shipping weight for each truck. Due to each cargo is bulky and heavy in bulk logistics area, such ...
Schedule design for sustainable container supply chain networks with port time windows

This paper studies a practical liner shipping schedule design problem with port time windows for container supply chain networks. A mixed-integer nonlinear non-convex model that incorporates the availability of ports is proposed to minimize the sum of ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 20, Issue 4

Sep. 1990

316 pages

ISSN:0146-4833

DOI:10.1145/99517

Editor:
Phil Karn

Issue’s Table of Contents

SIGCOMM '90: Proceedings of the ACM symposium on Communications architectures & protocols
August 1990
318 pages
ISBN:0897914058
DOI:10.1145/99508
Chairman:
Phil Karn

Copyright © 1990 ACM.

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 August 1990

Published in SIGCOMM-CCR Volume 20, Issue 4

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

68
Total Citations
View Citations
712
Total Downloads

Downloads (Last 12 months)86
Downloads (Last 6 weeks)11

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Liu WDuan HWu JLi XRen P(2004)Algorithms for Congestion Detection and ControlGrid and Cooperative Computing - GCC 2004 Workshops10.1007/978-3-540-30207-0_47(374-381)Online publication date: 2004
https://doi.org/10.1007/978-3-540-30207-0_47
Jain MDovrolis C(2003)End-to-end available bandwidthIEEE/ACM Transactions on Networking10.1109/TNET.2003.81530411:4(537-549)Online publication date: 1-Aug-2003
https://dl.acm.org/doi/10.1109/TNET.2003.815304
Ranasinghe DGray WDavidson A(1995)Stability and Optimality of Continuous Time M-ary Rate Control MechanismsComputer Networks, Architecture and Applications10.1007/978-0-387-34887-2_3(33-51)Online publication date: 1995
https://doi.org/10.1007/978-0-387-34887-2_3
Wilder RRamakrishnan KMankin A(1992)Effectiveness of congestion avoidance: a measurement study[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications10.1109/INFCOM.1992.263528(2378-2390 vol.3)Online publication date: 1992
https://doi.org/10.1109/INFCOM.1992.263528
Wilder RRamakrishnan KMankin A(1991)Dynamics of congestion control and avoidance of two-way traffic in an OSI testbedACM SIGCOMM Computer Communication Review10.1145/122419.12242221:2(43-58)Online publication date: 1-Apr-1991
https://dl.acm.org/doi/10.1145/122419.122422
Mitra DSeery J(1991)Dynamic adaptive windows for high speed data networks with multiple paths and propagation delaysIEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings10.1109/INFCOM.1991.147482(39-48 vol.1)Online publication date: 1991
https://doi.org/10.1109/INFCOM.1991.147482
Mitra DMitrani I(1991)Asymptotic Optimality of the Go-Back-n Protocol In High Speed Data Newworks With Small BuffersData Communication Systems and their Performance10.1016/B978-0-444-88756-6.50009-8(55-68)Online publication date: 1991
https://doi.org/10.1016/B978-0-444-88756-6.50009-8
Mitra DSeery J(1990)Dynamic adaptive windows for high speed data networks: theory and simulationsACM SIGCOMM Computer Communication Review10.1145/99517.9952720:4(30-40)Online publication date: Aug-1990
https://doi.org/10.1145/99517.99527
Patel SGupta PSingh G(2010)Performance measure of Drop tail and RED algorithm2010 2nd International Conference on Electronic Computer Technology10.1109/ICECTECH.2010.5479996(35-38)Online publication date: May-2010
https://doi.org/10.1109/ICECTECH.2010.5479996
Lee DSengupta B(2007)Temporal placement control of video frames in ATM networksInternational Journal of Communication Systems10.1002/dac.45000704097:4(329-335)Online publication date: 21-Mar-2007
https://doi.org/10.1002/dac.4500070409
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents