Sciweavers

5079 search results - page 113 / 1016
» Hidden-Action in Network Routing
Sort
View
MOBIHOC
2007
ACM
15 years 9 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
NCA
2003
IEEE
15 years 3 months ago
Scalable Protocol for Content-Based Routing in Overlay Networks
In content networks, messages are routed on the basis of their content and the interests (subscriptions) of the message consumers. This form of routing offers an interesting alte...
Raphaël Chand, Pascal Felber
TON
2008
99views more  TON 2008»
14 years 9 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
ICNP
1998
IEEE
15 years 2 months ago
Maximizable Routing Metrics
We develop a theory for deciding, for any routing metric and any network, whether the messages in this network can be routed along paths whose metric values are maximum. In order ...
Mohamed G. Gouda, Marco Schneider
ICDCSW
2006
IEEE
15 years 4 months ago
Interdomain Routing as Social Choice
Interdomain routing is essential to both the stability and efficiency of the global Internet. However, most previous studies focus only on stability, and only on a special class ...
Ronny Ramzi Dakdouk, Semih Salihoglu, Hao Wang, Ha...