scholarly journals Efficient Placement of Splitters in Optical WDM Network

2021 ◽  
Author(s):  
Abdelhakim Dafeur ◽  
Bernard Cousin ◽  
Rezki Ziani
Keyword(s):  
Linear Programming ◽  
Network Topology ◽  
Exact Formulation ◽  
Placement Problem ◽  
Wdm Network ◽  
Optical Wdm ◽  
Link Cost ◽  
Simulation Results ◽  
Multicast Session ◽  
Splitter Placement

Abstract In this paper, we investigate the splitter placement problem in an optical WDM network. The goal is to select a given number of MC nodes in the network such that the overall link cost of a multicast session is minimized. We present an exact formulation in integer linear programming ( ILP ) to find a set of trees that connects a source to a set of destination nodes. Then, four algorithms based on network topology metrics are proposed to select a given number of MC nodes in the network such that the overall link cost of a multicast session is minimized. The efficiency of the proposed algorithms is verified by simulation results.

Multi-hop traffic grooming routing and wavelength assignment using split light trail in WDM all optical mesh networks

2021 ◽  
pp. 1-14
Author(s):  
Sampa Rani Bhadra ◽  
Ashok Kumar Pradhan ◽  
Utpal Biswas
Keyword(s):  
Mesh Networks ◽  
Blocking Probability ◽  
Wavelength Assignment ◽  
End User ◽  
Network Resources ◽  
Wdm Network ◽  
Optical Wdm ◽  
All Optical ◽  
User Access ◽  
Optical Mesh Networks

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity.

scholarly journals An Energy-Efficient Two-Stage Cooperative Routing Scheme in Wireless Multi-Hop Networks

Sensors ◽  
2019 ◽  
Vol 19 (5) ◽  
pp. 1002 ◽  
Author(s):  
Jianming Cheng ◽  
Yating Gao ◽  
Ningbo Zhang ◽  
Hongwen Yang
Keyword(s):  
Energy Efficiency ◽  
Network Lifetime ◽  
Cooperative Transmission ◽  
Transmission Model ◽  
Two Stage ◽  
Routing Scheme ◽  
Cooperative Routing ◽  
Link Cost ◽  
Simulation Results ◽  
End To End

Cooperative routing is one of the most widely used technologies for improving the energy efficiency and energy balance of wireless multi-hop networks. However, the end-to-end energy cost and network lifetime are greatly restricted if the cooperative transmission model is not designed properly. The main aim of this paper is to explore a two-stage cooperative routing scheme to further improve the energy efficiency and prolong the network lifetime. A two-stage cooperative (TSC) transmission model is firstly designed in which the core helper is introduced to determine the helper set for cooperation. Then, the two-stage link cost is formulated where x, the weight of residual energy, is introduced to be adjusted for different design goals. By selecting the optimal helper set, the two-stage link cost of each link can be optimized. Finally, based on the designed TSC transmission model and the optimized two-stage link cost, a distributed two-stage cooperative routing (TSCR) scheme is further proposed to minimize the end-to-end cooperative routing cost. Simulation results evaluate the effect of x on the different performance metrics. When x equals 0, TSCR can achieve the shortest end-to-end transmission delay and highest energy efficiency, while a larger x can achieve a longer network lifetime. Furthermore, simulation results also show that the proposed TSCR scheme can effectively improve both the energy efficiency and network lifetime compared with the existing schemes.

Discussion of power management in an optical WDM network

1998 ◽  
Author(s):  
Zhangyuan Chen ◽  
Guisheng Xiong ◽  
Baicheng Zhang ◽  
Anshi Xu ◽  
Deming Wu
Keyword(s):  
Power Management ◽  
Wdm Network ◽  
Optical Wdm

scholarly journals A Framework for the Joint Placement of Edge Service Infrastructure and User Plane Functions for 5G

Sensors ◽  
2019 ◽  
Vol 19 (18) ◽  
pp. 3975 ◽  
Author(s):  
Irian Leyva-Pupo ◽  
Alejandro Santoyo-González ◽  
Cristina Cervelló-Pastor
Keyword(s):  
Linear Programming ◽  
Optimal Solution ◽  
Cost Savings ◽  
Computation Time ◽  
Optimal Number ◽  
Use Cases ◽  
Next Generation Networks ◽  
Placement Problem ◽  
Communication Latency ◽  
Operational Costs

Achieving less than 1 ms end-to-end communication latency, required for certain 5G services and use cases, is imposing severe technical challenges for the deployment of next-generation networks. To achieve such an ambitious goal, the service infrastructure and User Plane Function (UPF) placement at the network edge, is mandatory. However, this solution implies a substantial increase in deployment and operational costs. To cost-effectively solve this joint placement problem, this paper introduces a framework to jointly address the placement of edge nodes (ENs) and UPFs. Our framework proposal relies on Integer Linear Programming (ILP) and heuristic solutions. The main objective is to determine the ENs and UPFs’ optimal number and locations to minimize overall costs while satisfying the service requirements. To this aim, several parameters and factors are considered, such as capacity, latency, costs and site restrictions. The proposed solutions are evaluated based on different metrics and the obtained results showcase over 20 % cost savings for the service infrastructure deployment. Moreover, the gap between the UPF placement heuristic and the optimal solution is equal to only one UPF in the worst cases, and a computation time reduction of over 35 % is achieved in all the use cases studied.

Sign in / Sign up

Export Citation Format

Share Document