INFOCOM '98. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

Prefetching has been shown to be an effective technique for reducing user perceived latency in distributed systems. In this paper we show that even when prefetching adds no extra traffic to the network, it can have serious negative performance effects. Straightforward approaches to prefetching increase the burstiness of individual sources, leading to increased average queue sizes in network switch... View full abstract»

High-performance Web servers are essential to meet the growing demands of the Internet and large-scale intranets. Satisfying these demands requires a thorough understanding of key factors affecting Web server performance. This paper presents empirical analysis illustrating how dynamic and static adaptivity can enhance Web server performance. Two research contributions support this conclusion. Firs... View full abstract»

Recent measurements of packet networks have shown that packet traffic exhibits long-range-dependent property. Studies have also discovered that this property is not adequately captured by the conventional Markov traffic models and often yields queueing behavior such as heavy-tailed or subexponential queue length distribution. These findings have led to the implication that long-range-dependent tra... View full abstract»

Retransmission based error control for large scale multicast applications is difficult because of implosion and exposure. Existing schemes (SRM, RMTP, TMTP LBRRM) have good solutions to implosion, but only approximate solutions to exposure. We present a scheme that achieves finer grain fault recovery by exploiting new forwarding services that allow us to create a dynamic hierarchy of receivers. We... View full abstract»

The World Wide Web (WWW) has gained tremendously in popularity. In this work we explore the use of UDP, best-effort multicast as a delivery option. Reliability is achieved through repetitive, cyclic transmission of a requested page. This solution is expected to be most efficient when used for highly requested pages. We view this cyclic multicast technique as a delivery option that can be integrate... View full abstract»

This paper evaluates the additional buffer requirements of an ATM shared-memory switch using packet-level (store-and-forward) rather than cell-level (cut-through) service scheduling. Packet-level scheduling is important to tag and IP switching for multipoint-to-one services; it allows different connections to be merged into a single virtual connection to reduce routing complexity. Cisco Systems wi... View full abstract»

We address the problem of estimating the spectrum required in a wireless network for a given demand and interference pattern. This problem can be abstracted as a generalization of the graph coloring problem, which typically presents additional degree of hardness compared to the standard coloring problem. It is worthwhile to note that the question of estimating the spectrum requirement differs mark... View full abstract»

We propose an algorithm for finding a multicast tree in packet-switched networks. The objective is to minimize total cost incurred at the multicast path. The routing model is based on the minimum cost Steiner tree problem. The Steiner problem is extended to incorporate two additional requirements. First, the delay experienced along the path from the source to each destination is bounded. Second, t... View full abstract»

This paper deals with the sizing of end buffers in ATM networks for sessions subject to constant bit rate (CBR) traffic. Our objective is to predict the cell loss rate at the end buffer as a function of the system parameters. We introduce the D+G/D/1 queue as a generic model to represent exit buffers in telecommunications networks under constant rate traffic and use it to model the end buffer. Thi... View full abstract»

The minimum-delay self-clocked fair queueing (MD-SCFQ) algorithm that we present in this paper is the first algorithm that achieves the same delay bounds as the packet by packet version of generalized processor sharing (P-GPS), has fairness properties similar to P-GPS, and uses a system-potential function of 0(1) complexity. To prove that MD-SCFQ achieves the same delay bounds of P-GPS, we have sh... View full abstract»

Reliable sender-based one-to-many protocols do not scale well due mainly to implosion caused by the excessive rate of feedback packets arriving from receivers. We show that this problem can be circumvented by making the sender poll the receivers at carefully planned timing instants, so that the arrival rate of feedback packets is not large enough to cause implosion. We describe a generic end-to-en... View full abstract»

Mobile nodes of the future will be equiped with multiple network interfaces to take advantage of overlay networks, yet no current mobility systems provide full support for the simultaneous use of multiple interfaces. The need for such support arises when multiple connectivity options are available with different cost, coverage, latency and bandwidth characteristics, and applications want their dat... View full abstract»

IP address lookup is becoming critical because of increasing routing table size, speed, and traffic in the Internet. Our paper shows how binary search can be adapted for best matching prefix using two entries per prefix and by doing precomputation. Next we show how to improve the performance of any best matching prefix scheme using an initial array indexed by the first X bits of the address. We th... View full abstract»

To efficiently transfer large amounts of diverse traffic over high-speed links, modern integrated networks require more efficient packet-switching techniques that can capitalize on advances in switch hardware. Several promising approaches attempt to improve performance by creating dedicated “shortcut” connections for long-lived traffic flows, at the expense of the network overhead for ... View full abstract»

We investigate the scalability of feedback in multicast communication and propose a new method of probabilistic feedback based on exponentially distributed timers. By analysis and simulation for up to 106 receivers we show that feedback implosion is avoided while feedback latency is low. The mechanism is robust against the loss of feedback messages and robust against homogeneous and het... View full abstract»

The feasible-region is a simple and optimal framework for scheduling the transmission of data with deadlines. We establish the fundamental relationship between the bandwidth requirement and the initial delay in feasible-region-based transmission scheduling. The relationship represents the optimal bandwidth/delay tradeoff. In the process, we identify the essential bandwidth, the exact bandwidth low... View full abstract»

We propose a versatile scheduling discipline, called precedence with partial push-out (PPP), in asynchronous transfer mode (ATM) switches supporting two delay and two loss priorities. By employing a threshold L, PPP provides delay guarantee by allowing a newly-arriving high-delay-priority cell to precede a maximum of L low-delay-priority cells. Through the use of another threshold R, the disciplin... View full abstract»

This paper presents a demand-based engineering method for designing radio networks of cellular mobile communication systems. The proposed procedure is based on a forward-engineering method, the integrated approach to cellular network planning and is facilitated by the application of a new discrete population model for the traffic description, the demand node concept. The use of the concept enables... View full abstract»

This paper suggests a CSMA/CD compatible MAC protocol for real-time transmissions in a home or small office local area network. It has the key advantage of allowing devices implementing the existing Ethernet protocol such as PCs, printers and ISDN routers to operate with devices implementing the new MAC. The new MAC enables real-time traffic such as digital video and audio to be transmitted with l... View full abstract»

This paper presents algorithms, heuristics and lower bounds addressing optimization issues in many-to-many multicasting. Two main problems are addressed: (1) a precise combinatorial comparison of optimal multicast trees with optimal multicast rings, (2) an optimized sharing of network resources (i.e., nodes and links) among multiple multicast groups that coexist. The former is central to the choic... View full abstract»

Network architectures that can efficiently transport high quality, multicast video are rapidly becoming a basic requirement of emerging multimedia applications. The main problem complicating multicast video transport is variation in network bandwidth constraints. An attractive solution to this problem is to use an adaptive, multi-layered video encoding mechanism. We consider two such mechanisms fo... View full abstract»

In this paper, the dynamic multicast routing problem is studied. The multicast routing problem has been shown to be NP-complete. Many heuristics have been proposed to find the multicast trees for multicast connections. In computer networks, application services may allow nodes to join or leave the multicast connection dynamically. The multicast routing problem in which nodes are allowed to join or... View full abstract»

In ATM networks, the available bit rate (ABR) service enables data sources to efficiently utilize network resources without adversely affecting the performance of non-ABR, guaranteed traffic such as video. Most research to date on ABR performance has not used realistic assumptions. Unrealistic assumptions such as persistent data sources, an absence of non-ABR traffic, and inaccurate TCP models may... View full abstract»