J. Skorin-Kapov and J-F. Labourdette. On Minimum Congestion on Routing in Rearrangeable Multihop Lightwave Networks. Journal of Heuristics, 1:129-154, 1995.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Design of Logical Topologies in Wavelength-Routed IP.. - Marsan, Grosso.. (2002) (1 citation) (Correct)
.... It was shown that the identification of the optimal logical topology is computationally intractable for large size networks [1] 2] and several heuristic approaches were proposed for the identification of suboptimal solutions [2] 3] 4] 5] 6] 7] 8] 9] 10] 11] 12] 13] [14]. This work was partly supported by the MURST Italian Ministry for University and Research through the IPPO project. At the same time, the mentioned growth of Internet services has generated an increasing interest in protocols and architectures for the support of multicast applications: a ....
....is assigned a priori ; it cannot be considered a variable of the problem. This key observation led us to the optimization of the topology design, assuming that the IP routing algorithm is fixed. Finally, in all previous works [2] 3] 4] 5] 6] 7] 8] 9] 10] 11] 12] 13] [14], 15] topology optimization is performed assuming a deterministic, perfectly known and stable, traffic pattern. This assumption, however, is quite far from reality, since node to node traffic intensities exhibit significant fluctuations and often an unpredictable behavior. For the first time, ....
J.Skorin-Kapov, J.F.Laburdette, "On Minimum Congestion Routing in Rearrangeable Multihop Lightwave Networks", Journal of Heuristics, Vol.1, n.1, pp.129-145, Fall 1995.
A Load Balancing Scheme For Congestion Control In Mpls Networks - Salvadori, Battiti (2002) (2 citations) (Correct)
....that are based on a sequence of small steps (i.e. on local search from a given configuration) because global changes of the routing scheme can be disruptive to the network. A similar approach has been proposed in papers about logical topology design and routing algorithms in optical networks [10, 12]. The idea is to minimize the congestion of the network by performing local modifications. For each tentative move, the most congested link is located and one of its crossing LSPs is rerouted along an alternate path. Figure i gives the pseudo code of the proposed Dynamic Load Balancing Algorithm ....
J. Skorin-Kapov and J. Labourdette. On minimum congestion routing in rearrangeable multihop lightwave networks. Journal of Heuristics, 1:129- 145, 1995.
A Reactive Scheme For Traffic Engineering In Mpls Networks - Salvadori, al. (2002) (Correct)
....are based on a sequence of small steps (i.e. on local search from a given configuration) because global changes of the routing scheme can be disruptive to the network. A similar approach has been proposed in papers about logical topology design and routing algorithms in optical networks [10] [11]. The idea is to increase the available capacity of the network by performing local modifications. For each tentative move, the most congested links are located and one of its crossing LSPs is rerouted along an alternate path. The scheme is similar to the congestion control mechanism introduced in ....
J. Skorin-Kapov and J. Labourdette. On minimum congestion routing in rearrangeable multihop lightwave networks. Journal of Heuristics, 1:129--145, 1995.
A Design of Rearrangeable Multihop Lightwave - Networks Multicriteria Approach (2001) Self-citation (Skorin-kapov) (Correct)
No context found.
J. Skorin-Kapov and J-F. Labourdette. On Minimum Congestion on Routing in Rearrangeable Multihop Lightwave Networks. Journal of Heuristics, 1:129-154, 1995.
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