Learn More
The capacity of ad hoc wireless networks is constrained by the interference between concurrent transmissions from neighboring nodes. Gupta and Kumar have shown that the capacity of an ad hoc network does not scale well with the increasing number of nodes in the system when using <i>omnidirectional</i> antennas [6]. We investigate the capacity of ad hoc(More)
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(More)
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing end-to-end congestion control (<i>eg</i> TCP) and traditional congestion notification schemes (<i>eg</i> TCP+AQM/ECN) have significant limitations in achieving this goal. While the recently(More)
Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models(More)
The Available Bit Rate ABR service has been developed to support data applications over Asynchronous Transfer Mode ATM networks. The network continuously monitors its traac and provides feedback to the source end systems. This paper explains the rules that the sources have to follow t o a c hieve a fair and eecient allocation of network resources.
Most TCP connections in today's Internet transfer data on the order of only a few KBytes. Such TCP transfers are very short and spend most of their time in the slow start phase. Thus the underlying assumptions made by steady-state models cease to hold making them unsuitable for modeling nite ows. In this paper, we we propose an accurate model for estimating(More)
In this paper we study the design issues for improving TCP performance over the ATM UBR service. ATM-UBR switches respond to congestion by dropping cells when their buuers become full. TCP connections running over UBR can experience low throughput and high unfairness. Intelligent switch drop policies and end-system policies can improve the performance of(More)
Simulation of large-scale networks remains to be a challenge, although various network simulators are in place. In this paper, we identify fundamental issues for large-scale networks simulation, and porpose new techniques that address them. First, we exploit optimistic parallel simulation techniques to enable fast execution on inexpensive hyper-threaded,(More)
Parameter configuration is a common procedure used in large-scale network protocols to support multiple operational goals. It can be formulated as a black-box optimization problem and solved with an efficient search algorithm. This paper proposes a new heuristic search algorithm, Recursive Random Search(RRS), for large-scale network parameter optimization.(More)
Routing in communication networks involves the <i>indirection</i> from a <i>persistent name</i> (or ID) to a <i>locator</i> and delivering packets based upon the locator. In a large-scale, highly dynamic network, the ID-to-locator mappings are both large in number, and change often. Traditional routing protocols require high overhead to keep these in(More)