Abstract
We consider the problem of building cost-effective networks that are robust to
dynamic changes in demand patterns. We compare several architectures using
demand-oblivious routing strategies. Traditional approaches include single-hop
architectures based on a (static or dynamic) circuit-switched core infrastructure and
multihop (packet-switched) architectures based on point-to-point circuits in the core.
To address demand uncertainty, we seek minimum cost networks that can carry the class of
hose demand matrices. Apart from shortest-path routing, Valiant's randomized load
balancing (RLB), and virtual private network (VPN) tree routing, we propose a third,
highly attractive approach: selective randomized load balancing (SRLB). This is a blend
of dual-hop hub routing and randomized load balancing that combines the advantages of
both architectures in terms of network cost, delay, and delay jitter. In particular, we
give empirical analyses for the cost (in terms of transport and switching equipment) for
the discussed architectures, based on three representative carrier networks. Of these
three networks, SRLB maintains the resilience properties of RLB while achieving
significant cost reduction over all other architectures, including RLB and multihop
Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree
routing.
© 2006 Optical Society of America
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Add to BibSonomy