Sciweavers

135 search results - page 1 / 27
» Hierarchical source routing using implied costs
Sort
View
CN
2000
69views more  CN 2000»
13 years 4 months ago
Hierarchical source routing using implied costs
Based on a loss network model, we present an adaptive source routing scheme for a large, hierarchically organized network. To represent the ``available'' capacity of a p...
Michael Montgomery, Gustavo de Veciana
SIGCOMM
1991
ACM
13 years 8 months ago
Efficient and Robust Policy Routing Using Multiple Hierarchical Addresses
One of the most compelling long term problems facing the IP and emerging 0S1 Internet is growth, At the same time, policy routing-the ability of a packet source to determine the t...
Paul F. Tsuchiya
ICMCS
2000
IEEE
91views Multimedia» more  ICMCS 2000»
13 years 9 months ago
Distributed QoS Routing for Multimedia Traffic
The goal of QoS routing is to find a loopless path through a network that can satisfy a given set of constraints on parameters such as bandwidth, delay and cost. QoS routing algo...
Venkatesh Sarangan, Donna Ghosh, Raj Acharya
JUCS
2007
164views more  JUCS 2007»
13 years 4 months ago
An Adaptive Hierarchical Extension of DSR: The Cluster Source Routing
: Numerous studies have shown the difficulty for a single routing protocol to scale with respect to mobility and network size in wireless ad hoc networks. This paper presents a clu...
Farid Jaddi, Béatrice Paillassa
HSNMC
2004
Springer
121views Multimedia» more  HSNMC 2004»
13 years 10 months ago
RBU+: Recursive Binding Update for End-to-End Route Optimization in Nested Mobile Networks
In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is ...
Ho-sik Cho, Eun Kyoung Paik, Yanghee Choi