The FCVC (flow-controlled virtual channels) proposal for ATM networks: a summary

Kung, H. T.; Chapman, A.

doi:10.1109/icnp.1993.340926

Cited by 62 publications

(30 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We develop a distributed, hop-by-hop congestion control scheme, which is shown to be stable in the absence of propagation delays. Hop-by-hop congestion control algorithms have been studied in the Internet context [7], [8], [9]. Such schemes provide feedback about the congestion state at a node to the hop preceding it.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network

Shakkottai

2007

IEEE/ACM Trans. Networking

238

160

View full text Add to dashboard Cite

Abstract-This paper focuses on congestion control over multihop, wireless networks. In a wireless network, an important constraint that arises is that due to the MAC (Media Access Control) layer. Many wireless MACs use a time-division strategy for channel access, where, at any point in space, the physical channel can be accessed by a single user at each instant of time.In this paper, we develop a fair hop-by-hop congestion control algorithm with the MAC constraint being imposed in the form of a channel access time constraint, using an optimization based framework. In the absence of delay, we show that this algorithm are globally stable using a Lyapunov function based approach. Next, in the presence of delay, we show that the hop-by-hop control algorithm has the property of spatial spreading. In other words, focused loads at a particular spatial location in the network get "smoothed" over space. We derive bounds on the "peak load" at a node, both with hop-by-hop control, as well as with end-to-end control, show that significant gains are to be had with the hop-by-hop scheme, and validate the analytical results with simulation.

show abstract

Section: Introductionmentioning

confidence: 99%

“…The preceding node then adapts its transmission rate based on this feedback. Feedback is typically provided [7], [8], [10], [11], [9] based on the queue length at the congested node. If the queue length exceeds a threshold, congestion is indicated and the preceding node is notified in order to decrease its transmission rate.…”

Section: Introductionmentioning

confidence: 99%

Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network

Shakkottai

2007

IEEE/ACM Trans. Networking

238

160

View full text Add to dashboard Cite

show abstract

“…However, with the introduction of ATM and the requirement for supporting variable bit-rate tracs, more and more people have realized that it would not be possible to achieve a satisfactory network utilization without a feedback ow control mechanism. Many schemes for implementing such a mechanism have been proposed [21,22,24,23], and among them the most similar ones to ours are the link-by-link per-connection credit-based feedback ow control schemes [21,22]. Comparing with these schemes, the one proposed in this paper has been signicantly simplied in the following two ways:…”

mentioning

confidence: 99%

“…The above two simplications make our scheme easier to implement and requiring smaller buer space than that of [21,22] while maintaining a comparable bandwidth sharing capacity. 4 Implementation…”

mentioning

confidence: 99%

See 1 more Smart Citation

An enhanced timed-round-robin traffic control scheme for ATM networks

Qin

Proceedings of LCN - 21st Annual Conference on Local Computer Networks

View full text Add to dashboard Cite

ATM (asynchronous transfer mode) aims at providing both guaranteed bandwidth to support real-time communications and dynamic bandwidth sharing to accommodate bursty data traffic. Achievement of this goal is vital to make ATM an enabling technology for the future integrated digital networks. To realize this objective, good algorithms for controlling network traffic are required. This paper proposes a traffic control scheme which uses a timed-round-robin cell transmission scheduling algorithm enhanced with a simple feedback flow control mechanism to realize the promised advantages of ATM networks. Specifically, with the proposed scheme, a network is able to provide each user with (1) a guaranteed bandwidth, (2) immediate access to the full link bandwidth when there is no contention from other users, and (3) free of cell losses. An ATM switch design is also presented which shows the feasibility of implementing the proposed scheme with todayś switch architectures without adding much extra cost.This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Abstract ATM (asynchronous transfer mode) aims at providing both guaranteed bandwidth to support real-time communications and dynamic bandwidth sharing to accommodate bursty data trac. Achievement of this goal is vital to make ATM an enabling technology for the future integrated digital networks. To realize this objective, good algorithms for controlling network trac are required. This paper proposes a trac control scheme which uses a timed-round-robin cell transmission scheduling algorithm enhanced with a simple feedback ow control mechanism to realize the promised advantages of ATM networks. Specically, with the proposed scheme, a network is able to provide each user with (1) a guaranteed bandwidth, (2) immediate access to the full link bandwidth when there is no contention from other users, and (3) free of cell losses. An ATM switch design is also presented which shows the feasibility of implementing the proposed scheme with today's switch architectures without adding much extra cost.

show abstract

Design of an access control mechanism for the Available Bit Rate service in ATM networks

Bernabei

Chierchia

Gratta

et al. 1995

High Performance Networking

View full text Add to dashboard Cite

In this paper a mechanism for the control of the Available Bit Rate traffic at the access of ATM networks is presented. It is based on the integration of the backpressure and a credit based mechanism. A credit distribution policy among sources, aiming at equalizing the occupancy of the transmission buffers of the sources, is defined. Moreover, the introduction of an uncontrolled mode of operation when the network status is far from congestion allows the signaling overhead to be limited as in the backpressure scheme. The proposed control scheme allows the achievement of very good performance in terms of cell loss and a low signaling overhead. A performance study of the proposed mechanism is presented. Various traffic scenarios are considered. Results arising from simulation are compared with performance of the backpressure mechanism. Moreover, analytical bounds for the cell loss probability are found and compared with the performance derived from simulation.

show abstract

The FCVC (flow-controlled virtual channels) proposal for ATM networks: a summary

Cited by 62 publications

References 9 publications

Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network

Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network

An enhanced timed-round-robin traffic control scheme for ATM networks

Design of an access control mechanism for the Available Bit Rate service in ATM networks

Contact Info

Product

Resources

About