| M. Mellia, A. Nucci, A. Grosso, E. Leonardi, and M. A. Marsan, Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic, Globecom 2001. |
....constraints for the same problera Note that [12 14] do not consider wavelength assignment in the network. Only the routing problem is discussed. Design of logical topologies. Formulation to design the light path based logical topologies for unicast streams are provided in [1 4] Mellia et al. [15] proposes a formulation to design the logical topologies for multicast streams. Both approaches use lightpaths, instead of light trees, to form the logical topologies. Moreover, they assume that either all nodes are capable of wavelength conversion, or no node is capable of wavelength ....
....as discussed in [7 9,12 14] Optimal solution can be obtained using formulation in previous section. Multicasting is only available on logical networks. Each node of a logical network is capable of multicasting. Each edge of a logical network is a lightpath. It is the problem as discussed in [15]. Multicasting is available both on physical networks and logical networks. A light tree can carry data from multiple multicast streams. It is the focus of this section. The set of constraints is listed as follows. 1) Multicast routing constraints: Rn x Z Zn(t j) Rn(j) Vn V, Vj H t:tF,tT ....
[Article contains additional citation context not shown here]
M. Mellia et al. "Optimal Design of Logical Topologies in WavelengthRouted Optical Networks with Multicast Traffic," IEE GLOBCOM'01, vol. 3, pp.1520-1525.
.... aspects that must be defined in TS concern: the choice of an initial solution the definition of the topology perturbation that generates the neighborhood the evaluation of the visited solutions the stop criterion As initial solution we select the result of the heuristic, proposed in [13]. This heuristic initially considers a fully connected logical topology, and iteratively removes the least loaded lightpaths from the logical topology, until the degree constraints are satisfied. The perturbation is defined according to the following algorithm: within the current solution, ....
M. Mellia, A. Nucci, A. Grosso, E. Leonardi, M. Ajmone Marsan "Optimal Design of Logical Topologies in Wavelength-Routed Optical Networks with Multicast Traffic", submitted to Globecom
....it is possible to compare a logical topology whose nodes have 4 transmitters receivers of 10 Gbit s each, with a network with nodes equipped with 16 transmitters receivers each of 2.5 Gbit s bandwidth. To obtain numerical examples, we implemented an optimization algorithm, derived from [24] [25], that relies on the application of the Tabu Search #TS# methodology [26] Given a network topology with M # ## nodes, and given a traffic matrix, we imposed a connectivity degree of # # #; #; #; ##, while keeping constant the bandwidth of each node, i.e. selecting the logical link bandwidth to ....
M.Mellia, A.Nucci, A.Grosso, E.Leonardi, M.Ajmone Marsan "Optimal Design of Logical Topologies in Wavelength-Routed Optical Networks with Multicast Traffic", To appear in IEEE Globecom 2001.
....it is possible to compare a logical topology whose nodes have 4 transmitters receivers of 10 Gbit s each, with a network with nodes equipped with 16 transmitters receivers each of 2.5 Gbit s bandwidth. To obtain numerical examples, we implemented an optimization algorithm, derived from [24] [25], that relies on the application of the Tabu Search (TS) methodology [26] Given a network topology with M = 50 nodes, and given a traffic matrix, we imposed a connectivity degree of = 2; 4; 8; 16, while keeping constant the bandwidth of each node, i.e. selecting the logical link bandwidth to ....
M.Mellia, A.Nucci, A.Grosso, E.Leonardi, M.Ajmone Marsan "Optimal Design of Logical Topologies in Wavelength-Routed Optical Networks with Multicast Traffic", To appear in IEEE Globecom
....it is possible to compare a logical topology whose nodes have 4 transmitters receivers of 10 Gbit s each, with a network with nodes equipped with 16 transmitters receivers each of 2.5 Gbit s bandwidth. To obtain numerical examples, we implemented an optimization algorithm, derived from [24] [25], that relies on the application of the Tabu Search (TS) methodology [26] Given a network topology with M = 50 nodes, and given a traffic matrix, we imposed a connectivity degree of = 2; 4; 8; 16, while keeping constant the bandwidth of each node, i.e. selecting the logical link bandwidth to ....
M.Mellia, A.Nucci, A.Grosso, E.Leonardi, M.Ajmone Marsan "Optimal Design of Logical Topologies in Wavelength-Routed Optical Networks with Multicast Traffic", To appear in IEEE Globecom
No context found.
M. Mellia, A. Nucci, A. Grosso, E. Leonardi, and M. A. Marsan, Optimal design of logical topologies in wavelength-routed optical networks with multicast traffic, Globecom 2001.
No context found.
M. Mellia, A. Nucci, A. Grosso, E. Leonardi, and M. A. Marsan, "Optimal design of logical topologies in wavelength--routed optical networks with multicast tra#c," in Proc. of IEEE Globecom '01, San Antonio, TX, Nov. 2001, pp. 1520--1525.
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