Fig 13 - uploaded by Vinod Vokkarane
Content may be subject to copyright.
Source publication
Many distributed applications require a group of destinations to be coordinated with a single source. Multicasting is a communication paradigm to implement these distributed applications. However in multicasting, if at least one of the members in the group cannot satisfy the service requirement of the application, the multicast request is said to b...
Similar publications
内の各リンクにおける波長利用状況を収集し、収集した波長利用情報に基づいて光パスの経路および波長を選択する ための様々なアルゴリズムが提案されてきた。しかし分散環境では情報配布での伝搬遅延や情報の交換間隔の影響に より劣化した情報を各ノードが経路選択に利用するため、ネットワーク全体の情報を正確に知ることができると仮定 した場合よりも棄却率が上昇する。一方、代替経路選択アルゴリズムではパス設定要求が棄却された場合に代替経路 を選択できるため、劣化した情報によって不適切な経路を選択するために発生する性能の劣化が小さくなると考えら れる。情報の劣化を考慮にいれたアルゴリズムによって性能の良い経路選択を実現できる可能性がある。そこで本稿 では、劣化した情報が経路選択におよぼす影響を明らかにするため複数...
This study investigates the routing and wavelength assignment (RWA) problem in all-optical wavelength division multiplexing (WDM) mesh networks. The RWA problems can be generally classified as static light-path establishment (SLE) or dynamic lightpath establishment (DLE). Additionally, the Load Balance RWA (LBRWA) algorithm using the concept of roo...
We consider the problem of determining a routing in all-optical networks, in which some couples of nodes want to communicate. In particular, we study this problem from the point of view of a network provider that has to design suitable payment functions for non-cooperative agents, corresponding to the couples of nodes wishing to communicate. The ne...
In this paper we study a problem of finding coloured paths of minimum weight in graphs. This problem has applications in WDM optical networks when high bandwidths are required to send data between a pair of nodes in the graph. Let \(G=(V,E)\) be a (directed) graph with a set of nodes V and a set of edges E in which each edge has an associated posit...
Wavelength Division Multiplexing (WDM) is the dominant transport technology used in numerous high capacity networks, based on optical infrastructure. Given the importance of costs associated to thes networks, resource management is becoming increasingly important, especialmy how the optical circuits (lightpaths) are routed throughout the network. T...
Citations
... To detect potential access conflicts and prevent both processes from updating data simultaneously in distributed database systems, the concept of manycast has been proposed first [9,10]. The problem of manycasting over optical burst-switched networks has been investigated [11][12][13]. The main challenge is providing reliability despite random contentions optical burst-switched networks for the problem of manycasting. ...
... are converted to feasible solutions;11 Fitness is calculated for all the wolves, {F(x i )|i = 1, 2, · · · , N I };12 Update the position of optimal individual, suboptimum individual, third-optimum individual (x β , x γ and x δ ); ...
Manycast routing and spectrum assignment (RSA) in elastic optical networks (EONs) has become a hot research field. In this paper, the mathematical model and high efficient algorithm to solve this challenging problem in EONs is investigated. First, a multi-objective optimization model, which minimizes network power consumption, the total occupied spectrum, and the maximum index of used frequency spectrum, is established. To handle this multi-objective optimization model, we integrate these three objectives into one by using a weighted sum strategy. To make the population distributed on the search domain uniformly, a uniform design method was developed. Based on this, an improved grey wolf optimization method (IGWO), which was inspired by PSO (Particle Swarm Optimization, PSO) and DE (Differential Evolution, DE), is proposed to solve the maximum model efficiently. To demonstrate high performance of the designed algorithm, a series of experiments are conducted using several different experimental scenes. Experimental results indicate that the proposed algorithm can obtain better results than the compared algorithm.
... Generally, the bulk of the communication established in a network is unicast, where a single source node sends data to a single destination node. In our work, we consider a new type of communication termed Manycast (Cheung et al. 1994;Bathula and Vokkarane 2010;Charbonneau and Vokkarane 2010a). The manycast is a generalization of the multicast communication paradigm . ...
The static routing and wavelength assignment (RWA) problem in Optical Networks is a combinatorial optimization problem fit to iterative search methods. In this paper we deal with the static manycast RWA problem in optical networks and solve it by maximizing the number of manycast request established for a given number of wavelengths. In this article, we implement and compare the performance of two metaheuristics namely the GA “Genetic Algorithm” and the TSA “Tabu Search Algorithm”. The proposed algorithms solve, approximately, the wavelength assignment problem and a backtracking approach is used to solve the routing problem. We first introduce our algorithms. We then evaluate and compare their performance. We corroborate our theoretical findings through extensive simulations. Representative empirical results show the accuracy of our GA and TSA.
... In the work [22], an ILP and several heuristics are introduced for solving multi-resource manycast in mesh networks. Few studies, however, tackle the manycast service over optical burst-switched (OBS) networks [23][24][25]. ...
The Static RWA (Routing and Wavelength Assignment) problem in Optical Networks is a combinatorial optimization problem fit to iterative search methods. In this article we further investigate the static manycast RWA problem in optical networks and solve it using an evolutionary programming (EP) strategy such that the number of the manycast requests established for a given number of wavelengths is maximized. The proposed algorithm solves, approximately, the wavelength assignment problem while a backtracking approach is used to solve the routing issue. We present the details of our proposed algorithm and compare it to another metaheuristic named genetic algorithm (GA). EP shows a 24 % improvement over GA.
... The network used for the analysis section of this paper is the network of NSFNet in (Bathula and Vokkarane 2010) shown in Fig. 3 with 14 nodes and 21 bidirectional links. The numbers on the links represent the actual physical distance between nodes in km. ...
This paper presents green service level agreement (GSLA) awareness for the hybrid and traditional routing mechanisms by proposing a mathematical model for the amount of route greenness, and proposing two algorithms for the adoption of GSLA. The effect of the adoption of GSLA on a network that on average has green energy available for longer duration of a day is modeled by defining a one-step two-by-two Markov matrix and representing the transformation through a state machine. This work also examines a re-provisioning algorithm to deal with the effect of re-provisioning of the established lightpaths in case of a change in the topology of a network. To study the effect of adopting GSLA, two Scenarios with different arrival rates of connections and four performance parameters such as average emission per lambda, average connection length, GSLA satisfaction and success rate are defined and analyzed over NSFnet. Results reveal that adopting the GSLA by routing mechanisms decreases the resource efficiency with both light and heavy traffic in return for less reduction in emission as compared to green and hybrid routing mechanisms.
... The outcome of the proposed system ORPT is compared with the Bathula et al. [21]. Bathula et al. [21] has attempted to enhance the performance of optical network from QoS viewpoint using OBS network for the purpose of minimizing the multi-constraint manycast issues in optical network. ...
... The outcome of the proposed system ORPT is compared with the Bathula et al. [21]. Bathula et al. [21] has attempted to enhance the performance of optical network from QoS viewpoint using OBS network for the purpose of minimizing the multi-constraint manycast issues in optical network. The study has formulated an algorithm mainly using shortest path tree to solve it considering BER, OSNR, and delay. ...
... The result exhibits the average blocking performance of both the system considering two service thresholds i.e. θ 1 (σ th =4.25, γ th =0.9, τ th =10ns) and θ 2 (σ th =4.25, γ th =0.8, τ th =10ns) respectively, where σ th represents noise factors, γ th represents reliability factor, and τ th represents propagation delay. Retaining similar values for noise and delay factor, the outcome exhibited in Figure 2 and Figure 3 shows that with the decrease of the reliability factor from 0.9 to 0.8 have no impacts on the proposed system as compared to Bathula et al. [21] approach. In fact the proposed system has negative blocking probability till 0.15 loads in Erlang. ...
The area of optical network is on constant point of focus among the research communities owing to potential advantage of long distance communication as well as the routing issues associated with it. Majority of the implemented techniques calls for using expensive hardware or adopting narrowed technical assumptions, for which reason the routing performance couldn’t be optimized to a large extent. The present manuscript proposes a novel technique called as Optimized Routing for Peak Traffic under the scenario of uncertainties in the existing traffic scenario. The proposed solution presents some potential principle that is incorporated in the ROADM design for enhancing the capabilities of the proposed system. The system is evaluated under multiple scenarios of analysis using blocking probabilities, OSNR, bit error rate, iteration etc. The outcome of the proposed system is compared with the one of the existing significant study to benchmark it.
... The outcome of the proposed system ORPT is compared with the Bathula et al. [21]. Bathula et al. [21] has attempted to enhance the performance of optical network from QoS viewpoint using OBS network for the purpose of minimizing the multi-constraint manycast issues in optical network. ...
... The outcome of the proposed system ORPT is compared with the Bathula et al. [21]. Bathula et al. [21] has attempted to enhance the performance of optical network from QoS viewpoint using OBS network for the purpose of minimizing the multi-constraint manycast issues in optical network. The study has formulated an algorithm mainly using shortest path tree to solve it considering BER, OSNR, and delay. ...
... The result exhibits the average blocking performance of both the system considering two service thresholds i.e. θ 1 (σ th =4.25, γ th =0.9, τ th =10ns) and θ 2 (σ th =4.25, γ th =0.8, τ th =10ns) respectively, where σ th represents noise factors, γ th represents reliability factor, and τ th represents propagation delay. Retaining similar values for noise and delay factor, the outcome exhibited in Figure 2 and Figure 3 shows that with the decrease of the reliability factor from 0.9 to 0.8 have no impacts on the proposed system as compared to Bathula et al. [21] approach. In fact the proposed system has negative blocking probability till 0.15 loads in Erlang. ...
The area of optical network is on constant point of focus among the research communities owing to potential advantage of long distance communication as well as the routing issues associated with it. Majority of the implemented techniques calls for using expensive hardware or adopting narrowed technical assumptions, for which reason the routing performance couldn't be optimized to a large extent. The present manuscript proposes a novel technique called as Optimized Routing for Peak Traffic under the scenario of uncertainties in the existing traffic scenario. The proposed solution presents some potential principle that is incorporated in the ROADM design for enhancing the capabilities of the proposed system. The system is evaluated under multiple scenarios of analysis using blocking probabilities, OSNR, bit error rate, iteration etc. The outcome of the proposed system is compared with the one of the existing significant study to benchmark it. Copyright © 2016 Institute of Advanced Engineering and Science. All rights reserved.
... The outcome of the proposed system ORPT is compared with the Bathula et al. [21]. Bathula et al. [21] has attempted to enhance the performance of optical network from QoS viewpoint using OBS network for the purpose of minimizing the multi-constraint manycast issues in optical network. ...
... The outcome of the proposed system ORPT is compared with the Bathula et al. [21]. Bathula et al. [21] has attempted to enhance the performance of optical network from QoS viewpoint using OBS network for the purpose of minimizing the multi-constraint manycast issues in optical network. The study has formulated an algorithm mainly using shortest path tree to solve it considering BER, OSNR, and delay. ...
... The result exhibits the average blocking performance of both the system considering two service thresholds i.e. θ 1 (σ th =4.25, γ th =0.9, τ th =10ns) and θ 2 (σ th =4.25, γ th =0.8, τ th =10ns) respectively, where σ th represents noise factors, γ th represents reliability factor, and τ th represents propagation delay. Retaining similar values for noise and delay factor, the outcome exhibited in Figure 2 and Figure 3 shows that with the decrease of the reliability factor from 0.9 to 0.8 have no impacts on the proposed system as compared to Bathula et al. [21] approach. In fact the proposed system has negative blocking probability till 0.15 loads in Erlang. ...
span>The area of optical network is on constant point of focus among the research communities owing to potential advantage of long distance communication as well as the routing issues associated with it. Majority of the implemented techniques calls for using expensive hardware or adopting narrowed technical assumptions, for which reason the routing performance couldn’t be optimized to a large extent. The present manuscript proposes a novel technique called as Optimized Routing for Peak Traffic under the scenario of uncertainties in the existing traffic scenario. The proposed solution presents some potential principle that is incorporated in the ROADM design for enhancing the capabilities of the proposed system. The system is evaluated under multiple scenarios of analysis using blocking probabilities, OSNR, bit error rate, iteration etc. The outcome of the proposed system is compared with the one of the existing significant study to benchmark it.</span
... We compare the algorithms based on burst loss probability, number of deflections, average endto-end delay, and average number of hops traveled by bursts. We first use the National Science Foundation (NSF) network topology shown in Fig. 3, which has been extensively used to evaluate performance of OBS networks [9], [18], [21], [30], [36]- [38]. We also use network topologies generated by the Waxman algorithm [39]. ...
Deflection routing is employed to ameliorate packet loss caused by contention in buffer-less architectures such as optical burst-switched networks. The main goal of deflection routing is to successfully deflect a packet based only on a limited knowledge that network nodes possess about their environment. In this paper, we present a framework that introduces intelligence to deflection routing (iDef). iDef decouples the design of the signaling infrastructure from the underlying learning algorithm. It consists of a signaling and a decision-making module. Signaling module implements a feedback management protocol while the decision-making module implements a reinforcement learning algorithm. We also propose several learning-based deflection routing protocols, implement them in iDef using the ns-3 network simulator, and compare their performance.
... We compare the algorithms based on burst loss probability, number of deflections, average end-to-end delay, and average number of hops traveled by bursts. We first use the National Science Foundation (NSF) network topology shown in Fig. 15.1, which has been extensively used to evaluate performance of OBS networks [9][10][11]34,38,64,65]. We also use the Boston University Representative Internet Topology Generator (BRITE) [16] to generate autonomous system-level topologies that consist of 10, 20, 50, 100, 200, 500, and 1,000 nodes. ...
Contention is the main source of information loss in buffer-less network architectures where deflection routing is a viable contention resolution scheme. In recent years, various reinforcement learning-based deflection routing algorithms have been proposed. However, performance of these algorithms has not been evaluated in larger networks that resemble the autonomous system-level topology of the Internet. In this paper, we compare performance of three reinforcement learning-based deflection routing algorithms by using topologies generated with Waxman and Barabási-Albert algorithms. We examine the scalability of deflection routing algorithms by increasing the network size while keeping the network load constant.
... In [82] the researchers studied the behavior of manycasting over OBS based on multiple QoS constraints, for example, physical layer impairments, transmission delay, and reliability of the link. Additionally, they have developed a mathematical model based on lattice algebra for this multiconstraint problem. ...
SUMMARY The exact contribution of this paper is a review of existing state-of-the-art routing strategies for optical burst switched networks developed by researchers to deal with burst contention before it happens. Routing schemes are implemented in space domain, which make them simple and cost effective. Additionally, the paper points out the importance of routing as an effective way to deal with burst contention compared to other solutions. It also underlines the main differences between contention avoidance schemes and contention resolution techniques for optical burst switched networks. We believe that this review will help different optical burst switched researchers involved in the development of route optimization algorithms to control burst contention. Copyright © 2011 John Wiley & Sons, Ltd.
