Sciweavers

NCA
2003
IEEE
13 years 9 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
MICRO
2003
IEEE
128views Hardware» more  MICRO 2003»
13 years 9 months ago
IPStash: a Power-Efficient Memory Architecture for IP-lookup
Abstract—High-speed routers often use commodity, fully-associative, TCAMs (Ternary Content Addressable Memories) to perform packet classification and routing (IP lookup). We prop...
Stefanos Kaxiras, Georgios Keramidas
DEXAW
2003
IEEE
99views Database» more  DEXAW 2003»
13 years 9 months ago
Handling Identity in Peer-to-Peer Systems
Due to the limited number of available IP addresses most computers on the Internet use dynamic IP addresses which causes problems for applications that have to maintain routing ta...
Manfred Hauswirth, Anwitaman Datta, Karl Aberer
EUC
2004
Springer
13 years 9 months ago
Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents
In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi, Mi...
WEA
2005
Springer
120views Algorithms» more  WEA 2005»
13 years 9 months ago
Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
Abstract. We consider the problem of fast IP address lookup in the forwarding engines of Internet routers. We analyze over 2400 public snapshots of routing tables collected over ...
Filippo Geraci, Roberto Grossi
ISPAN
2005
IEEE
13 years 10 months ago
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
Doina Bein, Ajoy Kumar Datta, Chakradhar R. Jaggan...
INFOCOM
2005
IEEE
13 years 10 months ago
Avoiding transient loops during IGP convergence in IP networks
— When the topology of an IP network changes due to a link failure or a link weight modification, the routing tables of all the routers must be updated. Each of those updates ma...
Pierre Francois, Olivier Bonaventure
ICPADS
2005
IEEE
13 years 10 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
SPAA
2006
ACM
13 years 10 months ago
On space-stretch trade-offs: lower bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
WEA
2007
Springer
97views Algorithms» more  WEA 2007»
13 years 10 months ago
Experimental Evaluations of Algorithms for IP Table Minimization
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...
Angelo Fanelli, Michele Flammini, Domenico Mango, ...