1. The Computer Communication Lab (236340) Winter 2004 - 2005 Resilient Packet Ring GUI Simulator Developed By: Anton Spirkov 312104078spirkova@t2 Slava Olekh304572225slava161@t2 Ziv Rabizanovich304639396szorikr@t2

2. Introduction

3.  RPR uses a bi-directional dual ring topology.  The rings are referred as “inner” and “outer”.  On the outer ring the data is transmitted clockwise and on the inner anticlockwise.  Each station has two neighbors, to one of them the station transmits on the inner ring and to the other on the outer. From one it receives transitions on outer ring and from the other on inner.

4. Outer Ring Inner Ring 1 2 3 4

5. Protection Switching and Traffic Wrapping (IPS)

6.  IPS allows the ring to automatically and rapidly recover from a fiber facility or node failure by wrapping traffic around the failure.  Nodes adjacent to the failure wrap the ring to restore the ring from the failure.  On the following topology discovery procedure the stations will discover the wrap and supersede their ARP data as will be described in the topology discovery algorithm.

7. Topology Discovery

8.  Each node on the ring periodically sends out topology discovery packets on the outer ring.  Stations receiving the topology discovery packet append their MAC binding information and indication whether the station is wrapped.

9.  Once the packet is updated it is passed along to the next station on the ring.  If there is a ring wrap, the topology discovery packet follows the wrap, and the packet is not updated until it comes out of the wrap and returned to the outer ring.  When the topology discovery packet returns to the source station on the outer ring, it is stripped from the ring and the received topology map is extracted.

10.  Upon receiving two consecutive topology maps that are identical the node updates its topology map with the new received one.  The saved topology map is used by the ARP protocol, which will be described later, using which the station determines on what ring to send data to each station.  Each time the topology map is changed the ARP data is flushed.

11. Example 1 Station 1 sends topology discovery. There are no wraps.

12. 1 2 3 4 Topology Discovery Message MAC = 2 not wrapped Topology Discovery Message MAC = 2 not wrapped MAC = 3 not wrapped Topology Discovery Message MAC = 2 not wrapped MAC = 3 not wrapped MAC = 4 not wrapped

13. Example 2 Station 1 sends topology discovery. There is a wrap between station 3 and 4.

14. 1 2 3 4 Topology Discovery Message MAC = 2 not wrapped Topology Discovery Message MAC = 2 not wrapped MAC = 3 wrapped Topology Discovery Message MAC = 2 not wrapped MAC = 3 wrapped MAC = 4 wrapped Topology Discovery Message MAC = 2 not wrapped MAC = 3 wrapped Topology Discovery Message MAC = 2 not wrapped MAC = 3 wrapped

15. ARP

16.  The station uses an ARP information to determine on which ring to send messages to each of the stations.  When a station wants to send a message to other station it checks if it has ARP information for the target station.  If there is ARP information, the station sends the message on the ring stated in the ARP information.

17.  Otherwise it generates an ARP request message and sends it on a random ring, when in the message stated the IP of the target station and broadcast MAC address is used.  Each station receiving ARP request checks the target IP, and if does not match the station’s IP the message is forwarded on the same ring.  When the message reaches the target station, the station generates an ARP response message.

18.  The station checks its topology map and determines on what ring it is shorter to send the response and sends it on that ring.  The ARP initiating station receives the response and adds to the saved ARP information the opposite ring to the ring the response was received on, as the ring to send messages to the target station.  When a topology map is changed the ARP data is flushed.

19. Example Station 1 wants to send data message to station 4 but does not have the ARP information for it.

20. 1 2 3 4 ARP Request Message From MAC 1 To IP 4 ARP Request Message From MAC 1 To IP 4 ARP Request Message From MAC 1 To IP 4 ARP Response Message From IP 4 To MAC 1 Data Message From MAC 1 To MAC 4

21. SRP Fairness Algorithm (SRP-fa)

22. The fairness algorithm tries to accomplish:  Global Fairness: Each node on the ring gets its fair share of the ring bandwidth by controlling the rates at which packets are forwarded onto the ring from upstream or downstream sources in relation to packets that are sourced by the node. The goal is to ensure that misbehaving neighbors cannot act as bandwidth hogs, creating either node starvation or excessive delay conditions.

23.  Local Optimization: This ensures that nodes on the ring maximally leverage the spatial reuse properties of the ring so that they can utilize more than their fair share on local ring segments as long as other nodes are not adversely impacted due to traffic locality.

24.  Each station executes SRP_fa for each of the rings (inner and outer).  When congestion is detected, meaning the transit buffer depth is bigger than a defined threshold, the station sends Usage message on the opposite ring with its usage (amount of transmitted data in bytes).  The value of usage sent in the message also depends on the value received in the Usage messages from upstream nodes.

25.  If the station is not congested it sends either NULL_USAGE or a usage of the upstream nodes if he still forwards a big amount of data (more than specified threshold).  When the node receives usage that is not NULL_USAGE it updates allowed_usage variable that influence the decision whether the node will transit or transmit data.

26.  When the allowed_usage value is low the node will give priority to transited data.  When the allowed_usage value is high the node will give priority to his own data.

27. CYAN – DATA MESSAGE YELLOW – TOPOLOGY DISCOVERY MESSAGE BLUE – ARP MESSAGE DARK BLUE – ARP RESPONSE MESSAGE DARK YELLOW – USAGE MESSAGE GUI Message Colors