a1329_1.pdf OWC3.pdf

QoS Differentiation in OBT Ring Networks with Comparison to RPR Networks Saurav Das, Jaedon Kim, David Gutierrez and L. G. Kazovsky Photonics and Networking Research Laboratory, Stanford University, 058 Packard Building, Stanford, California 94305, USA [email protected]

Ching-Fong Su, Richard Rabbat and Takeo Hamada Fujitsu Labs of America 1240 East Argues Ave., M/S345 Sunnyvale, California, 94085

Abstract: Optical Burst Transport networks employ burst transmission in WDM ring architectures and are promising candidates for MANs. We investigate QoS differentiation in OBT, and compare its performance to IEEE 802.17 Resilient Packet Ring (RPR) Standard. 2006 Optical Society of America

OCIS codes: (060.4250) Networks, (060.4510) Optical communications

1. Introduction Large-scale deployment of WDM/SONET has increased the transmission capacity in metropolitan area networks (MANs). However, as point-to-point connections require each intermediate node to process data, the accumulated delay caused by multiple O/E/O conversions degrades performance in the optical link. The situation is further exacerbated with the need for dynamically allocating bandwidth, due to the advent of user-oriented applications such as real-time video, VoIP, online gaming, and wireless access. Some relief has been brought about by a WDM architecture based on Re-configurable Optical Add-Drop Muxes (ROADMs), whereby the ability to remotely provision a link by a network operator has reduced provisioning times from weeks to a matter of minutes. However, remote provisioning does not imply automatic, on-demand instantaneous bandwidth allocation in response to changes in traffic. An alternative approach to dynamic bandwidth allocation in the Internet core has been proposed via Optical Burst Switching (OBS) [1]. In OBS, the granularity of bandwidth allocation has been changed from lambda to lambda-time. Furthermore sub-lambda traffic grooming and packet aggregation into data bursts at the edge of the network enhance efficiency. An out-of-band control header is first sent to reserve resources and configure switches along the data path, following which the data burst is transmitted (with suitable offset time) and switched alloptically in a bufferless manner at each intermediate node. One of the main problems in OBS is that of burst contention, which arises when an incoming burst contends for resources allocated to one or more scheduled bursts. Due to the bufferless approach, burst contention results in burst loss. Several approaches have been proposed to minimize (but not eliminate) burst loss, and further, they depend on immature optical buffering techniques. With the intention to realize OBS in a real network, we have previously proposed the Optical Burst Transport (OBT) network, which is a scalable and cost-efficient solution for Metro rings [2]. OBT leverages the advantages of OBS and WDM rings, while using a token-based medium access scheme to resolve the OBS contention issue. Recently, we demonstrated the OBT protocol in a 3 node, 2.5 Gbps network testbed [3]. Furthermore, we have enhanced the OBT protocol with spatial reuse property to overcome the inefficiencies of token-based medium access, and also introduced an optical layer protection scheme specifically designed to reduce burst loss during a failure and provide SONET like resiliency [4]. In this paper, we introduce Quality-of-Service (QoS) differentiation in OBT and compare its features and performance to IEEE 802.17 Resilient Packet Ring (RPR), a recent standard for next generation MANs. 2. QoS in OBT QoS differentiation schemes can focus on providing different levels of quality to different Classes of Service (CoS), where the quality could be based on bandwidth guarantees, delay and jitter guarantees and/or loss guarantees. In OBS, the bandwidth guarantees are implicitly provided by supporting the loss guarantees, as the bursts travel from the source to the destinations in all-optical form [5]. Since burst loss is a major factor, OBS provides QoS to different CoS by providing different levels of burst loss. In OBT however, since bursts are never lost, QoS is

a1329_1.pdf OWC3.pdf

provided by varying the levels of delay and jitter and by providing different bandwidth guarantees. In this regard, OBT is very similar to RPR (which also does not drop packets) and as a result, we borrow heavily from the RPR standard in defining the CoS to which QoS differentiation needs to be provided. Specifically, we define 3 CoS termed A, B and C. Class A is meant for high priority - low latency, low jitter traffic (real time), Class B for bounded jitter, near-real time traffic and Class C for best-effort transport. The RPR standard further divides Class A into A0 and A1 and Class B into B-CIR (committed information rate) and B-EIR (excess information rate). In RPR, where all packets are converted from optical to electronic form (O-E) for processing, QoS is provided by having rate controllers / traffic shapers at each node for each add queue (corresponding to a CoS), that limit and smooth the add traffic [6]. Also scheduling of frames from the add and transit traffic is performed such that priority is given to transit traffic (buffered in transit queues) over the add traffic. As shown in Fig. 1(a), single and dual transit queues can be implemented, with the latter giving more flexibility for QoS provisioning, as the transit traffic can now be divided into Primary (PTQ) and Secondary (STQ) queues. Lastly, each packet is converted back from electronic to optical form for transmission on the fiber link. It should be noted here that RPR is a standard that is designed for operation on a single wavelength and as such the maximum bandwidth is limited to the maximum bit rate possible on a single wavelength. On the other hand, in OBT, we provide QoS differentiation by taking advantage of the fact that OBT is inherently based on WDM as shown in Fig. 1(b). One wavelength is reserved for the out-of-band control signal, which is converted (O-E-O) at each node. The other wavelengths are used for data bursts and are transported directly from source to destination in a single hop by employing optical bypass at intermediate nodes. Each node maintains Virtual Output Queues (VOQ) for every other destination node in the network. Further, the VOQs are sub-divided into queues for the 3 different classes as in RPR. Note that the RPR standard leaves VOQ implementation as an option to vendors. The difference is that there are no transit queues in OBT as transit traffic is optically bypassed.

Fig. 1(a) Basic RPR Node structure

Fig. 1(b) OBT Node structure

Bandwidth guarantees are preallocated by provisioning as follows. Class A is reserved bandwidth at a lambda granularity (i.e. 1 or more wavelengths). The lambda is time shared among the nodes but the bandwidth is not reclaimable, i.e. if a node has no Class A traffic destined for the other nodes, it will simply release the token and not use it to send lower priority traffic. Class A allocation can be made more efficient by dividing into subclass A0 and A1, where in the latter case the reserved bandwidth is reclaimable. In this paper however, we ignore the A subclasses. Class B is allocated bandwidth at a sub-lambda granularity corresponding to the CIR and the line rate. For example, if the line rate is 10Gbps shared by 10 nodes, then the time average throughput per node is 1Gbps, even though the instantaneous bandwidth is the full 10Gbps. Then if the CIR is 500 Mbps, Class B is allocated half the predetermined MaxBurstSize. The MaxBurstSize is a parameter that depends on several factors as illustrated in [2]. The EIR is similarly a suitable fraction of the MaxBurstSize. Bandwidth allocated to B-CIR and B-EIR is reclaimable; i.e. if a node does not have enough Class B data to send, it can send Class C data instead. Bandwidth is not allocated for Class C, which is only sent on a sub-lambda opportunistic basis. Delay and jitter differentiation is implemented via different burst assembly algorithms for the different classes. Burst assembly for Class A traffic at a node is time based, for Class B it is length and time based and for Class C is length based. By requiring every node to send Class A traffic when the token for the wavelength reserved for Class A arrives, we bound the delay by the maximum round-trip time around the ring. Since Class B and C share the other wavelengths, we provide bounds in a unique way. When a token arrives for a wavelength designated to Class B and C, the scheduler checks to see if there is enough B and C data to meet the MaxBurstSize. If there is, then the burst is built up with priority given to Class B up to its CIR plus EIR fractions. The rest is filled up with Class C. If there is

a1329_1.pdf OWC3.pdf

not enough traffic, then the scheduler checks to see if another parameter, defined as MaxRoundTrip has been met. The MaxRoundTrip parameter is applicable only to Class B-CIR traffic and is designed to put a bound on the delay for this class. If the number of roundtrips since the last time Class B data was transmitted is equal to MaxRoundTrip, then Class B data is transmitted up to the CIR fraction of the MaxBurstSize. In this way at lower loads, the Class B aggregation happens on a time basis, and at higher loads on a length basis, while Class C is solely on a length basis. 3. Simulation and Discussion We simulated the OBT QoS protocol and the results are presented in Fig. 2. The network comprises of 5 nodes with a total circumference of 200km. We use 3 wavelengths, 1 dedicated to the control channel at a bit-rate of 1.25 Gpbs, and the other 2 for data at 2.5 Gbps. One wavelength is reserved for Class A and the other is shared by Class B and C as described above. MaxBurstSize is 200kB, and MaxRoundTrip is 1. CIR and EIR are both 250 Mbps. Poisson traffic arrival has been used where the data packets take the form of Ethernet frames ranging from 64 to 1518 bytes. Fig. 2(a) shows the average delay performance of our QoS protocol under various network load conditions. Note that Class A and B remain bounded even under high load, while Class C experiences very high delays. Fig. 2(b) presents a 500ms snapshot of the burst delays from Node 1 to Node 3 under two load conditions. Class A has low latency and jitter, while Class B is bounded and Class C has unbounded high jitter. It is worthwhile to mention that the data presented here accounts for propagation as well as queuing delay before the burst enters the ring, unlike in [6] which shows propagation and queuing delay for RPR packets only after they have entered the ring and not the queuing delay in the add queues. Part of the reason is that in RPR there could be queuing delays at every intermediate node, while in OBT there is no queuing once the burst enters the ring, due to optical bypass. In fact, the traffic meant for bypass can be a significant portion (40-60%) of the overall traffic through the node. 20 18

Class A Class B Class C

16

6

5

14

Burst Delay (ms)

Average Delay (ms)

Class A, Load 0.5 Class B, Load 0.5 Class C, Load 0.5 Class A, Load 1.0 Class B, Load 1.0

7

12 10 8 6

4

3

2

4 1

2 0

0

0

0.1

0.2

0.3

0.4

0.5

Load

0.6

0.7

0.8

0.9

Fig. 2 (a) Overall Average Burst Delay vs. Network Load

1

400

450

500

550

600

650

Time (ms)

700

750

800

850

900

Fig 2(b) Burst Delay Node 1 to Node 3

4. Conclusion In this paper, we illustrate a simple QoS protocol for delay, jitter and bandwidth differentiation for three CoS in Optical Burst Transport networks. Simulation results show that we can guarantee bandwidths, while achieving tight bounds on delay and jitter for real time and near real time traffic. Thus we can provide QoS differentiation in OBT, it compares favorably to RPR QoS performance, and overall it is better suited to WDM based network architectures. 5. References [1] [2] [3] [4] [5] [6]

C. Qiao and M. Yoo, “Optical Burst Switching (OBS)-A New Paradigm for an Optical Internet”, Journal of High Speed Networks, 8(1):69– 84, January 1999. Y. Hsueh, J. Kim, L. Kazovsky, C.-F. Su, R. Rabbat and T. Hamada, “Traffic Grooming for WDM Rings Using Optical Burst Transport,” IEEE J. Lightwave Technology, vol. 24, no. 1, pp. 44-53, January 2006. J. Kim, J. Cho, M. Jain, D. Gutierrez, L. G. Kazovsky, C.-F. Su, R. Rabbat, T. Hamada, "Demonstration of 2.5 Gbps Optical Burst Switched WDM Rings Network," Optical Fiber Communication Conference (OFC) 2006, Anaheim, CA, Postdeadline Paper PDP43. S. Das, J. Kim, D. Gutierrez, L. Kazovsky, "Protection and Spatial Reuse in Optical Burst Transport (OBT) Networks," Third International Conference on Broadband Communications, Networks and Systems: Workshop on Optical Burst Switching (WOBS ’06). Q. Zhang, V. Vokkarane, J. Jue, B. Chen, “Absolute QoS Differentiation on Optical Burst-Switched Networks”, IEEE Journal on Selected Areas in Communications, Vol.22, No. 9, Nov. 2004. F. Davik, M.Yilmaz, S. Gjessing, N. Uzun, “IEEE 802.17 Resilient Packet Ring Tutorial”, IEEE Communications Magazine, March 2004.

QoS Differentiation in OBT Ring Networks with ... - CiteSeerX

such as real-time video, VoIP, online gaming, and wireless access. ... hand, in OBT, we provide QoS differentiation by taking advantage of the fact that OBT is.

NAN Sizes 0 Downloads 202 Views

Recommend Documents

QoS Differentiation in OBT Ring Networks with ... - CiteSeerX
such as real-time video, VoIP, online gaming, and wireless access. ... provision a link by a network operator has reduced provisioning times from weeks to a ... in OBT, we provide QoS differentiation by taking advantage of the fact that OBT is.

Intelligent Jamming in Wireless Networks with ... - CiteSeerX
create a denial of service attack. ... Index Terms—Denial of Service, MAC protocol attacks, .... presented in [1] that showed that wireless networks using TCP.

Traffic-Differentiation-Based Modular QoS Localized ...
28 Oct 2010 - reliability is sent. A typical example of such a scenario is patient monitoring in a hospital room, where different health parameters are to be captured and forwarded to health care servers accessible by the medical staff. Traffic is di

Factors Influencing QoS in Mobile Adhoc Networks - IJRIT
Abstract—The major constraint in MANETs is to maintain the Quality of Service. ... Load balancing. This is scenario where, the load traffic is balanced in all the possible routes. Unbalanced network traffic may influence the high power ... followin

Distributed QoS Guarantees for Realtime Traffic in Ad Hoc Networks
... on-demand multime- dia retrieval, require quality of service (QoS) guarantees .... outside interference, the wireless channel has a high packet loss rate and the ...

QoS routing in ad hoc wireless networks
show this improvement. Index Terms—Ad hoc wireless networks, code division multiple ...... degree in the Department of Computer and Infor- mation Science ...

Factors Influencing QoS in Mobile Adhoc Networks - International ...
it is mandatory to maintain and improve the QoS in such networks. In this paper, a survey has been made to ... serious issue, when MANETs are employed in defense and other high end security based networks. Because these compromised ... GLANCE OF VARI

Theory of Communication Networks - CiteSeerX
Jun 16, 2008 - protocol to exchange packets of data with the application in another host ...... v0.4. http://www9.limewire.com/developer/gnutella protocol 0.4.pdf.

Energy proportional datacenter networks - CiteSeerX
Jun 23, 2010 - Finally, based on our analysis, we propose opportunities for ..... package, operating at higher data rates, further increasing chip power.

Energy proportional datacenter networks - CiteSeerX
Jun 23, 2010 - of future network switches: 1) We show that there is a significant ... or power distribution unit can adversely affect service availability.

MARIA: Interference-Aware Admission Control and QoS ... - CiteSeerX
tions, multimedia need QoS support to satisfy user service requirements. ... We use a simple network shown in Figure 1 to demonstrate how interference ...

Theory of Communication Networks - CiteSeerX
Jun 16, 2008 - and forwards that packet on one of its outgoing communication links. From the ... Services offered by link layer include link access, reliable.

A Proportional Fairness Algorithm with QoS Provision in ...
Define channel gain as. Hk,n, total noise power spectral density as Nk,n, and pk,n as ... nications University, Daejon, Korea (email: {dungnt, ynhan}@icu.ac.kr).

Recurrent Neural Networks for Noise Reduction in Robust ... - CiteSeerX
duce a model which uses a deep recurrent auto encoder neural network to denoise ... Training noise reduction models using stereo (clean and noisy) data has ...

Lightweight Routing with QoS Support in Wireless ...
Abstract—Wireless sensor and actor networks (WSANs) can be used ... tions with different quality of service (QoS) requirements. QoS ..... compared to traditional internet routing scenarios. ... less when we compare dropped Interest 2 packets.

QoS in Linux with TC and Filters - GitHub
packet queues with different priorities for dequeueing to the network driver. ... (i.e. deciding which queue a packet should go into) is typically done based on Type Of Service ... (1) # tc qdisc replace dev eth0 root handle 1: htb default 30.

Achieving distributed user access control in sensor networks - CiteSeerX
Achieving distributed user access control in sensor networks. Haodong Wang a,*. , Qun Li b a Department of Computer and Information Science, Cleveland State University, Cleveland, OH 44115, United States b Department of Computer Science, College of W

Deep Neural Networks for Acoustic Modeling in Speech ... - CiteSeerX
Apr 27, 2012 - data that lie on or near a non-linear manifold in the data space. ...... “Reducing the dimensionality of data with neural networks,” Science, vol.

Cross Layer Self-Healing Mechanisms in Wireless Networks - CiteSeerX
Abstract1. The use of wireless mobile ad-hoc networks (MANETs) has gained rapid ... neighboring sensor element B may be able to service the request.

Deep Neural Networks for Acoustic Modeling in Speech ... - CiteSeerX
Apr 27, 2012 - origin is not the best way to find a good set of weights and unless the initial ..... State-of-the-art ASR systems do not use filter-bank coefficients as the input ...... of the 24th international conference on Machine learning, 2007,

Key Management in IP-based Ubiquitous Sensor Networks - CiteSeerX
corresponding elliptic curve Diffie-Hellman and Digital Signature Algorithm. 6.3.1 Elliptic ... public key signature and verification respectively. This gives us a ...

Key Management in IP-based Ubiquitous Sensor Networks - CiteSeerX
For example, one laptop can easily disrupt the communication of several sensor nodes by ... the sensors, and the malicious node can take control over them [10].

QoS Routing for Wireless Ad Hoc Networks: Problems ...
Quality of service (QoS) provisioning is becoming a critical issue in designing wireless ad hoc net- works due to the necessity of providing multime- dia applications in such networks. These applications are typically delay-sensitive and have high ba