Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing", Proc. IEEE INFOCOM 2001, pp. 699--708.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is to ensure that if a set of requests follows the given distribution probability a load of 100 is achievable on all link. This approach was used to mimic the way a real network is engineered. Network engineering in the context of fault protection is still a very active domain of research (cf. [13, 14]) The most important value when designing a restoration scheme is the cost of such a protection in terms of additional bandwidth reserved for backup LSPs. We will call it netw ork over subscription and represent it by #. It is given by : # = R ij # measures the network wide ....

Yu Liu, David Tipper, and Peerapon Siripongwutikorn. Approximating optimal spare capacity allocation by successive survivable routing. In Proceeding of IEEE INFOCOM 2001.

....is only usable with small scale problems. The heuristics proposed in [12] can be used for selection from the available paths. In order to reduce the centralization and the amount of information needed for the online flow admission, successive survivable routing is proposed and analyzed in [13]. For the protection problem, the flow splitting approach can be used not only for working paths, but for the protection path as well. Splitting the working path has the advantage of reducing the amount to be protected. As illustrated in Figure 1,while 6 units of bandwidth have to be allocated on ....

Y. Liu, D. Tipper and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing", INFOCOM 2001.

....which links are used by the corresponding AP. This is why shortest pair of path (or SPP) algorithms such as the one in [2] can no longer guarantee minimum TBW allocation for a given connection establishment request, let al..one those based on the so called active path first or APF heuristic [3]) In [1] an approach which uses Integer Linear Programming (ILP) to determine a pair of AP and BP, called Sharing with Complete Information (or SCI) was proposed. While SCI leads to maximal BBW sharing and maximal improvement (about 37 ) over the NS scheme in terms of TBW consumption, a ....

....only O(E) partial (and aggregated) information, where E is the number of links in a network, but results in a much lower improvement (namely about 16 ) over NS. A different approach, which uses the APF heuristic to determine a pair of AP and BP, called Survivable Routing or SR, was proposed in [3]. SR requires each edge node to maintain ) complete but aggregated information to achieve a nearoptimal improvement (about 36 ) over NS, and thus its scalability is still limited, In this paper, we propose two new distributed control schemes under what we call the distributed partial ....

[Article contains additional citation context not shown here]

Yu Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in INFOCOM'01, 2001, pp. 699--708.

.... Such decisions can be made if a controller (either in centralized or decentralized control implementation) maintains complete per flow information as in the SCI scheme (which uses an ILP formulation) 5] or complete aggregated information as in the SR scheme (which uses the APF heuristic) [6]. In both cases, the amount of information to be maintained by a controller is at least ### # #, where # is the number of links in a network. Several approaches have been proposed which require only #### partial (and aggregated) information. They include the SPI scheme (which uses ILP) in [5] ....

....requiring at least ### # # complete information, with an emphasis on the main ideas behind path determination, before describing their APFPBC extension. The first, called SCI in [5] uses complete per flow information and an ILP formulation to determine a pair of paths. The second, called SR [6], uses complete and aggregated information and APF instead. Hereafter, these two will be named as SCI I, where I is short for ILP, and SCI A, where A is short for APF, respectively. In SCI I, a controller maintains, for every link # # # , both # # and # # , and based on which, all other ....

[Article contains additional citation context not shown here]

Yu Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing"," in Proceedings - INFOCOM, 2001, pp. 699--708.

....which links are used by the corresponding AP. This is why shortest pair of path (or SPP) algorithms such as the one in [2] can no longer guarantee minimum TBW allocation for a given connection establishment request, let al..one those based on the so called active path first or APF heuristic [3]) In [1] an approach which uses Integer Linear Programming (ILP) to determine a pair of AP and BP, called Sharing with Complete Information (or SCI) was proposed. While SCI leads to maximal BBW sharing and maximal improvement (about 37 ) over the NS scheme in terms of TBW consumption, a ....

....only #### partial (and aggregated) information, where # is the number of links in a network, but results in a much lower improvement (namely about 16 ) over NS. A different approach, which uses the APF heuristic to determine a pair of AP and BP, called Survivable Routing or SR, was proposed in [3]. SR requires each edge node to maintain ### # # complete but aggregated information to achieve a near optimal improvement (about 36 ) over NS, and thus its scalability is still limited, In this paper (which is Part I of a two part document) we propose two new distributed control schemes under ....

[Article contains additional citation context not shown here]

Yu Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing"," in Proceedings - INFOCOM, 2001, pp. 699--708.

....driven by the increasing requests for bandwidth on demand services. These requests have fostered an open market to trade network capacity. How to improve the cost performance ratio of spare resource has recently become one of research focuses and many algorithms have been proposed [3] 4] 5] [6], 7] 8] 9] 10] There are two similarities among these algorithms. Firstly, they utilize shortest path algorithm to preplan backup paths. By finding backup paths for each flow, the original spare capacity allocation problem, as a multicommodity flow problem, is partitioned into multiple ....

....metrics for a heuristic LOCAL algorithm in [12] The results show that LOCAL does not find very close results to the better column generation algorithm. Recently we formulate this relationship in a spare provision matrix (SPM) with size of the number of links times the number of failure cases [6], 9] It models arbitrary failure cases in addition to link failures in the earlier works. An algorithm, termed successive survivable routing (SSR) calculates additional link spare capacities as link metrics to route backup paths. Numerical results show that the SSR results are very close to the ....

[Article contains additional citation context not shown here]

Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proceeding of IEEE INFOCOM, Anchorage, AL, April 24--282001, pp. 699--708.

....driven by the increasing requests for bandwidth on demand services. These requests have fostered an open market to trade network capacity. How to improve the cost performance ratio of spare resource has recently become one of research focuses and many algorithms have been proposed [3] 4] 5] [6], 7] 8] 9] 10] There are two similarities among these algorithms. Firstly, they utilize shortest path algorithm to preplan backup paths. By finding backup paths for each flow, the original spare capacity allocation problem, as a multicommodity flow problem, is partitioned into multiple ....

....metrics for a heuristic LOCAL algorithm in [12] The results show that LOCAL does not find very close results to the better column generation algorithm. Recently we formulate this relationship in a spare provision matrix (SPM) with size of the number of links times the number of failure cases [6], 9] It models arbitrary failure cases in addition to link failures in the earlier works. An algorithm, termed successive survivable routing (SSR) calculates additional link spare capacities as link metrics to route backup paths. Numerical results show that the SSR results are very close to the ....

[Article contains additional citation context not shown here]

Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proceeding of IEEE INFOCOM, Anchorage, AL, April 24--28 2001, pp. 699--708.

....how much spare capacity should be reserved on network links and where to route backup paths to protect given working traffic paths when the network topology is at least 2 connected. A literature review of different spare capacity allocation algorithms and restoration schemes has been given in [1]. Supported in part by NSF grant ANIR 9980516 and DARPA grant F30602 97 1 0257 Currently, survivable techniques assume the network design phase is centrally implemented while the restoration phase is distributed. This survivability framework has been reexamined recently, as increasing requests ....

....(SPI) for IP MPLS networks was proposed by Kodialam and Lakshman [6] 7] 8] These schemes focus on protecting working traffic by reserving spare bandwidth in backup paths. Though network redundancy is reduced to some degree by sharing spare capacity in these schemes, our recent results [1] have shown that total spare capacity can be reduced to near minimum by using a distributed algorithm, called successive survivable routing (SSR) SSR routes backup paths sequentially and maintains a small amount of state information with O(L 2 ) complexity, where L is the number of links in the ....

[Article contains additional citation context not shown here]

Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proceeding of IEEE INFOCOM, Anchorage, AL, April 24--28 2001, pp. 699--708.

.... issue has been done on SONET SDH [2] 3] 4] 5] ATM [6] 7] 8] 9] WDM networks [10] 11] 12] Recent issue on IP and MPLS networks are also given in [13] 14] 15] A detailed literature review on different spare capacity allocation algorithms and restoration schemes is given in [16], 1] In this paper, we first formulate an arc flow spare capacity allocation problem to consider node failures on directed mesh networks. In this model, each flow has to find a node disjoint backup path in order to protect any single intermediate node failure along its working path. A graph ....

....[20] In a trap topology, a working path may block all the possible linkdisjoint backup paths although the network topology is twolink connected. The problem to find a working path with linkdisjoint backup path can be solved by using augmenting path algorithm from [17] as we discussed in [16]. Unfortunately, this algorithm can not be directly used to find working path with node disjoint backup path. The flow chart of our graph algorithm is given in Fig. 2. The algorithm finds a working path which has at least one nodedisjoint backup path for flow # on network # which include # nodes ....

[Article contains additional citation context not shown here]

Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proceeding of IEEE INFOCOM, Anchorage, AL, April 24--28 2001, pp. 699-- 708.

No context found.

Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing", Proc. IEEE INFOCOM 2001, pp. 699--708.

No context found.

Y. Liu, D. Tipper and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing", Proceedings of IEEE INFOCOM 2001.

No context found.

Y. Liu, D. Tipper and P. Siripongwutikorn, "Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing", IEEE Infocom2001.

No context found.

Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in INFOCOM '01, 2001, pp. 699--708.

No context found.

Y. Liu, O. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proceedings of the Conference on Computer Communications (IEEE Infocom), Anchorage, AL, April 2001, pp. 699--708. 11

No context found.

Y. Liu, D. Tipper and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing", INFOCOM 2001.

No context found.

Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing", Proc. IEEE INFOCOM 2001, pp. 699--708.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC