Optical Packet Switching
|
|
- Darren Garrison
- 5 years ago
- Views:
Transcription
1 Optical Packet Switching DEISNet Gruppo Reti di Telecomunicazioni WDM Optical Network Legacy Networks Edge Systems WDM Links λ 1 λ 2 λ 3 λ 4 Core Nodes 2 1
2 Wavelength Routing Network Legacy Networks Edge Systems WDM Links Optical Cross-Connects 3 Optical Packet-Switched Network Legacy Networks Edge Systems WDM Links Optical Packet Routers 4 2
3 Optical Packet Switching Long-term alternative to the optical circuit switching techniques currently under development (e.g. Wavelength Routing, MPλS) Availability of the optical resource at packet level efficient use of the bandwidth Optical Packet Format: Payload Header Guard Band No O/E/O payload conversion needed at the core nodes, only header conversion may be performed 5 Optical Packet Router Architecture Wavelength Demux and Header Extraction 1 N Wavelength Conversion n Non-Blocking, All-Optical Space Switch + + Optical Buffer Switching fabric n Wavelength Mux and Header Insertion 1 N Switch Control Logic 6 3
4 Contention resolution in OPS networks Typical problem of packet-level switching Resolution techniques available in OPS networks: wavelength domain: contending packets transmitted on separate wavelengths of the same WDM link λ 1 λ 2 λ 3 λ 4 t 0 7 Contention resolution in OPS networks Typical problem of packet-level switching Resolution techniques available in OPS networks: wavelength domain: contending packets transmitted on separate wavelengths of the same WDM link time domain: contending packets delayed by optical buffers λ 1 t 0 t 0 +D 8 4
5 Contention resolution in OPS networks Typical problem of packet-level switching Resolution techniques available in OPS networks: wavelength domain: contending packets transmitted on separate wavelengths of the same WDM link time domain: contending packets delayed by optical buffers space domain: contending packets forwarded to different links, according to a given adaptive, multi-path routing strategy F 1 to node i F 2 to node j t 0 9 Contention resolution in OPS networks Typical problem of packet-level switching Resolution techniques available in OPS networks: wavelength domain: contending packets transmitted on separate wavelengths of the same WDM link time domain: contending packets delayed by optical buffers space domain: contending packets forwarded to different links, according to a given adaptive, multi-path routing strategy Performance of OPS contention resolution schemes traditionally evaluated in terms of packet loss rate packet latency Effects on the packet stream are also important packet sequence delay jitter 10 5
6 Optical Buffer 0 D t 0 (B -1)D t 0 t 0 +D t 0 +2D t 0 +(B -1)D Realized with B Fiber Delay Lines (FDL): the delay must be chosen at packet arrival packets are delayed until the output wavelength is available available delays are consecutive multiples of the delay unit D (different choices are also possible) packets are lost when the buffer is full, i.e. the required delay is larger than the maximum delay achievable D M = (B -1)D 11 The FDL-gap problem Using asynchronous, variable-length optical packets is efficient to carry one or more IP datagrams or packets from heterogeneous legacy networks Assumption: FIFO queuing, i.e. packets cannot overtake one another Due to the packets variable length and the finite delay granularity, when packets are queued a time gap between the end of a packet and the beginning of the following one is present (0 < gap size < D) t 0 D GAP t 0 +3D 12 6
7 The Excess Load During the gap: the server is idle the queued packet must wait for the delay to expire the result is some waste of the available output bandwidth The gap can be seen as an artificial increase of the length of the previous packet it results in an excess load at the output Real Length Excess length D 13 Choosing the Buffer Delay Unit D is directly related to time resolution of the FDL buffer maximum delay achievable (buffer size) Performance Degradation Short buffer Large gaps D 14 7
8 Single wavelength case Simulation VS. approximate Markov model assuming a finite queue Packet loss probability Too many FDLs Wavelength MUX required D (normalized to the average packet length) 15 Wavelength and Delay Selection (WDS) At packet arrival Given the output fiber (from routing table lookup) Forwarding algorithm must determine the output wavelength the required delay Example: 4 delays 4 wavelengths λ 1 λ 2 λ 3 λ 4 t 0 t 0 +D t 0 +2D t 0 +3D t 0 +4D WDS problem: how to assign the best wavelength to the packet? 16 8
9 Queuing Model of a WDM Optical Buffer For each output fiber: n identical servers represented by the n wavelengths n logical FDL buffer in parallel, one for each wavelength (realized with a single set of FDLs operated in WDM) Packet λ 1 λ 2 λ 3 λ 4 17 WDS policies Gap-filling techniques may be too complex for the optical packet switching time-scale λ 1 λ 2 λ 3 λ 4 t 0 t 0 +D t 0 +2D t 0 +3D t 0 +4D 18 9
10 WDS policies Gap-filling techniques may be too complex for the optical packet switching time-scale Simpler policies based on wavelength availability, with increasing intelligence Pursuing an analytical approach seems very complex simulation study λ 1 λ 2 λ 3 λ 4 t 0 t 0 +D t 0 +2D t 0 +3D t 0 +4D 19 WDS policies D-type: delay oriented, aiming at minimizing the queuing time choice of the first available wavelength G-type: gap oriented, aiming at minimizing the gaps between queued packets choice of the wavelength with the closest queued packet G-type λ 1 λ 2 λ 3 λ 4 D-type t 0 t 0 +D t 0 +2D t 0 +3D t 0 +4D 20 10
11 Single-node WDS performance 1 1.0e-1 1.0e-2 1.0e-3 1.0e-4 1.0e-5 Packet Loss Probability Simple Round-Robin D-type G-type Input Load per wavelength = 0.8 Uniform random traffic 4 I/O fibers 16 wavelengths/fiber 8 FDLs 1.0e D (normalized to the average packet length) 21 Role of time and wavelength domains D-type vs. G-type G-type D (normalized to the average packet length) Number of wavelengths per fiber 22 11
12 Synchronous network, slotted operation Asynchronous, variable-length legacy packets are split and inserted into a number of slots ( slot size = T ) Alternatives for the optical packet format: Fixed-Length Packet (FLP): each slot is routed independently Slotted Variable-Length Packet (SVLP): each train of slots is routed altogether Incoming traffic net load = ρ real load = ρ F >ρ FLP SVLP T real load = ρ S <ρ F 23 SVLP performance Slot size normalized to the average packet length D (normalized to the average packet length) Number of wavelengths in the buffer 24 12
13 QoS differentiation in the OPS node Due to FDL buffering constraints, traditional priority queuing and scheduling techniques are not feasible QoS differentiation at the OPS node level possible through resource partitioning any K wavelengths are reserved to HP traffic based on the actual occupancy e.g. K=2 LP packets are allowed as long as more than 2 wavelengths are available LP HP λ 1 λ 2 λ 3 λ 4 t 0 t 0 +D t 0 +2D t 0 +3D t 0 +4D λ 1 λ 2 λ 3 λ 4 t 0 t 0 +D t 0 +2D t 0 +3D t 0 +4D 25 Routing strategies in OPS networks Path computation algorithms provide: a default path, i.e. the shortest path (e.g. in terms of number of hops) a number of alternative paths, with equal or higher hop count than the default one The routing strategy may use: Shortest-Path Routing (SPR) only static routing tables not using any alternative path Multi-Path Routing (MPR) dynamic routing tables alternative paths used to relieve congestion on the default one Decisions to be taken by MPR strategy how many alternative paths should be considered how they should be dealt with by WDS policies 26 13
14 Dynamic MPR strategies (1) Strategies applying WDS on one of the alternative paths only when the default path is congested: a path is considered congested when, on the corresponding output link, all the wavelengths are busy and there are no places left in the optical buffer SAP (Shortest Alternative Paths) beside the default link, an alternative set of routes is considered, including any other shortest path different from the default one n-sap (n-shortest Alternative Paths) besides the default link, n alternative sets of routes are considered, corresponding to paths with up to n 1 hops more than the shortest one 27 Dynamic MPR: 2-SAP Alternative paths available toward the packet destination PKT alternative path 1 DESTINATION default path alternative path
15 Dynamic MPR: 2-SAP Packets are sent through the default path, as long as this one is not congested PKT DESTINATION WDS 29 Dynamic MPR: 2-SAP In case the default path is congested, the best wavelength is chosen by the WDS policy on one of the alternative paths WDS PKT DESTINATION congestion 30 15
16 Dynamic MPR: 2-SAP In case the default path is congested, the best wavelength is chosen by the WDS policy on one of the alternative paths congestion DESTINATION congestion PKT WDS 31 Dynamic MPR strategies (2) Strategies applying WDS not on a single link, but on an entire set of links sharing the wavelengths belonging to different paths SSP (Shared Shortest Paths) WDS is performed over all the wavelengths on any shortest path link, including the default one n-ssp (n-shared Shortest Paths) WDS is performed over all the wavelengths on any link corresponding to paths with up to n 1 hops more than the shortest one 32 16
17 Dynamic MPR: SSP WDS performed on any shortest path link WDS DESTINATION 33 Dynamic MPR: 2-SSP WDS performed on any shortest and 2nd-shortest path link WDS DESTINATION 34 17
18 Dynamic MPR strategies performance Simulation of European network (15 nodes, 24 links) Dynamic MPR effective when non-shortest paths are used Network-wide Packet Loss Probability 1e-03 1e-04 1e-05 1e-06 SPR SAP 2-SAP SSP 2-SSP 35 QoS differentiation at the routing level Integration of QoS management into dynamic MPR strategies aggregate QoS classes (sort of DiffServ approach) simple set-up: 2 priority classes High-Priority (HP) traffic: always routed along the shortest path (SPR) using node-level resource partitioning limited packet loss limited delay and packet jitter Low-Priority (LP) traffic: two options always routed along the shortest path (SPR) using spare resources overflow traffic re-routed to alternative paths (MPR) 36 18
19 Simple test topology Average node degree: E = wavelengths per link, each loaded with 0.8 traffic matrix generated accordingly 37 QoS performance SPR/MPR is the routing policy adopted for LP traffic HP traffic (20%) always uses SPR Accurate dimensioning gives a good degree of traffic differentiation LP routing policy does not affect HP LP performance is slightly affected by HP resource dimensioning (within the range considered) Packet loss probability 1 1e-01 1e-02 1e-03 1e-04 1e-05 1e-06 SPR HP SPR LP MPR LP 1e-07 1e-08 MPR HP No. of reserved wavelenghts (K) 38 19
20 QoS performance SPR/MPR is the routing policy adopted for LP traffic HP traffic always uses SPR K = 3 1 Packet loss probability 1e-01 1e-02 1e-03 1e-04 1e-05 1e-06 SPR LP SPR HP MPR HP MPR LP 1e-07 1e Percentage of HP traffic 39 Reference topology Average node degree: E =
21 Topology 1: uniform matrix, balanced load 1.E00 LP loss HP loss 1.E-01 1.E-02 Loss rate 1.E-03 1.E-04 1.E-05 1.E Link 41 Reference topology Average node degree: E =
22 Topology 2: uniform matrix, balanced load 1.E00 LP loss HP loss 1.E-01 1.E-02 Loss rate 1.E-03 1.E-04 1.E-05 1.E Link 43 Topologies 1 & 2: no. of hops distribution 1.E+00 1.E-01 E = 3.25 E = E-02 1.E-03 Distribution 1.E-04 1.E-05 1.E-06 1.E-07 1.E No. of hops 44 22
23 Link failure recovery in OPS networks Connectionless approach Single link failure Link failure detection technique notified by physical layer time-based signaling-based During failure detection, loss of optical packets supposed to be transmitted on the failed link After failure detection, the recovery procedure is called and a MPR alternative path is used 45 Packet loss during failure detection Analytical model for the packet loss probability as a function of detection time p is the loss probability in a failure free scenario t f is the failure time d is the failure detection delay p t t f t f PL ( t) = 1 (1 p) t f < t < t f + d t t f 1 (1 p) t t f + d t f + d 46 23
24 Packet loss during failure detection 1 loss rate when d = d 3 loss rate when d = d 2 loss rate when d = d 1 Packet Loss Rate loss rate without link failure failure time d 1 d 2 d t f Time 47 Adding resources for protection The MPR-based protection scheme needs additional resources to be effective First, the network is dimensioned to have a given average load per wavelength (e.g. 0.7) with relation to the input traffic matrix Then, further wavelengths are added to each fiber so that each node sees all its output fibers with the same capacity Additional cost due to protection is 73% of the initial cost in terms of number of wavelengths 48 24
25 Impact on throughput 3.55e+12 Network Throughput [bps] No protection resources 3.50e e e e e e+12 before failure during failure detection Simulation Time [sec] after failure detection +73% protection resources 49 Out-of-sequence packet delivery A consequence of dynamic resource allocation techniques deployed to reduce congestion Implications: complex reordering operations at the optical network edges due to the huge bit rate of the optical channels throughput degradation at the transport/application level TCP congestion control highly affected by unordered segments real-time, UDP-based traffic requirements impaired by excessive delay due to unordered packets and/or reordering process Possible solutions: WDS policy with some time constraints in order to keep the correct packet sequence dynamic multi-path routing limited to delay-equivalent paths But what do we intend with correct packet sequence? 50 25
26 Alternatives for packet sequence ARRIVAL P n P n+1 t n t n+1 t DEPARTURE ❶ strictly in-sequence ❷ strictly in-sequence (transparent) ❸ strictly in-sequence ❹ loosely in-sequence ❺ loosely in- OR out-of-sequence ❻ ❼ L n+1 0 L n t n loosely out-of-sequence strictly out-of-sequence 51 s n Jitter distribution Jitter distribution G-type WDS with sequence constraint Region Jitter distribution G-type WDS Region 52 26
27 Impact on loss 1 Packet loss probability with sequence constraint without sequence constraint D (normalized to the average packet length) 53 Conclusions OPS from the network perspective: issues dynamic multi-path routing for contention resolution QoS differentiation through resource partitioning and differentiated routing strategy link failure protection strategy through multi-path routing and additional resources provisioning packet sequence issues Further ongoing activities: effective low-complexity implementation of void filling WDS study of dynamic routing through ant colony optimization study of the impact of packet sequence break on higher layer protocols study of the impact of limited wavelength conversion on node and network performance 54 27
QoS routing in DWDM Optical Packet Networks
QoS routing in DWDM Optical Packet Networks W. Cerroni CNIT Bologna Research Unit, ITALY F. Callegati, G. Muretto, C. Raffaelli, P. Zaffoni DEIS University of Bologna, ITALY Optical Packet Switching (OPS)
More informationOptical Packet Switching: A Network Perspective
Optical Packet Switching: A Network Perspective Franco Callegati, Walter Cerroni, Giorgio Corazza, Carla Raffaelli D.E.I.S. - University of Bologna Viale Risorgimento, 2-4036 Bologna - ITALY {fcallegati,wcerroni,gcorazza,craffaelli}@deis.unibo.it
More informationToward a Reliable Data Transport Architecture for Optical Burst-Switched Networks
Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University
More informationNew Approaches to Optical Packet Switching in Carrier Networks. Thomas C. McDermott Chiaro Networks Richardson, Texas
New Approaches to Optical Packet Switching in Carrier Networks Thomas C. McDermott Chiaro Networks Richardson, Texas Outline Introduction, Vision, Problem statement Approaches to Optical Packet Switching
More informationRouting in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
More informationReal-Time Protocol (RTP)
Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of
More informationOptical Burst Switching (OBS): The Dawn of A New Era in Optical Networking
Optical Burst Switching (OBS): The Dawn of A New Era in Optical Networking Presented by Yang Chen (LANDER) Yang Chen (Lander) 1 Outline Historical Review Burst reservation Burst assembly OBS node Towards
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationWide area networks: packet switching and congestion
Wide area networks: packet switching and congestion Packet switching ATM and Frame Relay Congestion Circuit and Packet Switching Circuit switching designed for voice Resources dedicated to a particular
More informationETSF05/ETSF10 Internet Protocols. Performance & QoS Congestion Control
ETSF05/ETSF10 Internet Protocols Performance & QoS Congestion Control Quality of Service (QoS) Maintaining a functioning network Meeting applications demands User s demands = QoE (Quality of Experience)
More informationBasics (cont.) Characteristics of data communication technologies OSI-Model
48 Basics (cont.) Characteristics of data communication technologies OSI-Model Topologies Packet switching / Circuit switching Medium Access Control (MAC) mechanisms Coding Quality of Service (QoS) 49
More informationOptical Communications and Networking 朱祖勍. Nov. 27, 2017
Optical Communications and Networking Nov. 27, 2017 1 What is a Core Network? A core network is the central part of a telecommunication network that provides services to customers who are connected by
More informationLayer 3: Network Layer. 9. Mar INF-3190: Switching and Routing
Layer 3: Network Layer 9. Mar. 2005 1 INF-3190: Switching and Routing Network Layer Goal Enable data transfer from end system to end system End systems Several hops, (heterogeneous) subnetworks Compensate
More informationLecture 2: Internet Structure
Lecture 2: Internet Structure COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F Kurose and K.W. Ross,
More informationOn Network Dimensioning Approach for the Internet
On Dimensioning Approach for the Internet Masayuki Murata ed Environment Division Cybermedia Center, (also, Graduate School of Engineering Science, ) e-mail: murata@ics.es.osaka-u.ac.jp http://www-ana.ics.es.osaka-u.ac.jp/
More informationResource Allocation and Queuing Theory
and Modeling Modeling Networks Outline 1 Introduction Why are we waiting?... 2 Packet-Switched Network Connectionless Flows Service Model Router-Centric versus Host-Centric Reservation Based versus Feedback-Based
More informationQuality of Service in the Internet
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationNetwork Support for Multimedia
Network Support for Multimedia Daniel Zappala CS 460 Computer Networking Brigham Young University Network Support for Multimedia 2/33 make the best of best effort use application-level techniques use CDNs
More informationLecture 16: Network Layer Overview, Internet Protocol
Lecture 16: Network Layer Overview, Internet Protocol COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016,
More informationMulticast and Quality of Service. Internet Technologies and Applications
Multicast and Quality of Service Internet Technologies and Applications Aims and Contents Aims Introduce the multicast and the benefits it offers Explain quality of service and basic techniques for delivering
More informationETSF05/ETSF10 Internet Protocols. Performance & QoS Congestion Control
ETSF05/ETSF10 Internet Protocols Performance & QoS Congestion Control Quality of Service (QoS) Maintaining a functioning network Meeting applications demands User s demands = QoE (Quality of Experience)
More informationNext Steps Spring 2011 Lecture #18. Multi-hop Networks. Network Reliability. Have: digital point-to-point. Want: many interconnected points
Next Steps Have: digital point-to-point We ve worked on link signaling, reliability, sharing Want: many interconnected points 6.02 Spring 2011 Lecture #18 multi-hop networks: design criteria network topologies
More informationQuality of Service in the Internet
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationInternetworking Part 1
CMPE 344 Computer Networks Spring 2012 Internetworking Part 1 Reading: Peterson and Davie, 3.1 22/03/2012 1 Not all networks are directly connected Limit to how many hosts can be attached Point-to-point:
More informationInternet Services & Protocols. Quality of Service Architecture
Department of Computer Science Institute for System Architecture, Chair for Computer Networks Internet Services & Protocols Quality of Service Architecture Dr.-Ing. Stephan Groß Room: INF 3099 E-Mail:
More informationGeneric Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture
Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,
More informationData Networks. Lecture 1: Introduction. September 4, 2008
Data Networks Lecture 1: Introduction September 4, 2008 Slide 1 Learning Objectives Fundamental aspects of network Design and Analysis: Architecture: layering, topology design, switching mechanisms Protocols:
More informationTCP Window Estimation for Burst Assembly in OBS Networks
TCP Window Estimation for Burst Assembly in OBS Networks Maurizio Casoni (maurizio.casoni@unimore.it) Department of Information Engineering University of Modena and Reggio Emilia Italy Outline Introduction:
More informationUNIT- 2 Physical Layer and Overview of PL Switching
UNIT- 2 Physical Layer and Overview of PL Switching 2.1 MULTIPLEXING Multiplexing is the set of techniques that allows the simultaneous transmission of multiple signals across a single data link. Figure
More informationThis Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network
This Lecture BUS0 - Computer Facilities Network Management Switching networks Circuit switching Packet switching gram approach Virtual circuit approach Routing in switching networks Faculty of Information
More informationSIMULATION ISSUES OF OPTICAL PACKET SWITCHING RING NETWORKS
SIMULATION ISSUES OF OPTICAL PACKET SWITCHING RING NETWORKS Marko Lackovic and Cristian Bungarzeanu EPFL-STI-ITOP-TCOM CH-1015 Lausanne, Switzerland {marko.lackovic;cristian.bungarzeanu}@epfl.ch KEYWORDS
More information"Filling up an old bath with holes in it, indeed. Who would be such a fool?" "A sum it is, girl," my father said. "A sum. A problem for the mind.
We were doing very well, up to the kind of sum when a bath is filling at the rate of so many gallons and two holes are letting the water out, and please to say how long it will take to fill the bath, when
More informationWilliam Stallings Data and Computer Communications. Chapter 10 Packet Switching
William Stallings Data and Computer Communications Chapter 10 Packet Switching Principles Circuit switching designed for voice Resources dedicated to a particular call Much of the time a data connection
More informationPriority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies
CSCD 433/533 Priority Traffic Advanced Networks Spring 2016 Lecture 21 Congestion Control and Queuing Strategies 1 Topics Congestion Control and Resource Allocation Flows Types of Mechanisms Evaluation
More informationMohammad Hossein Manshaei 1393
Mohammad Hossein Manshaei manshaei@gmail.com 1393 Voice and Video over IP Slides derived from those available on the Web site of the book Computer Networking, by Kurose and Ross, PEARSON 2 Multimedia networking:
More informationUNIT-II OVERVIEW OF PHYSICAL LAYER SWITCHING & MULTIPLEXING
1 UNIT-II OVERVIEW OF PHYSICAL LAYER SWITCHING & MULTIPLEXING Syllabus: Physical layer and overview of PL Switching: Multiplexing: frequency division multiplexing, wave length division multiplexing, synchronous
More informationEECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture
EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,
More informationResource allocation in networks. Resource Allocation in Networks. Resource allocation
Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers
More informationQoS on Low Bandwidth High Delay Links. Prakash Shende Planning & Engg. Team Data Network Reliance Infocomm
QoS on Low Bandwidth High Delay Links Prakash Shende Planning & Engg. Team Data Network Reliance Infocomm Agenda QoS Some Basics What are the characteristics of High Delay Low Bandwidth link What factors
More informationRate-based pacing for small buffered optical packet-switched networks
Vol. 6, No. 9 / September 2007 / JOURNAL OF OPTICAL NETWORKING 1116 Rate-based pacing for small buffered optical packet-switched networks Onur Alparslan,* Shin ichi Arakawa, and Masayuki Murata Graduate
More informationResource Sharing for QoS in Agile All Photonic Networks
Resource Sharing for QoS in Agile All Photonic Networks Anton Vinokurov, Xiao Liu, Lorne G Mason Department of Electrical and Computer Engineering, McGill University, Montreal, Canada, H3A 2A7 E-mail:
More informationDelayed reservation decision in optical burst switching networks with optical buffers
Delayed reservation decision in optical burst switching networks with optical buffers G.M. Li *, Victor O.K. Li + *School of Information Engineering SHANDONG University at WEIHAI, China + Department of
More informationConfiguration of Offset Time in Optical Burst Switching Networks for Delay Sensitive Traffic
Configuration of Offset Time in Optical Burst Switching Networks for Delay Sensitive Traffic Anupam Soni and Yatindra Nath Singh anusoni@iitk.ac.in,ynsingh@iitk.ac.in. Abstract In Optical Burst Switching
More informationAdvanced Computer Networks
Advanced Computer Networks QoS in IP networks Prof. Andrzej Duda duda@imag.fr Contents QoS principles Traffic shaping leaky bucket token bucket Scheduling FIFO Fair queueing RED IntServ DiffServ http://duda.imag.fr
More informationQuality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel
Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel Semra.gulder@crc.ca, mathieu.deziel@crc.ca Abstract: This paper describes a QoS mechanism suitable for Mobile Ad Hoc Networks
More informationCS551 Router Queue Management
CS551 Router Queue Management Bill Cheng http://merlot.usc.edu/cs551-f12 1 Congestion Control vs. Resource Allocation Network s key role is to allocate its transmission resources to users or applications
More informationCCVP QOS Quick Reference Sheets
Why You Need Quality of Service (QoS)...3 QoS Basics...5 QoS Deployment...6 QoS Components...6 CCVP QOS Quick Reference Sheets Basic QoS Configuration...11 Traffic Classification and Marking...15 Queuing...26
More informationNetwork Control and Signalling
Network Control and Signalling 1. Introduction 2. Fundamentals and design principles 3. Network architecture and topology 4. Network control and signalling 5. Network components 5.1 links 5.2 switches
More informationPROVIDING SERVICE DIFFERENTIATION IN OBS NETWORKS THROUGH PROBABILISTIC PREEMPTION. YANG LIHONG (B.ENG(Hons.), NTU)
PROVIDING SERVICE DIFFERENTIATION IN OBS NETWORKS THROUGH PROBABILISTIC PREEMPTION YANG LIHONG (B.ENG(Hons.), NTU) A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF ENGINEERING DEPARTMENT OF ELECTRICAL &
More informationIntroduction To Optical Networks Optical Networks: A Practical Perspective
Introduction To Optical Networks Optical Networks: A Practical Perspective Galen Sasaki Galen Sasaki University of Hawaii 1 Galen Sasaki University of Hawaii 2 Galen Sasaki University of Hawaii 3 Telecommunications
More informationOverview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services
Overview 15-441 15-441 Computer Networking 15-641 Lecture 19 Queue Management and Quality of Service Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 What is QoS? Queuing discipline and scheduling
More informationThe Network Layer and Routers
The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in
More informationTopic 4b: QoS Principles. Chapter 9 Multimedia Networking. Computer Networking: A Top Down Approach
Topic 4b: QoS Principles Chapter 9 Computer Networking: A Top Down Approach 7 th edition Jim Kurose, Keith Ross Pearson/Addison Wesley April 2016 9-1 Providing multiple classes of service thus far: making
More informationThe Diffie-Hellman Key Exchange
ISC: SECURITY AND QOS The Diffie-Hellman Key Exchange A mechanism to establish secret keys without the need for CAs Based on the difficulty of computing discrete logarithms of large numbers Public (or
More informationNetwork Working Group Request for Comments: 1046 ISI February A Queuing Algorithm to Provide Type-of-Service for IP Links
Network Working Group Request for Comments: 1046 W. Prue J. Postel ISI February 1988 A Queuing Algorithm to Provide Type-of-Service for IP Links Status of this Memo This memo is intended to explore how
More informationIV. PACKET SWITCH ARCHITECTURES
IV. PACKET SWITCH ARCHITECTURES (a) General Concept - as packet arrives at switch, destination (and possibly source) field in packet header is used as index into routing tables specifying next switch in
More informationCS557: Queue Management
CS557: Queue Management Christos Papadopoulos Remixed by Lorenzo De Carli 1 Congestion Control vs. Resource Allocation Network s key role is to allocate its transmission resources to users or applications
More informationAdvanced Lab in Computer Communications Meeting 6 QoS. Instructor: Tom Mahler
Advanced Lab in Computer Communications Meeting 6 QoS Instructor: Tom Mahler Motivation Internet provides only single class of best-effort service. Some applications can be elastic. Tolerate delays and
More informationEP2210 Scheduling. Lecture material:
EP2210 Scheduling Lecture material: Bertsekas, Gallager, 6.1.2. MIT OpenCourseWare, 6.829 A. Parekh, R. Gallager, A generalized Processor Sharing Approach to Flow Control - The Single Node Case, IEEE Infocom
More informationMultimedia networking: outline
Multimedia networking: outline 9.1 multimedia networking applications 9.2 streaming stored video 9.3 voice-over-ip 9.4 protocols for real-time conversational applications: SIP Skip RTP, RTCP 9.5 network
More informationOutline. EL736 Communications Networks II: Design and Algorithms. Class3: Network Design Modelling Yong Liu 09/19/2006
EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modelling Yong Liu 09/19/2006 1 Outline Examples Basic Problems Routing Restriction 2 1 Example: Intra-Domain Traffic Engineering
More informationDiffServ Architecture: Impact of scheduling on QoS
DiffServ Architecture: Impact of scheduling on QoS Abstract: Scheduling is one of the most important components in providing a differentiated service at the routers. Due to the varying traffic characteristics
More informationQuality of Service in the Internet. QoS Parameters. Keeping the QoS. Leaky Bucket Algorithm
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationNetwork Layer Enhancements
Network Layer Enhancements EECS 122: Lecture 14 Department of Electrical Engineering and Computer Sciences University of California Berkeley Today We have studied the network layer mechanisms that enable
More informationHybrid Optical Switching Network and Power Consumption in Optical Networks
Hybrid Optical Switching Network and Power Consumption in Optical Networks Matteo Fiorani and Maurizio Casoni Department of Information Engineering University of Modena and Reggio Emilia Via Vignolese
More informationEnhancing Bandwidth Utilization and QoS in Optical Burst Switched High-Speed Network
91 Enhancing Bandwidth Utilization and QoS in Optical Burst Switched High-Speed Network Amit Kumar Garg and R S Kaler School of Electronics and Communication Eng, Shri Mata Vaishno Devi University (J&K),
More informationUNIT 2 TRANSPORT LAYER
Network, Transport and Application UNIT 2 TRANSPORT LAYER Structure Page No. 2.0 Introduction 34 2.1 Objective 34 2.2 Addressing 35 2.3 Reliable delivery 35 2.4 Flow control 38 2.5 Connection Management
More informationBROADBAND AND HIGH SPEED NETWORKS
BROADBAND AND HIGH SPEED NETWORKS ATM SWITCHING ATM is a connection-oriented transport concept An end-to-end connection (virtual channel) established prior to transfer of cells Signaling used for connection
More informationCHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL
CHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL Dr. Bhargavi Goswami, Associate Professor head, Department of Computer Science, Garden City College Bangalore. PACKET SWITCHED NETWORKS Transfer blocks
More informationConfiguring QoS CHAPTER
CHAPTER 34 This chapter describes how to use different methods to configure quality of service (QoS) on the Catalyst 3750 Metro switch. With QoS, you can provide preferential treatment to certain types
More informationLS Example 5 3 C 5 A 1 D
Lecture 10 LS Example 5 2 B 3 C 5 1 A 1 D 2 3 1 1 E 2 F G Itrn M B Path C Path D Path E Path F Path G Path 1 {A} 2 A-B 5 A-C 1 A-D Inf. Inf. 1 A-G 2 {A,D} 2 A-B 4 A-D-C 1 A-D 2 A-D-E Inf. 1 A-G 3 {A,D,G}
More informationLecture 24: Scheduling and QoS
Lecture 24: Scheduling and QoS CSE 123: Computer Networks Alex C. Snoeren HW 4 due Wednesday Lecture 24 Overview Scheduling (Weighted) Fair Queuing Quality of Service basics Integrated Services Differentiated
More informationOrder of Packet Transmission and Dropping
LAB 11 Queuing Disciplines Order of Packet Transmission and Dropping OBJECTIVES The objective of this lab is to examine the effect of various queuing disciplines on packet delivery and delay for different
More informationComputer Networks. Instructor: Niklas Carlsson
Computer Networks Instructor: Niklas Carlsson Email: niklas.carlsson@liu.se Notes derived from Computer Networking: A Top Down Approach, by Jim Kurose and Keith Ross, Addison-Wesley. The slides are adapted
More informationSeveral Views for Photonic Internet
Current Status and Future Directions of Photonic s Masayuki Murata Cybermedia Center e-mail: murata@cmc.osaka-u.ac.jp http://www.anarg.jp/ M. Murata Contents Why We Need IP over WDM? Four s of IP over
More informationWhat Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control
Chapter 12 Congestion in Data Networks Effect of Congestion Control Ideal Performance Practical Performance Congestion Control Mechanisms Backpressure Choke Packet Implicit Congestion Signaling Explicit
More informationPerformance Analysis of Storage-Based Routing for Circuit-Switched Networks [1]
Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1] Presenter: Yongcheng (Jeremy) Li PhD student, School of Electronic and Information Engineering, Soochow University, China
More informationImproving QOS in IP Networks. Principles for QOS Guarantees
Improving QOS in IP Networks Thus far: making the best of best effort Future: next generation Internet with QoS guarantees RSVP: signaling for resource reservations Differentiated Services: differential
More informationChapter 6 Queuing Disciplines. Networking CS 3470, Section 1
Chapter 6 Queuing Disciplines Networking CS 3470, Section 1 Flow control vs Congestion control Flow control involves preventing senders from overrunning the capacity of the receivers Congestion control
More informationChapter 6: Congestion Control and Resource Allocation
Chapter 6: Congestion Control and Resource Allocation CS/ECPE 5516: Comm. Network Prof. Abrams Spring 2000 1 Section 6.1: Resource Allocation Issues 2 How to prevent traffic jams Traffic lights on freeway
More informationOptical networking technology
1 Optical networking technology Technological advances in semiconductor products have essentially been the primary driver for the growth of networking that led to improvements and simplification in the
More informationNeed For Protocol Architecture
Chapter 2 CS420/520 Axel Krings Page 1 Need For Protocol Architecture E.g. File transfer Source must activate communications path or inform network of destination Source must check destination is prepared
More informationMultimedia Networking
CMPT765/408 08-1 Multimedia Networking 1 Overview Multimedia Networking The note is mainly based on Chapter 7, Computer Networking, A Top-Down Approach Featuring the Internet (4th edition), by J.F. Kurose
More informationRouter Architectures
Router Architectures Venkat Padmanabhan Microsoft Research 13 April 2001 Venkat Padmanabhan 1 Outline Router architecture overview 50 Gbps multi-gigabit router (Partridge et al.) Technology trends Venkat
More informationComputer Networks. ENGG st Semester, 2010 Hayden Kwok-Hay So
Computer Networks ENGG1015 1 st Semester, 2010 Hayden Kwok-Hay So Where are we in the semester? High Level Applications Systems Digital Logic Image & Video Processing Computer & Embedded Systems Computer
More informationA Preferred Service Architecture for Payload Data Flows. Ray Gilstrap, Thom Stone, Ken Freeman
A Preferred Service Architecture for Payload Data Flows Ray Gilstrap, Thom Stone, Ken Freeman NASA Research and Engineering Network NASA Advanced Supercomputing Division NASA Ames Research Center Outline
More informationComputer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ 1 Lecture 5: Network Layer (cont ) Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall, 2003. 2
More informationChapter 4 Network Layer
Chapter 4 Network Layer Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley, July 2004. Network Layer 4-1 Chapter 4: Network Layer Chapter
More informationMulti Protocol Label Switching
MPLS Multi-Protocol Label Switching Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Network Management and QoS Provisioning - 1 MPLS: introduction
More informationIP Network Emulation
Developing and Testing IP Products Under www.packetstorm.com 2017 PacketStorm Communications, Inc. PacketStorm is a trademark of PacketStorm Communications. Other brand and product names mentioned in this
More informationCongestion Control and Resource Allocation
Congestion Control and Resource Allocation Lecture material taken from Computer Networks A Systems Approach, Third Edition,Peterson and Davie, Morgan Kaufmann, 2007. Advanced Computer Networks Congestion
More informationUltra-Low Latency, Bit-Parallel Message Exchange in Optical Packet Switched Interconnection Networks
Ultra-Low Latency, Bit-Parallel Message Exchange in Optical Packet Switched Interconnection Networks O. Liboiron-Ladouceur 1, C. Gray 2, D. Keezer 2 and K. Bergman 1 1 Department of Electrical Engineering,
More informationComputer Networking. Queue Management and Quality of Service (QOS)
Computer Networking Queue Management and Quality of Service (QOS) Outline Previously:TCP flow control Congestion sources and collapse Congestion control basics - Routers 2 Internet Pipes? How should you
More informationMachine-Learning-Based Flow scheduling in OTSSenabled
Machine-Learning-Based Flow scheduling in OTSSenabled Datacenters Speaker: Lin Wang Research Advisor: Biswanath Mukherjee Motivation Traffic demand increasing in datacenter networks Cloud-service, parallel-computing,
More informationQueuing Disciplines. Order of Packet Transmission and Dropping. Laboratory. Objective. Overview
Laboratory 2 Queuing Disciplines Order of Packet Transmission and Dropping Objective The objective of this lab is to examine the effect of different queuing disciplines on packet delivery and delay for
More informationCMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11
CMPE 150/L : Introduction to Computer Networks Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11 1 Midterm exam Midterm this Thursday Close book but one-side 8.5"x11" note is allowed (must
More informationLecture 3. The Network Layer (cont d) Network Layer 1-1
Lecture 3 The Network Layer (cont d) Network Layer 1-1 Agenda The Network Layer (cont d) What is inside a router? Internet Protocol (IP) IPv4 fragmentation and addressing IP Address Classes and Subnets
More informationFairness, Queue Management, and QoS
Fairness, Queue Management, and QoS 15-441 Fall 2017 Profs Peter Steenkiste & Justine Sherry Slides borrowed from folks at CMU, Berkeley, and elsewhere. YINZ I AM GETTING T-SHIRTS If you TA for me next
More informationCongestion in Data Networks. Congestion in Data Networks
Congestion in Data Networks CS420/520 Axel Krings 1 Congestion in Data Networks What is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet
More informationCore-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. Congestion Control in Today s Internet
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica CMU Scott Shenker Xerox PARC Hui Zhang CMU Congestion Control in Today s Internet Rely
More information