A. Mukherjee, L. Landweber, and T. Faber. Dynamic Time Windows and Generalized Virtual Clock:Combined Closed-Loop/Open-Loop Congestion Control. In Proceedings of IEEE INFOCOM, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....control mechanisms in broadband networks have been significantly increased. Several new strategies for congestion control proposed for high speed networks, such as Virtual Clock, Delay Earliest Due Date (Delay EDD) Jitter Earliest Due Date (Jitter EDD) Zhang et al. 1994) Dynamic Time Windows (Mukherjee et al. 1992) and Generalized Processor Sharing (Parekh et al. 1993) suffer from certain disadvantages. The main problems connected with these mechanisms (so called sorted priority queue mechanisms) stem from the difficulties of providing diverse worst case guarantees as well as from the need to monitor the ....

Mukherjee, A., Landweber, L. and Farber, T. (1992) Dynamic Time Windows and Generalized Virtual Clocks: Combined Closed Loop/Open Loop Congestion Control. IEEE Infocom'92, Florence.

....the pace of events occurring in such a network. Furthermore, several new strategies for congestion control recently proposed for high speed networks, such as Virtual Clock [Zha90] Delay Earliest Due Date (DelayEDD) FV90] Jitter Earliest Due Date (Jitter EDD) VZF91] and Dynamic Time Windows [MLF92], are not very advantageous either. The main problems connected with these mechanisms (so called sorted priority queue mechanisms) stem from the difficulties of providing diverse worstcase guarantees (as mentioned above) as well as from the need to monitor the traffic on a perpacket or ....

Mukherjee, A., Landweber, L. and Farber, T.,"Dynamic Time Windows and Generalized Virtual Clocks: Combined Closed Loop/Open Loop Congestion Control," in Proceedings of IEEE INFOCOM'92, Florence, Italy, pp. 322 - 332, May 1992.

....window based enforcement scheme is employed. A single sliding window mechanism for traffic shaping was incorporated for traffic regulation by Rigolio and Fratta in [RF91] In that paper, the shaper consisted of a sliding window followed by a server operating at a constant rate. Mukherjee et. al in [MLF92] describes a dynamic time window scheme for end to end congestion control for data traffic. Our scheme employs more than one window, which jointly provide a more general control over the burstiness of the input stream. The effect of the window parameters on delay distribution and the loss ....

A. Mukherjee, L. H. Landweber, and Theordore Faber. Dynamic Time Windows and Generalized Virtual Clock: Combined Closed-Loop/Open-Loop Congestion Control. In Proceedings of IEEE INFOCOM'92, pages 322--332, Firenze, Italy, May 1992.

....of buffer space is required in nodes to minimize the risk of buffer overflow. Furthermore, several new strategies for congestion control proposed for high speed networks, such as Virtual Clock, Delay Earliest Due Date (Delay EDD) Jitter Earliest Due Date (Jitter EDD) ZF94] Dynamic Time Windows [MLF92] and Generalized Processor Sharing [PG93] are not very advantageous either. The main problems connected with these mechanisms (so called sorted priority queue mechanisms) stem from the difficulties of providing diverse worst case guarantees as well as from the need to monitor the traffic on a ....

Mukherjee, A., Landweber, L. and Farber, T.,"Dynamic Time Windows and Generalized Virtual Clocks: Combined Closed Loop/Open Loop Congestion Control," in Proceedings of IEEE INFOCOM'92, Florence, Italy, pp. 322 - 332, May 1992.

....so that an appropriate control action can be taken, the sources may have already flooded a large volume of traffic into the network. Thus, reactive control is not a feasible approach to handle congestion in the transport plane where the time scale corresponds to the cell transmission speed. In [7], it is shown that the efficiency of the network can be improved significantly by combining preventive control with the reactive control which reacts to the congestion with the medium to long time scale. The present work is concerned with UPC design for an end to end congestion control ....

A. Mukherjee, L. H. Landweber, and T. Faber. Dynamic time windows and generalized virtual clock: Combined closed-loop/open-loop congestion control. INFOCOM'92, pages 322--332, Florence, Italy, 1992.

No context found.

A. Mukherjee, L. Landweber, and T. Faber. Dynamic Time Windows and Generalized Virtual Clock:Combined Closed-Loop/Open-Loop Congestion Control. In Proceedings of IEEE INFOCOM, 1992.

No context found.

A. Mukherjee, L. Landweber, and T. Faber. Dynamic Time Windows and Generalized Virtual Clock:Combined Closed-Loop/Open-Loop Congestion Control. In Proceedings of IEEE INFOCOM, 1992.

....this involved checking if the delay was above its minimum possible value and take appropriate action. While network delays are known to be stochastic, its properties are not well understood, and we were interested in investigating its properties. Several other recent congestion control studies [9, 14, 15, 27, 32] attempted to classify switch congestion by time scales over which they occur, and proposed mechanisms that address each time scale. For example, in [15] Hui considered packet level, burst level and call level as three time scales with the idea that for high bandwidth delay product networks, one ....

....use open loop control for shorter time scales and closed loop control for longer time scales. We had similarly assumed the presence of short term and medium term congestion in order to distinguish between the dynamics that occur within a round trip time and those that occur over longer periods [9, 27]. We were interested in determining the impact of slower time scales experimentally. Specifically, we were interested in studying the correlations between packet loss and low frequency components of delay. 3. Need for realistic assumptions in simulations: Simulation studies (necessarily) in ....

[Article contains additional citation context not shown here]

Mukherjee, A., L.H. Landweber and T. Faber, "Dynamic time windows and generalized virtual clock: combined closed-loop/open-loop congestion control," Proc. IEEE Infocorn, Florence, pp 322-332, May 1992.

....can provide different grades of service to different users and can handle multiple frame sizes is needed. Possible solutions from the literature include: a) Schedulers that implement Hierarchical Round Robin [14] Weighted Fair Queuing [4] Virtual Clock[31] or generalizations of Virtual Clock [24] in order to provide heterogeneous frame rates. Scheduling may be performed on individual circuits or on aggregated classes of circuits. The pros and cons of these schedulers are as follows. ffl Pros: hardware implementations for several of these algorithms exist and serve as proof of concept. ....

Mukherjee, A., L.H. Landweber and T. Faber, "Dynamic time windows and generalized virtual clock: combined closed-loop/open-loop congestion control," Proc. IEEE Infocom, Florence, pp 322-332, May 1992.

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