Sciweavers

410 search results - page 33 / 82
» Upgrading Shortest Paths in Networks
Sort
View
ISCC
2009
IEEE
201views Communications» more  ISCC 2009»
15 years 8 months ago
Self-Selecting Reliable Path Routing in diverse Wireless Sensor Network environments
Routing protocols for Wireless Sensor Networks (WSN) face three major performance challenges. The first one is an efficient use of bandwidth that minimizes the transfer delay of p...
Thomas A. Babbitt, Christopher Morrell, Boleslaw K...
CORR
2002
Springer
92views Education» more  CORR 2002»
15 years 1 months ago
Source Routing and Scheduling in Packet Networks
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
Matthew Andrews, Antonio Fernández, Ashish ...
MST
2010
106views more  MST 2010»
14 years 12 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
HIPC
2007
Springer
15 years 5 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
INFOCOM
2007
IEEE
15 years 7 months ago
VoIP on Wireless Meshes: Models, Algorithms and Evaluation
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
Anand Kashyap, Samrat Ganguly, Samir R. Das, Suman...