1 / 29

SRP Algorithm Simulation

SRP Algorithm Simulation. By: Andrey Klinger Michael Gustus Evgeny Muzikantov Supervisor: Itai Dabran. Introduction. Introduction.

flo
Download Presentation

SRP Algorithm Simulation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SRP Algorithm Simulation By: Andrey Klinger Michael Gustus Evgeny Muzikantov Supervisor: Itai Dabran

  2. Introduction

  3. Introduction The Spatial Reuse Protocol (SRP) was developed by Cisco for use with ring-based media. It derives its name from the spatial reuse properties of the packet handling procedure. SRP is the underlying technology used in the Cisco Dynamic Packet Transport (DPT) family of products.

  4. Introduction SRP uses a bidirectional dual counter-rotating ring topology. The rings are referred to as "inner" and "outer". Both rings are concurrently utilized for transporting data and SRP control packets.

  5. Introduction Protocol qualities • Support of priority traffic • Fairness among nodes using the ring (not implemented in this project) • Support for ring based redundancy, like wrap • Scalability across a large number of nodes attached to a ring

  6. Goals

  7. Goals • Our main goal was to learn the SRP protocol and implement it over UDP.

  8. Goals Protocol implementation tasks: • Basic node functionality that includes Layer2 accounting and SRP high/low priority queues. • Ring topology discovery. • Ring selection algorithm and wrap recovery.

  9. Implementation

  10. Implementation The project consists of 2 programs: • Node program • Master program

  11. Implementation The Node • Sends and receives data packets over wrapped/unwrapped rings. • Sends and receives topology packets. • Unicast and Multicast sending. • Gathering statistics of it’s behavior.

  12. Implementation The Node consists of 3 modules: • Hardware emulation module Layer-2 senders, receivers and buffers. • Software emulation module Layer-3 sender/receiver, topology discovery. • Testing module Generates traffic according to some schema. Log performance and draw graphs.

  13. Implementation

  14. Implementation User Interface

  15. Implementation The Node provides different info about itself: • Topology log • Layer-2 Sender and Receiver logs • Statistics log • Errors log

  16. Implementation Master Provides simple, user-friendly, graphic interface to control the ring character-istics and its state. Used to set network parameters before and during simulation. • Connects between nodes. • Changes the throughput of the ring. • Changes the topology request timeout for the nodes.

  17. Implementation User Interface

  18. The user guide

  19. The user guide There are 2 work modes available: • Master mode. Network with Master. All simulator options are available in this mode. • Node mode. Network without Master. Some options are not available.

  20. The user guide 1.1 Adding nodes to network • Run Node application on any computer you want to run it on. The following window appears:

  21. The user guide 1.2 In Master mode • After you added all the nodes you wanted to the network, the Master screen will show something like this: Connect

  22. The user guide 2.0 Starting simulation • In Master mode click Actions | Run , or if you didn't connect yet: Action | Connect & Run or just press the "GO" button

  23. The user guide 3.0 Choosing testing scheme • You can let the network run as it is, with just occasional topology packets being sent. • You can specify a sending scheme for each node. • You can give all node same scheme file by opening it at Master (the file can still specify different schemas for each Node).

  24. The user guide 3.1 Scheme file format

  25. The user guide 4.0 Viewing graphs 6 graphs are shown on each Node: • Left sender and right sender. • Transmit left low & Transmit right low buffers. • Transit 2left low buffer & Transit 2right low buffers.

  26. Changing network options

  27. Changing network options Forcing wrap • In Master mode, double click on a link. It will change link status from Connected (bold green) to Wrapped (dashed red). To remove wrap, double click on the link again.

  28. Changing network options Master Options • Throughput Limit throughput of each link to given amount of bytes/second. • Topology timeout The time, Node will wait for any topology packet before generating its own, is a random number distributed uniformly between given timeout, and given timeout times 2.

  29. And now… Lets see some SRP in action…

More Related