A. Dailianas and A. Bovopoulis, Real-Time Admission Control Algorithms with Delay and Loss Guarantees in ATM networks, IEEE Proceedings of INFOCOM'94, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....an architecture to provide guaranteed service without per flow state management by using a technique called dynamic packet state (DPS) 19] Our work is based on static priority scheduling algorithm, which is relatively simple and widely supported. Admission control has been investigated widely [8], 10] 15] The various approaches differ from each other in that they may require different scheduling schemes and so can be of vastly different complexity. For example, traditional admission control in networks with static priority scheduling is very complicated. Due to absence of flow ....

A. Dailianas and A. Bovopoulis, Real-Time Admission Control Algorithms with Delay and Loss Guarantees in ATM networks, IEEE Proceedings of INFOCOM'94, 1994.

....mainly focuses on admission control and packet scheduling. With certain traffic models, a number of end to end delay calculation methods have been proposed for a large variety of packet scheduling mechanisms [2] 3] 13] 16] 26] 36] Finally, admission control has also been investigated [12], 14] One common limitation of all these systems is their scalability. While they provide deterministic services, they are not scalable to a large internetwork due to their run time overhead in admission control and packet scheduling. B. Providing deterministic services whithin the diffserv ....

A. Dailianas and A. Bovopoulis, Real-time admission control algorithms with delay and loss guarantees in ATM networks, Proceedings of INFOCOM'94, pages 1065--1072, 1994.

....state management by using a technique called dynamic packet state (DPS) 18] Our work is based on static priority scheduling algorithm, which is relatively simple and widely supported. Admission control is a mean to provide service guarantees. Admission control has been investigated widely [7], 9] 15] They are different from each other in the senses of the different scheduling schemes involved, and their complexity. The traditional admission control in the static priority scheduling network is very complicated. Due to absence of flow separation, for any new arrival flow request, ....

A. Dailianas and A. Bovopoulis, Real-time admission control algorithms with delay and loss guarantees in ATM networks, Proceedings of INFOCOM '94, pages 1065--1072, 1994.

....rate variance envelopes for several long traces of compressed video to show how it captures the burstiness properties of realistic network trac sources. In this paper, we will use this rate variance envelope to do statistical delay analysis. Admission control has been investigated widely [4, 7, 14]. The various approaches di er from each other in that they may require di erent scheduling schemes and so can be of vastly di ferent complexity. For example, traditional admission control in networks with static priority scheduling is very complicated. Due to absence of ow separation, for any ....

A. Dailianas and A. Bovopoulis, Real-time admission control algorithms with delay and loss guarantees in ATM networks, Proceedings of INFOCOM'94, pages 1065-1072, 1994.

....has been proposed in the last decade. First, with some trac models, a number of end to end delay calculation methods have been proposed [9, 10, 15, 16] Also, many packet scheduling mechanisms have been provided [7, 11, 13, 17, 19, 20, 30] Finally admission control has been investigated as well [12, 14, 18]. Much of this work addresses admission control and packet scheduling. Some deal with meeting end to end delay requirements. Some of the proposals have been implemented and deployed, for example, NetEx, RSVP, and Tenet. NetEx [2, 3] is a good working example of implemented system based on ....

A. Dailianas and A. Bovopoulis, \Real-time admission control algorithms with delay and loss guarantees in ATM networks," In Proceedings of INFOCOM'94, pages 1065-1072, 1994.

....6] While these previous studies were innovative and aimed at improving performance in terms of end to end delay or bandwidth consumption, there has been no report on providing QoS guarantees to anycast ows. Admission control is a mean to provide QoS guarantees and has been studied extensively [7, 8, 9, 10, 11]. Generally speaking, there are two classes of admission control mechanisms: centralized admission control and distributed admission control. For instance, NetEx [10] adopts centralized admission mechanism to provide end to end delay guarantees in a LAN environment. The centralized admission ....

A. Dailianas and A. Bovopoulis, \Real-time admission control algorithms with delay and loss guarantees in ATM networks," In Proc. of INFOCOM'94, 1994.

....an architecture to provide guaranteed service without per flow state management by using a technique called dynamic packet state (DPS) 19] Our work is based on static priority scheduling algorithm, which is relatively simple and widely supported. Admission control has been investigated widely [8], 10] 15] The various approaches differ from each other in that they may require different scheduling schemes and so can be of vastly different complexity. For example, traditional admission control in networks with static priority scheduling is very complicated. Due to absence of flow ....

A. Dailianas and A. Bovopoulis, Real-Time Admission Control Algorithms with Delay and Loss Guarantees in ATM networks, IEEE Proceedings of INFOCOM'94, 1994.

....has been proposed in the last decade. First, with some trac models, a number of end to end delay calculation methods have been proposed [13, 14, 19, 20] for a large variety of packet scheduling mechanisms [11, 15, 17, 21, 23, 24, 34] Finally admission control has been investigated as well [16, 18, 22]. Much of this work addresses admission control and packet scheduling. Some of it deals with meeting end to end delay requirements. Some of the proposals have been implemented and deployed, for example, NetEx, RSVP, and Tenet. NetEx [6, 7] is an example of an implemented system based on ....

A. Dailianas and A. Bovopoulis, \Real-time admission control algorithms with delay and loss guarantees in ATM networks," In Proceedings of INFOCOM'94, pages 1065-1072, 1994.

....are concerned, much research has been proposed. For a variety of traffic models, end to end delay calculation methods have been proposed [9, 10, 15, 16] Also, many packet scheduling mechanisms have been provided [7, 11, 13, 17, 19, 20, Finally, admission control has been investigated as well [12, 14, 18]. Some of the proposals have been implemented and deployed, for example, NetEx, RSVP, and Tenet. NetEx [2, 3] is a good working example of implemented system based on extensions of Cruz s methodology for delay analysis [4, 5, 6] RSVP [21] has been proposed as the signaling and resource ....

A. Dailianas and A. Bovopoulis, "Real-time admission control algorithms with delay and loss guarantees in ATM networks, " In Proceedings of INFOCOM'94, pages 1065--1072, 1994.

....delay guarantees are concerned, much research has been proposed in the last decade. With some traffic models, a number of end to end delay calculation methods have been proposed [9, 10] for a large variety of packet scheduling mechanisms [7, 11, 14] Admission control has been investigated as well [12, 13]. Much of this work addresses admission control and packet scheduling. Some of it deals with meeting end to end delay requirements. Some of the above proposals have been implemented and deployed, for example, NetEx, and Tenet. NetEx [5] is an example of an implemented system based on extensions ....

A. Dailianas and A. Bovopoulis, "Real-time admission control algorithms with delay and loss guarantees in ATM networks," Proc. of INFOCOM, 1994.

....is carried transparently inside the network (no processing like error control is performed on it inside the network) and cell sequence integrity is preserved per virtual channel. 2 Continuous Media A multimedia ATM network is shared by media streams with different performance requirements [8,9]. For media streams such as file transfers, the preservation of guarantees for loss probability at the burst level is of primary importance, while for media streams such as voice, loss guarantees at the cell level are sufficient. Applications with real time data transport requirements which ....

Apostolos Dailianas and Andreas Bovopoulos, "Real-time admission control algorithms with delay and loss guarantees in ATM networks,", in Proceedings of the Conference on Computer Communications (IEEE Infocom), (Toronto, Canada), June 1994.

....will form a feedback loop, creating a cyclic dependency among the connections. Most previous work assumes that either the cyclic dependencies do not exist or are eliminated by some internal network control mechanism (e.g. traffic regulation, reshaping by dedicated hardware and framing) [4, 9, 2, 22, 6]. A major contribution of this study is that we develop a CAC algorithm that explicitly takes into account the possible cyclic dependencies among connections without using any special network control mechanisms. 3 Preliminaries Recall that an ATM LAN should accept an HRT connection only if it can ....

A. Dailianas and A. Bovopoulis. Real-time admission control algorithms with delay and loss guarantees in ATM networks. In Proceedings of INFOCOM'94, pages 1065--1072, 1994.

....node keeps track of usage of local resources such as storage and interconnect bandwidth and performs local admission control. The resource reservation and admission algorithms used to accomplish this will be similar to the ones proposed in the context of the atm networks and the end systems [9, 11, 28]. ffl Scheduling support: Each node, completely manages real time scheduling of local data read and write functions for each active stream. The scheduling schemes employed by the node are a topic of our on going research [3] and one such example scheduling scheme is described in subsequent ....

Dailianas, A., and Bovopoulos, A., "Real-time Admission Control Algorithms with Delay and Loss Guarantees in ATM Networks," Proceedings of IEEE INFOCOM'94, Vol. 3, pp. 1065-1072, June, 1994.

....scheduling discipline is used at the ATM switches. Most previous work also assumes that either cyclic dependencies among connections do not exist or that they are eliminated by some internal network control mechanism (e.g. traffic regulation, reshaping by dedicated hardware, and framing) [2, 4, 5, 11]. We explicitly take into account possible cyclic dependencies among connections without using such mechanisms. We investigate and obtain conditions under which the system is stable and are able to determine the delay bounds under such conditions. 3. Connection and Network Modes Real time ....

A. Dailianas and A. Bovopoulis. Real-time admission control algorithms with delay and loss guarantees in ATM networks. In Proc. of INFOCOM'94.

....of guarantees for loss probability at the burst level are of primary importance, while, for media channels such as voice, loss guarantees at the cell level are sufficient. Continuous media have stringent delay jitter requirements. Finally, some applications require loss free transmission. In [3] the first complete traffic management scheme for multimedia ATM networks is introduced. It supports four different classes of traffic, each of which has different performance requirements expressed in terms of delay jitter guarantees and cell or burst level loss guarantees (Table 1) A complete ....

.... each of which has different performance requirements expressed in terms of delay jitter guarantees and cell or burst level loss guarantees (Table 1) A complete specification of the way the switches operate as well as real time connection admission control (CAC) algorithms are presented in [3]. The approach studied in [3] provides support for a very wide variety of sources, but apart from the inherent efficiency achieved through the use of statistical multiplexing, no explicit mechanisms to increase the efficient use of network resources are considered. 2 Table 1: Classification of ....

[Article contains additional citation context not shown here]

A.Dailianas, A.D.Bovopoulos "Real-time Admission Control Algorithms with Delay and Loss Guarantees in ATM Networks," IEEE INFOCOM'94, Ontario, Canada, June 1994, Vol.3, pp 1065-1072.

....of guarantees for loss probability at the burst level are of primary importance, while, for media channels such as voice, loss guarantees at the cell level are sufficient. Continuous media have stringent delay jitter requirements. Finally, some applications require loss free transmission. In [3] a complete traffic management scheme for multimedia ATM networks is introduced. It supports four different classes of traffic, with different performance requirements expressed in terms of delay and loss guarantees (Table 1) A complete specification of the way the switches operate as well as ....

....introduced. It supports four different classes of traffic, with different performance requirements expressed in terms of delay and loss guarantees (Table 1) A complete specification of the way the switches operate as well as real time connection admission control (CAC) algorithms are presented in [3]. 1 This work was done in Computer Communications Research Center, Washington University in St.Louis. The approach proposed in [3] along with all networks that do not exercise any explicit control over loss of information due to congestion, cannot adjust the loss probability provided to each ....

[Article contains additional citation context not shown here]

A.Dailianas, A.D.Bovopoulos "Real-time Admission Control Algorithms with Delay and Loss Guarantees in ATM Networks," IEEE INFOCOM'94, Ontario, Canada, June 1994, Vol.3, pp 1065-1072.

....of nodes the media stream traverses from source to destination. Examples of network designs that provide delay guarantees according to the delay requirements of each user can be found in [4, 27] while designs that provide strict jitter guarantees and a constant end to end delay can be found in [15, 23, 24, 48]. A brief classification of services according to their QoS requirements can be found in [25] 3. Traffic Modeling To develop an analytical method or to obtain simulation results concerning congestion in a network, a mathematical description of the traffic entering the network must be ....

....including the new source. If acceptance of the new source leads to a violation of the contract with any of the already accepted sources or failure to guarantee the requested quality for the new source, then the new source is rejected. Examples of application of the QoS evaluation method abound [4, 15, 16, 19, 42, 41, 50]. In the equivalent bandwidth method the acceptance criterion is the existence of link bandwidth equal to the equivalent bandwidth. The equivalent bandwidth is defined as the bandwidth required to satisfy the requested QoS, given a particular buffer size and set of active sources. The use of ....

[Article contains additional citation context not shown here]

A. Dailianas and A. Bovopoulos "Real-time Admission Control Algorithms with Delay and Loss Guarantees in ATM Networks," Technical Report WUCS-93-31, Washington University in St. Louis, and in proceedings of INFOCOM'94.

No context found.

A. Dailianas and A. Bovopoulis. Real-time admission control algorithms with delay and loss guarantees in ATM networks. In Proceedings of INFOCOM'94, pages 1065--1072, 1994.

No context found.

A. Dailianas and A. Bovopoulis. Real-time admission control algorithms with delay and loss guarantees in ATM networks. In Proceedings of INFOCOM'94, pages 1065--1072, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC