Sciweavers

INFOCOM
2000
IEEE
13 years 9 months ago
QoS Routing with Performance-Dependent Costs
Abstract—We study a network model in which each network link is associated with a set of delays and costs. These costs are a function of the delays and reflect the prices paid i...
Funda Ergün, Rakesh K. Sinha, Lisa Zhang
INFOCOM
2000
IEEE
13 years 9 months ago
Admission Control Based on End-to-End Measurements
— This paper proposes a controlled-load service that provides a network state with bounded and well known worst-case behavior. The service is primarily developed for real-time ap...
Viktória Elek, Gunnar Karlsson, Robert R&ou...
INFOCOM
2000
IEEE
13 years 9 months ago
Datagram Routing Algorithm for LEO Satellite Networks
Abstract—Satellite networks provide global coverage and support a wide range of services. Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming increa...
Eylem Ekici, Ian F. Akyildiz, Michael D. Bender
INFOCOM
2000
IEEE
13 years 9 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
INFOCOM
2000
IEEE
13 years 9 months ago
An Empirical Evaluation of Client-Side Server Selection Algorithms
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
Sandra G. Dykes, Kay A. Robbins, Clinton L. Jeffer...
INFOCOM
2000
IEEE
13 years 9 months ago
Adaptive Leases: A Strong Consistency Mechanism for the World Wide Web
—In this paper, we argue that weak cache consistency mechanisms supported by existing Web proxy caches must be augmented by strong consistency mechanisms to support the growing d...
Venkata Duvvuri, Prashant J. Shenoy, Renu Tewari
INFOCOM
2000
IEEE
13 years 9 months ago
Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks
Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the perf...
Samir Ranjan Das, Charles E. Perkins, Elizabeth M....
INFOCOM
2000
IEEE
13 years 9 months ago
The Throughput of Data Switches with and without Speedup
— In this paper we use fluid model techniques to establish two results concerning the throughput of data switches. For an input-queued switch (with no speedup) we show that a ma...
J. G. Dai, Balaji Prabhakar