A.E. Eckberg, D.T. Luan, and D.M. Lucantoni. Meeting the challenge: Congestion and flow control strategies for broadband information transport. In IEEE GLOBECOM '89, Dallas, November 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of Budapest [1] Two similar shaping policies were investigated: an adaptation of the Generic Cell Rate Algorithm (GCRA) specified in the ITU T Recommendation I. 371 [25] for traffic policing (this shaping algorithm is already analyzed in Chapter 5 and [11] and a Token Bucket al..gorithm (TBA) [45, 35, 12]. This Chapter is organized as follows. Section 6.2 describes the structure of the 65 Segmentation Message generation VC 1 Segmentation . M U X Group 1 Shaper 1 Qs 1 C x C y C z Tt x Tt y Tt z Segmentation Message generation Segmentation . M U X ....

....of the shaping algorithm based on the GCRA are given in Chapter 5. The second policy is a shaping version of a simple leaky bucket, where again cells are delayed rather than discarded; similar to what is done in the literature, we refer to this policy with the name Token Bucket al..gorithm (TBA) [45, 35, 12] (look Appendix A for detail) The TBA has two key parameters: the first one is T, which is similar to the T parameter of the GCRA based shaping algorithm, the second one is the token buffer 67 size TBS. Note that, due to the presence of the output multiplexer, the allowed transmission time of C ....

A.E. Eckberg, D.T. Luan, and D.M. Lucantoni. Meeting the challenge: Congestion and flow control strategies for broadband information transport. In IEEE GLOBECOM '89, Dallas, November 1989.

....admission, the next cell will not be able to appropriate another token. It will either be dropped if no buffer is provided, resulting in loss, or buffered, resulting in delay. To overcome these disadvantages, a virtual leaky bucket mechanism (also referred to as a marking method) was proposed [4, 5, 23]. In this mechanism, violating cells, rather than being discarded or buffered, are permitted to enter the network with violation tags in their cell headers. These violating cells are discarded only when they arrive at a congested node. If there are no congested nodes along the routes, the ....

A. E. Eckberg, Jr., D. T. Luan and D. M. Lucantoni, "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport," Proc. IEEE GLOBECOM '89, pp. 49.3.1-49.3.5.

....which have not crystallized yet [1] Research is still necessary in many key areas, including the following. ffl Congestion and Flow Control for Broadband ISDN s is an open issue. The extremely high 2 OPEN ATM RESEARCH AREAS 3 bandwidths of ATM networks require the use of preventive control[4] [6] [7] strategies. Many subareas of congestion and traffic control are discussed in the following items. ffl A set of Traffic Descriptors which accurately captures the statistical characteristics of the traffic over the virtual connections need to be determined [4] Traffic descriptors are specified ....

Eckberg, A. E., D. T. Luan and D. M. Lucantoni. "Meeting the Challenge: Congestionand Flow Control for Broadband Information Transport." In Integrated Broadband Networks, pp. 255-259, Ed. Amit Bhargava, Artech House, MA 1991.

....A traffic source on a communication network may generate constant traffic at regular time intervals, or generate long packet trains corresponding, for instance, to packetized digital video or audio signal. The traffic in ATM networks is expected to be highly irregular, correlated and bursty [5]. All the processes we consider here are of discrete time, that is, the state of the system may change at discrete increments of time t 0 ; t 1 ; t n . We start with the simplest arrival pattern traffic model, the Bernoulli Process. 3.1 Bernoulli Processes The Stochastic Process fX n ; n = ....

Eckberg, A. E., D. T. Luan, and D. M. Lucantoni, "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport," Proc. IEEE Globecom 1989, pp. 49.3.1--49.3.5, Nov. 1989.

....(backpressure) should be used. Since every network can have overloads of all durations, every network needs a combination of controls at various levels. No one scheme can solve all congestion problems. An example of a combined approach is given in a proposal by Eckberg, Luan, and Lucantoni [23]. This proposal requires a leaky bucket admission control for normal operation, a source based control for packet loss, and a session denial for longer term congestion. Another related issue is that of multiple competing schemes at the same level. In standards committee meetings, the lack of ....

A. E. Eckberg, Jr., D. T. Luan, and D. M. Lucantoni, "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport," Proc. Globecom'89, Dallas, TX, November 27-30, 1989, Vol. 3, pp. 1769-1773. Figure Captions

....the interplay among finite buffer size, packet delay and loss will be the major concern in our study. Another important aspect in statistical multiplexer design is congestion and overload control. It is the key to robust system operations for providing services of guaranteed quality to users [17, 18]. A proper design of overload control will not only protect high priority packets against low ones in competition for buffer room, but also prevent time critical packets from being excessively delayed [5] Controls can also be used to regulate input rates and relieve congestions [19] It is ....

A.E. Eckberg,Jr., D.T. Luan and D.M. Lucantoni,"Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport," IEEE GLOBECOM'89, Dallas, November, 1989, pp.1769--1773.

....be retransmitted later, thereby wasting network resources. In general, flow control is necessary whenever there is a constraint on the communication rate between two points due to limited capacity of the communication lines or the processing hardware. There are several ways to achieve flow control [1, 2, 3, 4, 5], such as call blocking (circuit switched networks in telephony systems) packet discarding and packet blocking (packet switched networks) etc. Call blocking refers to the procedure that a session is simply blocked from entering the network. An example of this is the voice telephone network. Such ....

A. E. Eckberg, D. T. Luan, and D. M. Lucantoni, "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport," Proc. Globecom '89, pp.49.3.1-49.3.5.

....contract [WOOD90, RATH91] Violating traffic is discarded at its entry to the network to guarantee that congestion will not occur. Alternatively, violating traffic is permitted to enter the network with violation tags, for preferred deletion within the network, in the presence of congestion [ECK89]. Other proposed refinements to traffic flow enforcement include shaping of the input traffic, based on buffering of the excess traffic at its entry points to the network [BERG91] The leaky bucket scheme [TUR86] is an access control mechanism that has received considerable attention in the ....

A. E. Eckberg Jr., D. T. Luan, and D. M. Lucantoni, "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport," in Proceeding of the IEEE GLOBECOM '89, pp. 49.3.1--49.3.5, 1989.

....For competing cells of the same priority, Chao proposes the use of departure sequence (DS) numbers to prevent interference. A cell s DS number is assigned based on the arrival time of the first cell of the connection and the average arrival rate of the connection. Eckberg, Luan, and Lucantoni [11] propose a core network congestion control termed Bandwidth Management, that consists of selectively tagging cells that correspond to excessive traffic and discarding them when and where congestion is encountered. Yin, Li, and Stern [12] classify voice packets for ATM Voice networks into class ....

A.E. Eckberg, D.T. Luan, and D.M. Lucantoni, "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport," IEEE GLOBECOM '89, Dallas, November 1989, pp. 1769-1773.

....Engineering Department, TechnionIsrael Institute of Technology, Haifa, 32000, ISRAEL. This work was done in part while visiting the IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY 10598. trol scheme or variations and or generalizations of it have been proposed [2] 6] [10], 16] 19] Using leaky bucket, the transport network regulates each source which utilizes the network resources so that each source stays on the average within its allowable rate and allocated bandwidth as an attempt to guarantee some grade of service. Therefore, it is important to understand ....

A. E. Eckberg, D. T. Luan and D. M. Lucantoni, "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport," GLOBECOM'89 pp. 49.3.1-49.3.5, 1989.

....allowed access if it is accepted on each link on the investigated route. VP configuration allows the network behavior to be changed dynamically as bandwidth allocated to VPs can be altered dynamically and VP routing tables and route selection can be altered to meet changing traffic requirements [13]. Therefore, the VP level is the most relevant control level. We assume in order for that solution to be feasible that the switch buffers are subdivided at the conception level per VP and not shared among all VPs linked to that switch. According to the information processed by the call admission ....

A.E. Eckberg, D.T. Luan and D.M. Lucantoni. "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport". IEEE Globecom 89, pp 17691773.

No context found.

A.E. Eckberg, Jr et al., "Meeting the Challenge: Congestion and Flow Control Strategies for Broadband Information Transport", in Proc. IEEE GLOBECOM'89, pp. 49.3.1-49.3.5, 1989.

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