Simulation and Analysis of Node Scheduling Schemes in IEEE ۸۰۲.۱۷ Standard

The Resilient Packet Ring (RPR) architecture, known as the IEEE ۸۰۲.۱۷ standard, has received attention in the last year. The Priority Queue (PQ) algorithm is recommended as the scheduling scheme for RPR, which always gives priority to the transit buffer. Using this scheduling scheme in RPR, the high priority traffic, such as video packets waiting to access the ring at congested node in the transmit buffer, suffer large delays and unsteady delay jitters. In this, we propose new scheduling schemes base on Deficit Round-Robin (DRR) algorithm and compare it with the original schemes. To assess the efficiency of the system we simulate the network with ۱۰ node attachments in the OPNET simulator and consider the efficiency of the new scheme. Using this scheme, the QoS of traffic transmission on the congested node can be significantly improved. Real time video traffic can benefit from such schemes.

Keywords:

Resilient Paket Ring , en , Scheduling Schemes , IEEE ۸۰۲.۱۷