期刊名称：International Journal of Advanced Computer Research
印刷版ISSN：2249-7277
电子版ISSN：2277-7970
出版年度：2012
卷号：2
期号：7
页码：125-129
出版社：Association of Computer Communication Education for National Triumph (ACCENT)
摘要：In this paper we present different demand policies in scheduled lightpath demand (SLDs) .SLD is a demand for a set of lightpaths (connections), defined by a tuple (s,d,n,α,ω) where s and d are the source and destination nodes of the lightpaths, n is the number of requested lightpaths α, ω and are the set-up and tear-down times of the lightpaths. The objective of this paper to increase resource utilization ratio by using channel reuse. In this paper we works on Cost 239 network by assigning the same channel to several lightpaths, by using different wavelengths which varies according to the time (set-up and tear-down).By comparison of demand policies which also depend upon time(set-up and tear-down) every demand policy has own schedule. By using Cost 239 network we found the result which demand policy is effective and scheduled first and we compare each policy by using graphical representation and then find which policy is best for scheduling and increase the resource utilization.
