Routing, Wavelength and Time-Slot Assignment Algorithm for Dynamic Traffic in WDM-TDM Optical Networks

2013 ◽  
Vol 303-306 ◽  
pp. 2027-2032
Author(s):  
Hui Li ◽  
Bi Sheng Quan ◽  
Zi Chun Le
Keyword(s):  
Numerical Simulation ◽  
Optical Networks ◽  
Time Slot ◽  
Blocking Probability ◽  
Channel Utilization ◽  
Dynamic Traffic ◽  
Fiber Networks ◽  
Lower Channel ◽  
Assignment Algorithm ◽  
Slot Assignment

Due to the lower channel utilization in conventional wavelength-routed networks, TDM technique is implemented on top of WDM to achieve a WDM-TDM network. RWTA problem in WDM-TDM networks is discussed. With the idea that assigned time-slots of one session can be distributed in multiple different wavelengths and the objective of minimizing network blocking probability, a RWTA algorithm called MUMD was proposed for dynamic traffic in mesh single-fiber networks. Then we demonstrate the performance of the proposed MUMD algorithm through numerical simulation. The results show that MUMD can efficiently optimize the network blocking performance, thereby optimize the resource utilization.

scholarly journals A New Distributed Slot Assignment Algorithm for Wireless Sensor Network Under Convergecast Data Traffic

2017 ◽  
Vol 2 (4) ◽  
pp. 331 ◽  
Author(s):  
Ilker Bekmezci ◽  
Fatih Alagoz
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Time Slot ◽  
Wireless Sensor ◽  
Data Traffic ◽  
Traffic Pattern ◽  
Assignment Algorithm ◽  
Slot Assignment ◽  
Major Factors

The scarcest resource for most of the wireless sensor networks (WSNs) is energy and one of the major factors inenergy consumption for WSNs is due to communication. Notonly transmission but also reception is the source of energyconsumption. The lore to decrease energy consumption is toturn off radio circuit when it is not needed. This is why TDMA has advantages over contention based methods. Time slot assignment algorithm is an essential part of TDMA based systems. Although centralized time slot assignment protocols are preferred in many WSNs, centralized approach is not scalable. In this paper, a new energy efficient and delay sensitive distributed time slot assignment algorithm (DTSM) is proposed for sensor networks under convergecast traffic pattern. DTSM which is developed as part of the military monitory (MILMON) system introduced in [27], aims to operate with low delay and low energy. Instead of collision based periods, it assigns slots by the help of tiny request slots. While traditional slot assignment algorithms do not allow assigning the same slot within two hop neighbors, because of the hidden node problem, DTSM can assign, if assignment is suitable for convergecast traffic. Simulation results have shown that delay and energy consumption performance of DTSM is superior to FPRP, DRAND, and TRAMA which are the most known distributed slot assignment protocols for WSNs or ad hoc networks. Although DTSM has somewhat long execution time, itsscalability characteristic may provide application specific time durations.

Dynamic routing and wavelength assignment for efficient traffic grooming

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Neeraj Mohan ◽  
Priyanka Kaushal
Keyword(s):  
Optical Networks ◽  
Resource Utilization ◽  
Wavelength Division Multiplexing ◽  
Computer Network ◽  
Blocking Probability ◽  
Traffic Grooming ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Dynamic Traffic ◽  
Network Efficiency

AbstractThe routing and wavelength assignment (RWA) schemes play an important role in all computer networks. The performance of a computer network and resource utilization largely depend on the RWA. The demand for higher bandwidth is increasing with each passing day, so more efficient RWA schemes need to be devolved to cater the increasing requirements. RWA becomes more challenging for dynamic traffic as the nature and flow of data are not known in advance. In this paper, a dynamic RWA scheme has been proposed for establishing a path in optical networks. The proposed scheme is based upon dynamic conversion sensing algorithm. It can be applied on a number of different network topologies. The proposed scheme is dynamic in nature, which is significantly useful for dynamic traffic grooming. The proposed scheme has been applied on 14 nodes National Science Foundation Network (NFSNet). Simulation results have shown that the blocking probability of this scheme is very low as compared to the existing schemes. So, the proposed dynamic RWA scheme enhances the network efficiency. It is useful for congestion hit networks. The reduced blocking probability in wavelength division multiplexing optical networks leads to better resource utilization and enhanced performance.

Sign in / Sign up

Export Citation Format

Share Document