Professional Documents
Culture Documents
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 4, July August 2013 ISSN 2278-6856
TRAFFIC GROOMING WITH BLOCKING PROBABILITY REDUCTION IN DYNAMIC OPTICAL WDM NETWORKS
K.Pushpanathan1, Dr.A.Sivasubramanian2
1 2
Asst Prof, Anand Institute of Higher Technology, Chennai-603103 Prof & Head, St Josephs College of Engineering, Chennai-603103
Abstract: An optical network is a data network built on fibre-optics technology which sends data digitally as light. It offers an enormous increase in both transmission capacity and speed from traditional networks. The migration from electronic to optical transmission technology was achieved by only replacing copper cables with optical fibers. An optical fiber is capable of providing bandwidth in the order of terahertz with high reliability. Wavelength-division multiplexing divides the available fiber bandwidth into multiple smaller bandwidth units called wavelengths. Each wavelength channel has a bandwidth of few gigabits per second. But the requirement of each network traffic demand is normally lower than the capacity provided by a wavelength channel. Therefore multiple low rate traffic demands are usually multiplexed together to share a high speed wavelength channel during transmission. This process is known as Traffic grooming. The maximum number of traffic demands that can be multiplexed is known as grooming factor. Traffic grooming is two types. These are static and dynamic grooming. A connection request is not served within a time period by using RWA, it is rejected. This is treated as a blocked call. Priority based RWA has been focused to reduce the number of blocked connections. But this scheme gives best result if the connection requests are having the same sourcedestination pair. In this paper we propose adaptive routing algorithm for routing, distributed relative capacity loss (DRCL) algorithm for wavelength assignment. In adaptive routing, the route from a source node to a destination node is chosen dynamically, depending on the network state. In Distributed Relative Capacity Loss (DRCL), on which wavelength total capacity loss is more, that is assigned to the lightpath. The objective is to reduce the blocking probability, and for maximum utilization of available wavelength capacity compare to priority based RWA scheme.
Index Terms: Optical Networks, Traffic Grooming, Adaptive Routing, Wavelength Division Multiplexing.
1. INTRODUCTION
Wavelength routing together with wavelength division multiplexing (WDM) technology is a strong candidate for next generation high performance networks because it provides high bandwidth, low bit error rate, low power Volume 2, Issue 4 July August 2013
requirements and low cost. WDM technology has provided tremendous bandwidth for optical fibers by allowing simultaneous transmission of traffic on many non-overlapping channels (wavelengths) in an optical fiber. A message is sent from one node to another using wavelength continuous route called lightpath, without requiring any optical-electronic-optical conversion and buffering at the intermediate nodes. Given a set of connection requests, the problem of establishment of a lightpath for each connection request by selecting the optimal route and assigning a suitable wavelength is known as routing and wavelength assignment (RWA) [1,2]. Typically, connection requests may be of three types: static, incremental, and dynamic [3]. With static traffic, the entire set of connections is known in advance, and the problem is then to set up lightpaths for these connections in a global fashion while minimizing network resources such as the number of wavelengths or the number of fibers in the network. The RWA problem for static traffic is known as the Static Lightpath Establishment (SLE) problem. In the incremental traffic case, connection requests arrive sequentially, a lightpath is established for each connection, and the lightpath remains in the network indefinitely. For the case of dynamic traffic, a lightpath is set up for each connection request as it arrives, and the lightpath is released after some finite amount of time. The objective in the incremental and dynamic traffic cases is to set up lightpaths and assign wavelengths in a manner that minimizes the amount of connection blocking, or that maximizes the number of connections that are established in the network at any time. This problem is referred to as the Dynamic Lightpath Establishment (DLE) problem. Majority of connection requests are in the Mbps range and a single wavelength channel in a WDM of 100Gbps in a commercially available system. A new opportunity has opened up in the form of traffic grooming. It is only possible to incorporate a traffic grooming [4-8] mechanism with an RWA approach where a number of low speed connection requests are multiplexed onto a high capacity wavelength channel to enhance overall channel utilization. During RWA if a connection request is not served within a time period (called the holding time) by using RWA, it is rejected. This is treated as a blocked call. Our objective is mainly for the reduction of this call blocking. Routing and wavelength assignment is Page 355
3. Proposed work
The proposed PRWATG is intended to assign the wavelengths for the connection requests according to priority order to reduce the blocking probability in the network. In the proposed scheme, there are two steps constructing the complete framework. These steps are connection request grooming with priority order estimation and finally routing and wavelength assignment (RWA). Connection request grooming with priority order estimation is the first step used to groom the connection requests and estimate their priority order. Finally, groomed connection requests are served for wavelength assignment according to their priority order. Capacity utilization is less for without priority. Priority assignment increases the capacity utilization. Capacity of is filled with the priority of 0.5+0.25+0.25. So the traffic is groomed efficiently with the priority manner. The overall concept of the proposed scheme is depicted in Fig.1.
2. Network Description:
We model the physical topology of an optical network as a directed connected graph G (V, E, W), where V and E are the sets of nodes and bi-directional optical fiber links or edges of the network, respectively. Here each link has a finite number of wavelengths, W. In the network, a nonnegative cost (distance between adjacent nodes) C (e) is assigned for every e. The cost between nodes a and b is considered to be 1 if there exists no link between a and b. The following assumptions are considered in the model: Each fiber link can carry an equal number of wavelengths and the network is without wavelength conversion capabilities. All the lightpaths using the same fiber link must be allocated distinct wavelengths. Each node can work as both an access node and a routing node. Each node is equipped with a fixed number of tunable transceivers. Each node is capable of multiplexing/demulti-plexing as many connection requests (having the same source destination (sd) pair) within the channel capacity. All the channels have the same bandwidth. The connection requests arrive in the system randomly based on a Poisson process. Volume 2, Issue 4 July August 2013
Page 356
Where R is the set of connection requests and indicates the bandwidth of a connection request from source s to destination d. represents the groomed connection request from source s to destination d. Step 2: Enqueue all the groomed connection requests in the priority queue. Step 3: Cluster all the groomed connection requests into two types Such as direct physical link groomed connection requests and indirect physical link groomed connection requests. GR1= GR2= Such that
Where GR1 and GR2 are the two groomed connection request ordered sets of having direct and indirect physical links respectively. The priority order of each groomed connection request is assigned according to its position either in GR1 or in GR2. Groomed connection requests in GR1 have higher priorities compared to groomed connection requests in GR2.
Fig. 2 Primary (solid) and alternate (dashed) routes from Node 0 to Node 2.
4.2 Wavelength Assignment using DRCL: In order to implement an effective wavelength-selection policy in a distributed adaptive routing environment, two problems have to be solved: How is information of network state exchanged? and How can we reduce the amount of calculation upon receiving a connection request? To speed up the wavelength-assignment procedure, each node in the network stores information on the capacity loss on each wavelength so that only a table lookup and a small amount of calculations are required upon the arrival of a connection request. To maintain a valid table, the related values should be up-dated as soon as the network state has changed. To simplify the computation, we Page 357
5 Results
We consider the Indian network with 14 nodes, 24 bidirectional physical paths for analysing the blocking performance. It is as shown in fig.5, fig.6, fig.7. Connection request is blocked or rejected if it is not served within the holding time. So, the performance is measured in terms of blocking probability (BP), where the lower the blocking probability is the better the performance is.Fig.5, 6, 7 shows the blocking probability (BP) versus the number of wavelengths (W), obtained by using the proposed PRWATG scheme for the Indian network with 1000 connection requests. In these figures, K = 1 corresponds to a primary path and other values represent alternate paths (including the primary path). From the figures it is observed that the BP decreases with increase of W. and also the BP decreases with increase of K.
Fig. 5 BP versus W, obtained by using PRWATG for the Indian backbone network when k=1.
Fig. 6 BP versus W, obtained by using PRWATG for the Indian backbone network when k=2
Fig. 4 Wavelength-usage pattern for a network segment consisting of six fiber links in tandem. (Unshaded regions indicate that wavelength is available on these links.)
TABLE I
Fig. 7 BP versus W, obtained by using PRWATG for the Indian backbone network when k=3.
6. Conclusion
The effectiveness of the proposed scheme is examined through its performance evaluation in the Indian backbone network. It is a better scheme to reduce the call blocking in practical networks; only in the case of incoming connection requests are having the same source-destination pairs. For further reduction of blocking probability, for effective utilization of wavelength Volume 2, Issue 4 July August 2013 Page 358
References:
[1] B. Mukherjee, Optical WDM Networks. Springer, 2006. [2] R. M. C. Siva and G. Mohan, WDM Optical Networks:
Concepts, Design and Algorithms. PHI, 2003.
Dr.A.Sivasubramanian has received B.E. degree in ECE from University of Madras in 1990, and M.E. in Applied Electronics from Bharathiar University in 1995 and Ph.D. degree in Optical Comm. from AnnaUniversity Chennai in 2008. Currently he is working as a Prof & Head, in the department of Electronics and communication engineering at St.Josephs College of Engineering, Chennai, India. He has 20 years of experience in teaching and guiding projects for undergraduate, postgraduate and research scholars. He has added more than ten international and national publications to his credit. He is a recognized supervisor for the doctoral degree programme at Anna University Chennai and Sathyabama University, Chennai. His areas of interests include optical communication, optical networks, Bio-optical Engineering, Wireless sensor and computer networks. He is a member of ISTE, IETE, IEEE, and OSA.
AUTHOR:
K.Pushpanathan is a Research Scholar and pursuing a Doctoral Degree in Information & Communication Engineering at the Department of Electronics and Communication Engineering at Anna University, Chennai 600025, India. He received his B.E in Electronics and Communication Engineering (2001) from Volume 2, Issue 4 July August 2013 Page 359