Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CN
2000

favoriteEmaildiscussreport

69views more CN 2000»

Hierarchical source routing using implied costs

13 years 4 months ago

Hierarchical source routing using implied costs

Download users.ece.utexas.edu

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 peer group (subnetwork), we compute the average implied cost to go through or into the peer group. Such implied costs re

Michael Montgomery, Gustavo de Veciana

Real-time Traffic

Average Implied Cost | CN 2000 | Implied Costs | Peer Group |

claim paper

Related Content

» Efficient and Robust Policy Routing Using Multiple Hierarchical Addresses

» Distributed QoS Routing for Multimedia Traffic

» An Adaptive Hierarchical Extension of DSR The Cluster Source Routing

» RBU Recursive Binding Update for EndtoEnd Route Optimization in Nested Mobile Networks

» Scalable Multicast Routing Protocol Using Anycast and HierarchicalTrees

» On optimal communication cost for gathering correlated data through wireless sensor networ...

» EndtoEnd Service Quality Measurement Using SourceRouted Probes

» An Evaluation of Shared Multicast Trees with Multiple Cores

» Receiverbased Multicast Scoping A New CostConscious JoinLeave Paradigm

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	CN
Authors	Michael Montgomery, Gustavo de Veciana

Comments (0)