TAILIEUCHUNG - The role of FDLS in scheduling in OBS networks

Scheduling in a node plays an important role in improving the efficiency of exploiting the bandwidth of optical burst switched networks. This article focuses on analyzing the role of FDL buffer in scheduling and evaluating its performances basing on the simulation results on NS2. | JOURNAL OF SCIENCE, Hue University, Vol. 69, No. 6, 2011 THE ROLE OF FDLS IN SCHEDULING IN OBS NETWORKS Vo Viet Minh Nhat1 and Nguyen Hong Quoc2 1 Faculty of Hospitality and Tourism, Hue University 2 College of Pedagogy, Hue University Abstract. Scheduling in a node plays an important role in improving the efficiency of exploiting the bandwidth of optical burst switched networks. However, a burst cannot be scheduled and will be dropped if resources, including a wavelength channel and a position of scheduling an arriving burst on the channel, are not available. A solution to this problem is to use an FDL buffer to delay the appearance of the arriving burst at output, by changing the position of scheduling the arriving burst on the selected available wavelength channel, hopefully there exists an available resource at the delayed output time. This article focuses on analyzing the role of FDL buffer in scheduling and evaluating its performances basing on the simulation results on NS2. Keywords: OBS, Scheduling, FDL buffer. 1 Introduction To satisfy the increasing demands for bandwidth in backbone networks such as the Internet, many models of optical network have been studied and proposed. In these models, wavelength routing (WR) networks are relatively easy to be installed, but difficult to handle on variable increment flows and frequently changed-status links. Optical packet switching (OPS) networks are obviously the next choice to overcome the above disadvantages, but they require more advanced technologies such as optical buffer and optical packet switching fabric which are currently unavailable. A new approach is the model of optical burst switching (OBS) which combines the advantages of wavelength routing and optical packet switching networks. Fig. 1. The offset time is calculated at least equal to the total of processing and transmission time from source to destination 75 From the first proposal of C. Qiao and M. Yoo [1][2], OBS models quickly get much

• Kỹ thuật lập trình
• OBS networks
• FDL buffer
• Fiber delay links
• OBS node integrated
• Architecture of OBS node integrated
• Algorithms of scheduling
• Quality of service in optical burst switched networks
• Optical burst switched networks
• Optical networks
• OBS architecture
• Signaling mechanisms
• Traditional channel scheduling algorithms
• Summary of Phd thesis
• Fairness control
• Optical burst switching networks
• Delay based QoS difference
• Optical circuit switching
• Optical packet switching
• Optical burst switching
• OBS network architecture
• Threshold based burst assembly techniques
• Signaling schemes
• Channel scheduling
• OBS core node architecture
• Scheduling algorithms
• Data channel scheduling algorithms
• Non preemptive minimum overlap channel
• Lecture Embedded systems
• Bài giảng Hệ thống nhúng
• Embedded systems
• Real time scheduling algorithms
• Real time scheduling problem
• Maximum lateness
• Conventional scheduling algorithms
• International Journal of Computer Networks and Communications Security
• A comprehensive view of hadoop mapreduce scheduling algorithms
• Hadoop mapreduce scheduling algorithms
• Disadvantage of these algorithms
• Minimizing makespan of a resource constrained scheduling problem
• A hybrid greedy and genetic algorithms
• Resource constrained scheduling problem
• Large scale problems
• Resource Constrained Project Scheduling Problem
• Backward forward search method
• Two stage genetic algorithm
• Non real time systems
• Timeline scheduling
• Rate monotonic scheduling
• Bài giảng Real time Systems
• Real time Systems
• Introduction of scheduling
• Constraints of real time tasks
• Classification of scheduling algorithms
• Scheduling anomalies
• Efficient cloud computing scheduling
• Comparing classic algorithms with generic algorithm
• Comparing classic algorithms
• Multi processor structure
• Advanced Algorithms Analysis and Design
• Lecture Advanced Algorithms Analysis and Design
• Bài giảng Phân tích và thiết kế thuật toán nâng cao
• Assembly line scheduling problem
• Brute Force approach
• Time complexity
• 2 line assembly scheduling problem
• Brute force analysis
• Dynamic programming
• Operating system concepts
• Lecture Operating system concepts
• Operating system
• Scheduling criteria
• Multiple processor scheduling
• Design and Analysis of Algorithms
• Analysis of Algorithms
• Design of Algorithms
• Data structures
• Interval scheduling
• Linear programming
• Lecture Real time systems
• Bài giảng Hệ thống thời gian thực
• Priority based scheduling
• Dynamic priority algorithms
• Earliest deadline first
• Least slack time
• Scheduling algorithm
• Budget constraints
• Cloud computing base
• Admission control
• Constraint QoS
• Resource allocation
• Algorithm Evaluation
• Thread Scheduling
• Operating systems
• Lecture Operating systems
• Uniprocessor scheduling
• Processor scheduling
• Efficient scheduling in cloud networks
• Chakoos evolutionary algorithm
• DSC and MCP algorithms
• The graphs involving communication cost
• Bài giảng Hệ điều hành
• Hệ điều hành
• Điều phối tiến trình
• Basic concepts
• Adaptive workflow scheduling
• Evolutionary approach in cloud computing
• Cloud computing
• Evolutionary algorithms
• Resource allocation
• Project management
• Renewable resources
• Cumulative resources
• Branch and bound algorithms
• Modified tabu search algorithm
• The single machine scheduling problem
• Additive manufacturing technology
• New meta heursitic
• The tabu search algorithms
• Rate monotonic
• Deadline monotonic
• Fixed priority algorithms
• Tự động hóa
• Điện – điện tử
• Cơ khí chế tạo máy
• Kiến trúc xây dựng
• kỹ thuật viễn thông