390 search results - page 22 / 78 » Computing shortest paths for any number of hops |
182
click to vote
ICNP
1997
IEEE
15 years 11 months ago
1997
IEEE
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
184
click to vote
EUROPAR
2007
Springer
16 years 25 days ago
2007
Springer
The IEEE 802.16 mobile multi-hop relay (MMR) task group ’j’ (TGj) has recently introduced the multi-hop relaying concept in the IEEE 802.16 WirelessMAN, wherein a newly introdu...
204
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
166
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree wh...
123
click to vote
BIRTHDAY
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...