Efficient Channel Scheduling Algorithms in Optical Burst Switched Network Jinhui Xu, Chunming Qiao, Jikai Li and Guang Xu Dep. Of CS, State University.

Slides:



Advertisements
Similar presentations
Reducing Network Energy Consumption via Sleeping and Rate- Adaption Sergiu Nedevschi, Lucian Popa, Gianluca Iannaccone, Sylvia Ratnasamy, David Wetherall.
Advertisements

One Dimensional Arrays
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Module R2 Overview. Process queues As processes enter the system and transition from state to state, they are stored queues. There may be many different.
1 Communication Networks Kolja Eger, Prof. Dr. U. Killat 1 From Packet-level to Flow-level Simulations of P2P Networks Kolja Eger, Ulrich Killat Hamburg.
Price-based Resource Allocation in Wireless Ad Hoc Networks Yuan Xue, Baochun Li and Klara Nahrstedt University of Illinois at Urbana-Champaign University.
Burst Segmentation: An Approach For Reducing Packet Loss In Optical Burst Switched Networks Vinod M. Vokkarane, Jason P. Jue, and Sriranjani Sitaraman.
A performance model for an asynchronous optical buffer W. Rogiest K. Laevens D. Fiems H. Bruneel SMACS Research Group Ghent University Performance 2005.
CS 315 March 24 Goals: Heap (Chapter 6) priority queue definition of a heap Algorithms for Insert DeleteMin percolate-down Build-heap.
Traffic Forecasting Medium Access TRANSFORMA Vladislav Petkov Katia Obraczka 1.
Assembling TCP/IP Packets in Optical Burst Switched Networks Xiaojun Cao, Jikai Li, Yang Chen and Chunming Qiao.
CS 104 Introduction to Computer Science and Graphics Problems
Reliable WDM Multicast in Optical Burst-Switched Networks Myoungki Jeong, Chunming Qiao and Yijun Xiong Dep. Of EE and CSE State University of New York.
Memory Management 1 CS502 Spring 2006 Memory Management CS-502 Spring 2006.
CS-3013 & CS-502, Summer 2006 Memory Management1 CS-3013 & CS-502 Summer 2006.
Scheduling for Wireless Networks with Users’ Satisfaction and Revenue Management Leonardo Badia*, Michele Zorzi + Speaker: Andrea Zanella + {lbadia,
A novel switching paradigm for buffer-less WDM networks Myungsik Yoo and Chunming Qiao EE and CSE Departments University at Buffalo (SUNY)
Chapter 4: Trees AVL Trees Lydia Sinapova, Simpson College Mark Allen Weiss: Data Structures and Algorithm Analysis in Java.
On The Deflection Routing in QoS Supported Optical Burst-Switched Network Ching-Fang Hsu, Te-Lung Liu, and Nen-Fu Huang Dep. of CS, NTHU, Taiwan, ROC.
2001/11/29Chin-Kai Wu, CS, NTHU1 Characteristics of Network Delay and Delay Jitter and its Effect on Voice over IP Li Zheng, Liren Zhang, Dong Xu Communications,
Organizing files for performance Chapter Data compression Advantages of reduced file size Redundancy reduction: state code example Repeating sequences:
Segmentation Based Nonpreemptive Channel Scheduling Algorithms for Optical Burst-Switched Networks Adviser : Ho-Ting Wu Speaker : Chih-Hao Tseng.
Optical Switching Switch Fabrics, Techniques and Architectures 원종호 (INC lab) Oct 30, 2006.
Sensor Networks Storage Sanket Totala Sudarshan Jagannathan.
TCP over OBS Joint Work with F. Baccelli, D. Hong, G. Petit, F. Poppe Julien Reynier Article available at
1 Geometric Intersection Determining if there are intersections between graphical objects Finding all intersecting pairs Brute Force Algorithm Plane Sweep.
1 Scheduling Algorithms in OBS Harleen Dhillon Chris Parrag.
Joint Channel Assignment and Routing in Real Time Wireless Mesh Network Xiaoguang Li †, Changqiao Xu ‡ † College of Software Engineering, Southeast University,
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths Mugurel Ionut Andreica Polytechnic University of Bucharest Computer.
Wavelength Assignment in Waveband Switching Networks with Wavelength Conversion Xiaojun Cao; Chunming Qiao; Anand, V. Jikai LI GLOBECOM '04. IEEE Volume.
1 Optical Burst Switching (OBS). 2 Optical Internet IP runs over an all-optical WDM layer –OXCs interconnected by fiber links –IP routers attached to.
Data Structures and Algorithms TREE. Searching Sequential Searches Time is proportional to n We call this time complexity O(n) Pronounce this “big oh”
Sorting List is rearranged into sorted order How is the sorted order determined? – The ItemType is responsible for determining the key to be used in comparison.
“Improving Fairness for Multi-Hop Bursts in Optical Burst Switching Networks” Tananun Orawiwattanakul Yusheng Ji Yongbing Zhang Asia Pacific Advanced Network.
Virtual Memory Lei Li CS147.
Page th IETF – Vancouver, December 2007 Signaling Extensions for Wavelength Switched Optical Networks Greg
Lambda scheduling algorithm for file transfers on high-speed optical circuits Hojun Lee Polytechnic Univ. Hua Li and Edwin Chong Colorado State Univ. Malathi.
Mergeable Heaps David Kauchak cs302 Spring Admin Homework 7?
Indexing OLAP Data Sunita Sarawagi Monowar Hossain York University.
CS 162 Intro to Programming II Insertion Sort 1. Assume the initial sequence a[0] a[1] … a[k] is already sorted k = 0 when the algorithm starts Insert.
Scheduling and transport for file transfers on high-speed optical circuits Authors: M. Veeraraghavan & Xuan Zheng (University of Virginia) Wu Feng (Los.
1 Principles revisited.NET: Two libraries: System.Collections System.Collections.Generics Data Structures and Collections.
CPU Scheduling Operating Systems CS 550. Last Time Deadlock Detection and Recovery Methods to handle deadlock – Ignore it! – Detect and Recover – Avoidance.
Errol Lloyd Design and Analysis of Algorithms Approximation Algorithms for NP-complete Problems Bin Packing Networks.
Data Structures: A Pseudocode Approach with C 1 Chapter 5 Objectives Upon completion you will be able to: Explain the design, use, and operation of a linear.
ADVANCED BATCH.
Optical Switching Switch Fabrics, Techniques and Architectures
Byon- Gon KIM1 , Kwan-Woong KIM2, Tae-Su JANG3 and Yong Kab KIM3
SEMINAR ON Optical Burst Switching
Unweighted Shortest Path Neil Tang 3/11/2010
CS223 Advanced Data Structures and Algorithms
CS 740: Advance Computer Networks Hand-out on Router Design
Cross-Layer Optimization for State Update in Mobile Gaming
Routing Without Flow Control Hot-Potato Routing Simulation
Hashing CS2110.
Search Sorted Array: Binary Search Linked List: Linear Search
Offset-Time-Based QoS Scheme
Meshed Multipath Routing: An Efficient Strategy in Wireless Sensor Networks Swades DE Chunming QIAO Hongyi WU EE Dept.
Indirection.
Binding Times Binding is an association between two things Examples:
Weighted Interval Scheduling
Binary Trees: Motivation
Data Structures: Searching
Optical Burst Switching
Data Structures and Algorithms
Maintaining Dynamic Tree with Min Subject to Constraints
CS223 Advanced Data Structures and Algorithms
Weighted Interval Scheduling
Data Structures and Algorithms
Jiahe Li
Presentation transcript:

Efficient Channel Scheduling Algorithms in Optical Burst Switched Network Jinhui Xu, Chunming Qiao, Jikai Li and Guang Xu Dep. Of CS, State University of New york at Buffalo

Horizon Algorithm

LAUC-VF Algorithm

Void Intervals Map to Points

Feasible Region

Min-EV Scheduling

Best-fit Scheduling

Allocation Search For Min-SV Fit

Time Complexity Searching: O(log m) Insertion, deleting: O(log m) Clean-up: O(log m)

Searching A Batch of Offset Times

Scheduling Time vs. Link Load

Loss Rate vs. Offset Time Range

Min-SV vs. Min-EV

Batching FDL Algorithm

Conclusion Several channel scheduling algorithms are presented. Unlike LAUC-VF or Horizon, these algorithms perform well in running time and loss rate.