scispace - formally typeset
Search or ask a question
Author

Rohit Goyal

Other affiliations: Ohio University, Alcatel-Lucent
Bio: Rohit Goyal is an academic researcher from Ohio State University. The author has contributed to research in topics: Asynchronous Transfer Mode & TCP acceleration. The author has an hindex of 20, co-authored 80 publications receiving 1669 citations. Previous affiliations of Rohit Goyal include Ohio University & Alcatel-Lucent.


Papers
More filters
Posted Content
TL;DR: In this paper, the authors proposed an explicit rate indication scheme for congestion avoidance in ATM networks, where the network switches monitor their load on each link, determining a load factor, the available capacity, and the number of currently active virtual channels.
Abstract: We propose an explicit rate indication scheme for congestion avoidance in ATM networks. In this scheme, the network switches monitor their load on each link, determining a load factor, the available capacity, and the number of currently active virtual channels. This information is used to advise the sources about the rates at which they should transmit. The algorithm is designed to achieve efficiency, fairness, controlled queueing delays, and fast transient response. The algorithm is also robust to measurement errors caused due to variation in ABR demand and capacity. We present performance analysis of the scheme using both analytical arguments and simulation results. The scheme is being implemented by several ATM switch manufacturers.

242 citations

Journal ArticleDOI
TL;DR: In this article, an explicit rate indication for congestion avoidance (ERICA) scheme for rate-based feedback from asynchronous transfer mode (ATM) switches is described. But the scheme is designed to achieve high link utilization with low delays and fast transient response and is also fair and robust to measurement errors caused by the variations in ABR demand and capacity.
Abstract: This paper describes the "explicit rate indication for congestion avoidance" (ERICA) scheme for rate-based feedback from asynchronous transfer mode (ATM) switches. In ERICA, the switches monitor their load on each link and determine a load factor, the available capacity, and the number of currently active virtual channels. This information is used to advise the sources about the rates at which they should transmit. The algorithm is designed to achieve high link utilization with low delays and fast transient response. It is also fair and robust to measurement errors caused by the variations in ABR demand and capacity. We present performance analysis of the scheme using both analytical arguments and simulation results. The scheme is being considered for implementation by several ATM switch manufacturers.

230 citations

Patent
19 Jul 1996
TL;DR: In this paper, a congestion avoidance scheme for data traffic in ATM networks is proposed, which has its optimal operating point at 100% utilization and a fixed, non-zero queue delay.
Abstract: A congestion avoidance scheme for data traffic in ATM networks. The scheme achieves both efficiency and fairness, and exhibits a fast transient response. A congestion avoidance scheme for ATM networks is described which has its optimal operating point at 100% utilization and a fixed, non-zero queue delay. The scheme improves control of end-to-end delay and keeps link utilization of expensive links high despite idle periods in the input load.

68 citations


Cited by
More filters
Proceedings ArticleDOI
19 Aug 2002
TL;DR: XCP as mentioned in this paper generalizes the Explicit Congestion Notification proposal (ECN) and decouples utilization control from fairness control, which allows a more flexible and analytically tractable protocol design and opens new avenues for service differentiation.
Abstract: Theory and experiments show that as the per-flow product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. This failing becomes increasingly important as the Internet evolves to incorporate very high-bandwidth optical links and more large-delay satellite links.To address this problem, we develop a novel approach to Internet congestion control that outperforms TCP in conventional environments, and remains efficient, fair, scalable, and stable as the bandwidth-delay product increases. This new eXplicit Control Protocol, XCP, generalizes the Explicit Congestion Notification proposal (ECN). In addition, XCP introduces the new concept of decoupling utilization control from fairness control. This allows a more flexible and analytically tractable protocol design and opens new avenues for service differentiation.Using a control theory framework, we model XCP and demonstrate it is stable and efficient regardless of the link capacity, the round trip delay, and the number of sources. Extensive packet-level simulations show that XCP outperforms TCP in both conventional and high bandwidth-delay environments. Further, XCP achieves fair bandwidth allocation, high utilization, small standing queue size, and near-zero packet drops, with both steady and highly varying traffic. Additionally, the new protocol does not maintain any per-flow state in routers and requires few CPU cycles per packet, which makes it implementable in high-speed routers.

1,191 citations

Journal ArticleDOI
Raj Jain1
TL;DR: In this article, the authors present the selection criterion for selection between rate-based and credit-based approach and the key points of the debate between these two approaches are presented. And several other schemes that were considered are described.
Abstract: Congestion control mechanisms for ATM networks as selected by the ATM Forum traffic management group are described. Reasons behind these selections are explained. In particular, selection criterion for selection between rate-based and credit-based approach and the key points of the debate between these two approaches are presented. The approach that was finally selected and several other schemes that were considered are described.

520 citations

Journal ArticleDOI
TL;DR: This paper proposes an architecture that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations, called Core-Stateless Fair Queueing, and presents simulations and analysis on the performance.
Abstract: Router mechanisms designed to achieve fair bandwidth allocations, such as Fair Queueing, have many desirable properties for congestion control in the Internet. However, such mechanisms usually need to maintain state, manage buffers, and/or perform packet scheduling on a per-flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. In this paper, we propose an architecture that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. We apply this approach to an island of routers--that is, a contiguous region of the network--and we distinguish between edge routers and core routers. Edge routers maintain per-flow state; they estimate the incoming rate of each flow and insert a label into each packet based on this estimate. Core routers maintain no per-flow state; they use first-in-first-out packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the router. We call the scheme Core-Stateless Fair Queueing. We present simulations and analysis on the performance of this approach.

428 citations

Patent
12 Nov 1997
TL;DR: In this article, a method of multicasting digital data to a user accessing an Internet connection is disclosed, which includes placing digital data that is to be multicast in IP protocol to generate IP digital data, transmitted from a transmission site (100) to a remote Internet point of presence (55) through a dedicated transmission channel substantially separate from Internet backbone.
Abstract: A method of multicasting digital data to a user accessing an Internet connection is disclosed. The method includes placing digital data that is to be multicast in IP protocol to generate IP digital data. The IP digital data is transmitted from a transmission site (100) to a remote Internet point of presence (55) through a dedicated transmission channel substantially separate from Internet backbone. The dedicated transmission channel may be, for example, a satellite channel. At the remote Internet point of presence, the IP digital data is multicast for delivery to at least one receiving Internet user's apparatus (A, B, C) connected to, but distal from, the remote Internet point of presence.

418 citations

01 Jan 1999
TL;DR: This document outlines some of these TCP mitigations, which are IETF standards track mechanisms that enable TCP to more effectively utilize the available capacity of the network path.
Abstract: The Transmission Control Protocol (TCP) provides reliable delivery of data across any network path, including network paths containing satellite channels. While TCP works over satellite channels there are several IETF standardized mechanisms that enable TCP to more effectively utilize the available capacity of the network path. This document outlines some of these TCP mitigations. At this time, all mitigations discussed in this document are IETF standards track mechanisms (or are compliant with IETF standards).

398 citations