NCSU Institutional Repository >
NC State Theses and Dissertations >
Theses >

Please use this identifier to cite or link to this item: http://www.lib.ncsu.edu/resolver/1840.16/2514

Title: Ingress Rate Control in Resilient Packet Rings
Authors: Thombare, Asavari
Advisors: Michael Devetsikiotis, Committee Member
Paul Franzon, Committee Member
Ioannis Viniotis, Committee Chair
Keywords: ASIC
Metro Network
RPR
Issue Date: 19-Oct-2005
Degree: MS
Discipline: Computer Networking
Abstract: Resilient Packet Ring (RPR) Protocol is becoming popular in Metro Networks due to its rich features. One of these features is the Fairness and Flow Control mechanism. RPR is standardized as IEEE 802.17 and claims that there will be no frame loss inside the network under normal operation. This is achieved through feedback flow control messages. Traffic rate is controlled at the ingress itself based on these messages. We concentrate on the Ingress Rate Control scheme where the local station adds traffic to the ringlet based on the allocated rate limits and FAIR rate limits to achieve fairness in the ring network. The research presented in the thesis tries to achieve three different goals. We implement the Rate Control scheme in software to identify early implementation level issues and then implement it in hardware. We achieve a speed of 10 Gbps with our hardware implementation. We also achieve a full throughput at minimum frame size of 24 bytes. The hardware implementation is tested for compliance with the standard IEEE 802.17. In the simulation study part of the research, we observe the response of individual shapers under compliance testing. We concentrate on the feature of bandwidth reclamation in detail and show that the standard implementation is able to provide bandwidth reclamation under different scenarios. We also study the effect of alternative methods for implementation of Fairness Eligible Shaper. The implementation and simulation parts of the thesis concentrate on the Single Transit Queue Implementation. In the third part we perform analysis of the buffer size requirement under worst case conditions in Dual Transit Queue Architecture. We compare our analysis with the standard and identify various components which affect the buffer size. The buffer size is chosen such that there will be no frame loss due to overflow of the Secondary Transit Queue.
URI: http://www.lib.ncsu.edu/resolver/1840.16/2514
Appears in Collections:Theses

Files in This Item:

File Description SizeFormat
etd.pdf929.36 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.