199 research outputs found
Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks
International audienceIn sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N −1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Technol, 18(12), 1917–1927 2000.) light-tree. Extensive simulations not only validate the proof but also show that the proposed heuristic outperforms the existing multicast routing algorithms by a large margin in terms of link stress, throughput, and efficiency ofwavelength usage
Light-Hierarchy: The Optimal Structure for Multicast Routing in WDM Mesh Networks
Based on the false assumption that multicast incapable (MI) nodes could not
be traversed twice on the same wavelength, the light-tree structure was always
thought to be optimal for multicast routing in sparse splitting Wavelength
Division Multiplexing (WDM) networks. In fact, for establishing a multicast
session, an MI node could be crosswise visited more than once to switch a light
signal towards several destinations with only one wavelength through different
input and output pairs. This is called Cross Pair Switching (CPS). Thus, a new
multicast routing structure light-hierarchy is proposed for all-optical
multicast routing, which permits the cycles introduced by the CPS capability of
MI nodes. We proved that the optimal structure for minimizing the cost of
multicast routing is a set of light-hierarchies rather than the light-trees in
sparse splitting WDM networks. Integer linear programming (ILP) formulations
are developed to search the optimal light-hierarchies. Numerical results
verified that the light-hierarchy structure could save more cost than the
light-tree structure
Multicast Routing In Optical Access Networks
Widely available broadband services in the Internet require high capacity access networks. Only optical networking is able to efficiently provide the huge bandwidth required by multimedia applications. Distributed applications such as Video-Conferencing, HDTV, VOD and Distance Learning are increasingly common and produce a large amount of data traffic, typically between several terminals. Multicast is a bandwidth-efficient technique for one-to-many or many-to-many communications, and will be indispensable for serving multimedia applications in future optical access networks. These applications require robust and reliable connections as well as the satisfaction of QoS criteria. In this chapter, several access network architectures and related multicast routing methods are analyzed. Overall network performance and dependability are the focus of our analysis
A model of signaling for establishing of LSPs for multicast communication over GMPLS networks
Label switching, which in IP networks is exemplified by MPLS and its extensions MPLambdaS and GMPLS, appears as one of the best alternatives to offer a reliable and flexible control plane for WDM networks, since it allows the integration of the IP Protocol with WDM technology, when lambdas are associated with labels, implements powerful traffic-engineering mechanisms, and provides several alternative schemes for fault-tolerance, as well as support for quality of service (QoS). However, almost all the definitions and standardizations for MPLS are restricted to unicast communication, leaving support for multicast communication for future work.
In the specific case of the triggering problem for LSPs (Label Switched Paths), there is still no consensus about the best strategy for multicast communication.
This paper proposes an algorithm for traffic-driven triggering of LSPs, based on MFCs (Multicast Forwarding Caches), and has the advantage of being a schema which is compatible with several multicast routing protocols. To validate the proposed algorithm we carry out simulation studies using the NS-2 (Network Simulator) simulation platform.5th IFIP International Conference on Network Control & Engineering for QoS, Security and MobilityRed de Universidades con Carreras en Informática (RedUNCI
Recommended from our members
Wavelengths switching and allocation algorithms in multicast technology using m-arity tree networks topology
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.In this thesis, the m-arity tree networks have been investigated to derive equations for their nodes, links and required wavelengths. The relationship among all parameters such as leaves nodes, destinations, paths and wavelengths has been found. Three situations have been explored, firstly when just one server and the leaves nodes are destinations, secondly when just one server and all other nodes are destinations, thirdly when all nodes are sources and destinations in the same time. The investigation has included binary, ternary, quaternary and finalized by general equations for all m-arity tree networks.
Moreover, a multicast technology is analysed in this thesis to transmit data carried by specific wavelengths to several clients. Wavelengths multicast switching is well examined to propose split-convert-split-convert (S-C-S-C) multicast switch which consists of light splitters and wavelengths converters. It has reduced group delay by 13% and 29% compared with split-convert (S-C) and split-convert-split (S-C-S) multicast switches respectively. The proposed switch has also increased the received signal power by a significant value which reaches 28% and 26.92% compared with S-C-S and S-C respectively.
In addition, wavelengths allocation algorithms in multicast technology are proposed in this thesis using tree networks topology. Distributed scheme is adopted by placing wavelength assignment controller in all parents’ nodes. Two distributed algorithms proposed shortest wavelength assignment (SWA) and highest number of destinations with shortest wavelength assignment (HND-SWA) algorithms to increase the received signal power, decrease group delay and reduce dispersion. The performance of the SWA algorithm was almost better or same as HND-SWA related to the power, dispersion and group delay but they are always better than other two algorithms. The required numbers of wavelengths and their utilised converters have been examined and calculated for the researched algorithms. The HND-SWA has recorded the superior performance compared with other algorithms. It has reduced number of utilised wavelengths up to about 19% and minimized number of the used wavelengths converters up to about 29%.
Finally, the centralised scheme is discussed and researched and proposed a centralised highest number of destinations (CHND) algorithm with static and dynamic scenarios to reduce network capacity decreasing (Cd) after each wavelengths allocation. The CDHND has reduced (Cd) by about 16.7% compared with the other algorithms
Development of Testing Standardization Regulation of the OLT XG-PON Equipments to Support Broadband Access in Indonesia
This study aims to provide a reference to the technical specifications of the Optical Line Termination (OLT) XG-PON equipment for improving standardization regulations (Perdirjen Postel No. 257 of 2008). The technical specifications tested in this study are the nominal rate capability, wavelength range, and jumbo frame of the OLT XG-PON equipment. The research acquired a reference to the nominal rate using FEC is 8.5 Gbps downstream direction, and 2.5 Gbps upstream direction, upstream wavelength range is 1260-1280 nm and downstream is 1575-1581 nm, and jumbo frame capability is 2000 Bytes
A model of signaling for establishing of LSPs for multicast communication over GMPLS networks
Label switching, which in IP networks is exemplified by MPLS and its extensions MPLambdaS and GMPLS, appears as one of the best alternatives to offer a reliable and flexible control plane for WDM networks, since it allows the integration of the IP Protocol with WDM technology, when lambdas are associated with labels, implements powerful traffic-engineering mechanisms, and provides several alternative schemes for fault-tolerance, as well as support for quality of service (QoS). However, almost all the definitions and standardizations for MPLS are restricted to unicast communication, leaving support for multicast communication for future work.
In the specific case of the triggering problem for LSPs (Label Switched Paths), there is still no consensus about the best strategy for multicast communication.
This paper proposes an algorithm for traffic-driven triggering of LSPs, based on MFCs (Multicast Forwarding Caches), and has the advantage of being a schema which is compatible with several multicast routing protocols. To validate the proposed algorithm we carry out simulation studies using the NS-2 (Network Simulator) simulation platform.5th IFIP International Conference on Network Control & Engineering for QoS, Security and MobilityRed de Universidades con Carreras en Informática (RedUNCI
Learning algorithms for the control of routing in integrated service communication networks
There is a high degree of uncertainty regarding the nature of traffic on future integrated service networks. This uncertainty motivates the use of adaptive resource allocation policies that can take advantage of the statistical fluctuations in the traffic demands. The adaptive control mechanisms must be 'lightweight', in terms of their overheads, and scale to potentially large networks with many traffic flows. Adaptive routing is one form of adaptive resource allocation, and this thesis considers the application of Stochastic Learning Automata (SLA) for distributed, lightweight adaptive routing in future integrated service communication networks. The thesis begins with a broad critical review of the use of Artificial Intelligence (AI) techniques applied to the control of communication networks. Detailed simulation models of integrated service networks are then constructed, and learning automata based routing is compared with traditional techniques on large scale networks. Learning automata are examined for the 'Quality-of-Service' (QoS) routing problem in realistic network topologies, where flows may be routed in the network subject to multiple QoS metrics, such as bandwidth and delay. It is found that learning automata based routing gives considerable blocking probability improvements over shortest path routing, despite only using local connectivity information and a simple probabilistic updating strategy. Furthermore, automata are considered for routing in more complex environments spanning issues such as multi-rate traffic, trunk reservation, routing over multiple domains, routing in high bandwidth-delay product networks and the use of learning automata as a background learning process. Automata are also examined for routing of both 'real-time' and 'non-real-time' traffics in an integrated traffic environment, where the non-real-time traffic has access to the bandwidth 'left over' by the real-time traffic. It is found that adopting learning automata for the routing of the real-time traffic may improve the performance to both real and non-real-time traffics under certain conditions. In addition, it is found that one set of learning automata may route both traffic types satisfactorily. Automata are considered for the routing of multicast connections in receiver-oriented, dynamic environments, where receivers may join and leave the multicast sessions dynamically. Automata are shown to be able to minimise the average delay or the total cost of the resulting trees using the appropriate feedback from the environment. Automata provide a distributed solution to the dynamic multicast problem, requiring purely local connectivity information and a simple updating strategy. Finally, automata are considered for the routing of multicast connections that require QoS guarantees, again in receiver-oriented dynamic environments. It is found that the distributed application of learning automata leads to considerably lower blocking probabilities than a shortest path tree approach, due to a combination of load balancing and minimum cost behaviour
Optical core networks research in the e-Photon-ONe+ project
This paper reports a summary of the joint research activities on Optical Core Networks within the e-Photon-ONe+ project. It provides a reasonable overview of the topics considered of interest by the European research community and supports the idea of building joint research activities that can leverage on the expertise of different research groups. © 2009 IEEE
- …