107 search results - page 13 / 22 » On Balancing Delay and Cost for Routing Paths |
PERCOM
2008
ACM
15 years 11 months ago
2008
ACM
One of the most evident characteristics of an ad hoc ubiquitous computing environment is the dynamism of connections. Due to the mobility of nodes, paths between communicating pee...
109
click to vote
NAS
2010
IEEE
14 years 10 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
117
click to vote
TON
2008
14 years 11 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
SASO
2009
IEEE
15 years 6 months ago
2009
IEEE
—In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The exi...
FOCS
2000
IEEE
15 years 3 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...