2294 search results - page 144 / 459 » From Path Graphs to Directed Path Graphs |
179
click to vote
MST
2002
15 years 6 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
220
click to vote
SIGMETRICS
2011
ACM
14 years 9 months ago
2011
ACM
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
160
click to vote
GG
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
155
click to vote
ICNP
2005
IEEE
16 years 1 days ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
178
click to vote
SPIRE
2001
Springer
15 years 11 months ago
2001
Springer
The Compact Directed Acyclic Word Graph (CDAWG) is a space efficient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph (SCDAWG) for a st...