Sciweavers

2808 search results - page 53 / 562
» Routing betweenness centrality
Sort
View
168
Voted
INFOCOM
1995
IEEE
15 years 8 months ago
Computing Approximate Blocking Probabilities for a Class of All-Optical Networks
W e study a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a ...
Alexander Birman
ICON
2007
IEEE
15 years 11 months ago
"Free-riding" traffic problem in routing overlay networks
—In this paper, we discuss the “free-riding” traffic problem in routing overlay networks, which is mainly caused by a policy mismatch between the overlay routing and the und...
Go Hasegawa, Masayoshi Kobayashi, Masayuki Murata,...
ICCSA
2004
Springer
15 years 10 months ago
A Cluster Based Hierarchical Routing Protocol for Mobile Networks
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
Kayhan Erciyes, Geoffrey Marshall
INFOCOM
1993
IEEE
15 years 9 months ago
Stability of a Class of Dynamic Routing Protocols (IGRP)
We perform an exact analysis of the dynamic behavior of IGRP, an adaptive shortest-path routing algorithm widely used in the industry, on a simple ring network. The distance metri...
Steven H. Low, Pravin Varaiya
ICPP
1992
IEEE
15 years 9 months ago
A unifying Framework for Distributed Routing Algorithms
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
Alan Rooks, Bruno R. Preiss