Connection Establishment in High-Speed Networks

The evolving view of connection establishment for connection-oriented services in high-speed networks such as ATM involves a contract negotiation process between a user agent and a network agent. The first stage consists of separate roles for the user and the network. The user agent must characterize the information streams that will be transmitted and the performance parameters that define the desired quality of service for that user. Similarly, the network agent must determine the network's resources and its capabilities to accommodate various mixes of service types. The second stage involves negotiations between multiple network and user agents, in which the parties agree to set up connections to transmit the agreed information streams in a manner to guarantee the agreed qualities of service, and at agreed prices. We focus on these two stages that together form the connection establishment process. After this process, during the connection, the network must police the user to determine compliance with the information stream characteristics, and must implement flow control, service priority mechanisms and packet multiplexing disciplines as necessary to guarantee the quality of service. >

[1]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, TNET.

[2]  Hiroshi Saito,et al.  Call admission control in an ATM network using upper bound of cell loss probability , 1992, IEEE Trans. Commun..

[3]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[4]  Jeffrey K. MacKie-Mason,et al.  Pricing the Internet , 1995 .

[5]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[6]  T. V. Lakshman,et al.  Statistical analysis and simulation study of video teleconference traffic in ATM networks , 1992, IEEE Trans. Circuits Syst. Video Technol..

[7]  Pravin Varaiya,et al.  Burstiness bounds for some burst reducing servers , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[8]  San-Qi Li,et al.  Study of information loss in packet voice systems , 1989, IEEE Trans. Commun..

[9]  Frank Kelly,et al.  On tariffs, policing and admission control for multiservice networks , 1993, Oper. Res. Lett..

[10]  Pravin Varaiya,et al.  A deterministic fluid model for cell loss in ATM networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[11]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[12]  Moshe Sidi,et al.  Performance and stability of communication networks via robust exponential bounds , 1993, TNET.

[13]  P. Skelly,et al.  A histogram-based model for video traffic behavior in an ATM multiplexer , 1993, TNET.

[14]  Pravin Varaiya,et al.  Correction to "A new approach to service provisioning in ATM networks" , 1993, TNET.

[15]  J. Burgin,et al.  Broadband ISDN resource management: the role of virtual paths , 1991, IEEE Communications Magazine.

[16]  Kohei Shiomoto,et al.  Dynamic Call Admission Control in ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[17]  Pravin Varaiya,et al.  A simple theory of traffic and resource allocation in ATM , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[18]  Scott Jordan,et al.  Multiplexing gains in bit stream multiplexors , 1995, TNET.

[19]  Pravin Varaiya,et al.  Throughput in multiple service, multiple resource communication networks , 1991, IEEE Trans. Commun..

[20]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[21]  D. Mitra.  Stochastic theory of a fluid model of producers and consumers coupled by a buffer , 1988, Advances in Applied Probability.

[22]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[23]  Liam Murphy,et al.  Distributed Pricing For Embedded ATM Networks , 1994 .

[24]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[25]  Liam Murphy,et al.  Bandwidth Allocation By Pricing In ATM Networks , 1994, Broadband Communications.

[26]  John Murphy,et al.  Optimising embedded ATM networks , 1993 .

[27]  Jean C. Walrand,et al.  Effective bandwidths for multiclass Markov fluids and other ATM sources , 1993, TNET.

[28]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[29]  Joseph Y. Hui.  Resource allocation for broadband networks , 1988, IEEE J. Sel. Areas Commun..

[30]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[31]  Scott Jordan,et al.  The Role of Price in the Connection Establishment Process , 1995 .

[32]  Deborah Estrin,et al.  Pricing in computer networks: motivation, formulation, and example , 1993, TNET.

[33]  Richard J. Gibbens,et al.  Effective bandwidths for the multi-type UAS channel , 1991, Queueing Syst. Theory Appl..

[34]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.