5079 search results - page 785 / 1016 » Hidden-Action in Network Routing |
175
click to vote
SIGCOMM
1991
ACM
15 years 10 months ago
1991
ACM
We consider the problem of providing network access to hosts whose physical location changes with time. Such hosts cannot depend on traditional forms of network connectivity and r...
182
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
192
click to vote
SPAA
2004
ACM
16 years 13 hour ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
199
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
170
click to vote
ICCCN
2008
IEEE
16 years 1 months ago
2008
IEEE
—The problem of designing high capacity and high bit rate IP-over-WDM networks, which can provide uninterrupted service in the presence of network equipment failures, continues t...