31 search results - page 6 / 7 » Weighted random oblivious routing on torus networks |
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
COMSWARE
2007
IEEE
14 years 1 months ago
2007
IEEE
- Impact of random delays and losses in sensor networks manifests in the form of tardiness of data used for processing at the sink nodes. The age of data used by the end applicatio...
EGC
2005
Springer
14 years 17 days ago
2005
Springer
The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management...
ICALP
2005
Springer
14 years 16 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
INFOCOM
2002
IEEE
13 years 12 months ago
2002
IEEE
—A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by ...