Sciweavers

1228 search results - page 50 / 246
» Dynamic Highway-Node Routing
Sort
View
SIGCOMM
2012
ACM
11 years 11 months ago
Route shepherd: stability hints for the control plane
The Route Shepherd tool demonstrates applications of choosing between routing protocol configurations on the basis of rigorouslysupported theory. Splitting the configuration spa...
Alexander J. T. Gurney, Xianglong Han, Yang Li, Bo...
IPPS
2005
IEEE
14 years 2 months ago
Packet Routing in Dynamically Changing Networks on Chip
On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication amon...
Mateusz Majer, Christophe Bobda, Ali Ahmadinia, J&...
MOBIHOC
2000
ACM
14 years 1 months ago
DDR: distributed dynamic routing algorithm for mobile ad hoc networks
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
Navid Nikaein, Houda Labiod, Christian Bonnet
COMCOM
2006
82views more  COMCOM 2006»
13 years 9 months ago
Traffic engineering with OSPF-TE and RSVP-TE: Flooding reduction techniques and evaluation of processing cost
This paper considers two important aspects related to the control plane of Traffic Engineered IP/MPLS networks: the ``flooding reduction'' mechanisms and the evaluation ...
Stefano Salsano, Alessio Botta, Paola Iovanna, Mar...
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg