DocumentCode
3091901
Title
Advance Reservation and Dynamic Scheduling of Point to Multipoint Lightpaths
Author
Arshad, Faraz ; Ramay, Sarfraz Rasheed ; Tanwir, Savera ; Battestilli, Lina ; Zaidi, S.M.H.
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Chaklala Scheme III, NUST, Rawalpindi, Pakistan
fYear
2008
fDate
18-20 Nov. 2008
Firstpage
69
Lastpage
74
Abstract
Advance reservation is a technique employed so that a request is guaranteed 100% availability of the resource it applied for sometimes earlier. In this paper we introduce the concept of advance reservation of lightpaths for a certain request characterized by some source and multiple destinations and also the time when network resources are demanded. We first present a point to multipoint adaptive routing algorithm that forms the basis of establishing lightpaths. Then the lightpaths are in fixed on the route through a wavelength assignment technique that works along with an advance reservation scheme to ensure conflict resolution among incoming requests. Based on our algorithm, we run our simulation model to generate results and exemplify the fact that advance reservation outruns on-demand reservation as far as the blocking probability is concerned.
Keywords
optical fibre networks; scheduling; telecommunication network routing; wavelength assignment; adaptive routing algorithm; advance reservation; blocking probability; dynamic scheduling; multiple destinations; point to multipoint lightpaths; source destinations; wavelength assignment technique; Availability; Bandwidth; Dynamic scheduling; Grid computing; Optical fiber cables; Optical fiber networks; Resource management; Routing; Wavelength assignment; Wavelength division multiplexing; Advance Reservation; Dynamic Scheduling; Point to Multipoint routing and wavelength assignment;
fLanguage
English
Publisher
ieee
Conference_Titel
High Capacity Optical Networks and Enabling Technologies, 2008. HONET 2008. International Symposium on
Conference_Location
Penang
Print_ISBN
978-1-4244-2960-8
Electronic_ISBN
978-1-4244-2961-5
Type
conf
DOI
10.1109/HONET.2008.4810211
Filename
4810211
Link To Document