Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
Selective randomized load balancing and mesh networks with changingdemands

Selective randomized load balancing and mesh networks with changingdemands,10.1364/JON.5.000320,Journal of Optical Networking,F. B. Shepherd,P. J. Win

Edit
Selective randomized load balancing and mesh networks with changingdemands   (Citations: 14)
BibTex | RIS | RefWorks Download
We consider the problem of building cost-effective networks which are robust to dynamic changes in demand pat- terns. We compare several architectures based on using demand- oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit- switched core infrastructure, and multi-hop (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 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 which 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. On these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multi-hop IP/MPLS networks using VPN tree routing.
Journal: Journal of Optical Networking - J OPT NETW , vol. 5, no. 5, 2006
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...In [14], an enhanced VLB architecture called selective randomized load-balancing (SRLB) is devised, where only a portion of network nodes producing less cost path trees are selected as hub nodes (Fig. 1b), and therefore outperforms VLB in cost, delay, and jitter...
    • ...TC involves the costs of three main functions [14]: packetswitching cost (PC), circuit-switching cost (CC) and WDM link cost (LC)...

    Rui Dai, et al. Adaptive load-balancing in WDM mesh networks with performance guarante...

    • ...In [18], an application to optical networking is described...
    • ...In [18] it is left open to compare the costs of routing architectures based on some form of “hierarchical hubbing”...

    Neil Olver, et al. Approximability of Robust Network Design

    • ...Winzer et al.’s selective randomized load-balancing [14, 16, 21] used VLB and its variants to design cost-effective optical networks...
    • ...This is a direct generalization from uniform multicommodity flow in the homogeneous case to product multicommodity flow [16]...
    • ...Shepherd and Winzer [16] use a realistic cost model that takes into account both the fiber cost and the equipment cost...

    Rui Zhang-Shen. Valiant Load-Balancing: Building Networks That Can Support All Traffic...

    • ...Recent research [20] shows that if the intermediate nodes are not composed of the whole nodes of the network but a group of them instead determined by the shortest path tree, the effect of RLB is better...
    • ...[20], which is called Valiant+ in the following, have a good effect on load balancing...

    Yujie Pei, et al. A self-adaptive key flow routing adjustment algorithm

    • ...Examples for load-balancing systems that fall in this category are abundant (see, e.g., [17], [31], [29], [26] for recent systems from the networking and parallel computing domain)...

    Jens B. Schmitt, et al. Demultiplexing in Network Calculus A Stochastic Scaling Approach

Sort by:

Citations (14)

Share this on