Sciweavers

661 search results - page 15 / 133
» Bandwidth Sharing: Objectives and Algorithms
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Abstract-We present a novel framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility condition...
Theodoros Salonidis, Leandros Tassiulas
ICDCS
2005
IEEE
14 years 1 months ago
End-to-End Fair Bandwidth Allocation in Multi-Hop Wireless Ad Hoc Networks
— The shared-medium multi-hop nature of wireless ad hoc networks poses fundamental challenges to the design of an effective resource allocation algorithm to maximize spatial reus...
Baochun Li
CN
2006
84views more  CN 2006»
13 years 7 months ago
Dynamic overlay routing based on available bandwidth estimation: A simulation study
Dynamic overlay routing has been proposed as a way to enhance the reliability and performance of IP networks. The major premise is that overlay routing can bypass congestion, tran...
Yong Zhu, Constantinos Dovrolis, Mostafa H. Ammar
WDAG
1995
Springer
103views Algorithms» more  WDAG 1995»
13 years 11 months ago
Self-Stabilization of Wait-Free Shared Memory Objects
This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
Jaap-Henk Hoepman, Marina Papatriantafilou, Philip...
OSDI
1994
ACM
13 years 8 months ago
The Design and Evaluation of a Shared Object System for Distributed Memory Machines
This paper describes the design and evaluation of SAM, a shared object system for distributed memory machines. SAM is a portable run-time system that provides a global name space ...
Daniel J. Scales, Monica S. Lam