RAM BIST

1
Spring 2004
Supervisor Gregory Mironov Presented
by Zhitinsky Mark Gorenshteyn Dmitry
2
Motivation (1)

• Multimedia, business, video-streaming and other
  performance critical application became popular
  lately.
• The existing network cant provide a reliable
  service to those applications the existing
  packet lost probability is making usage of those
  applications possible only in very light loaded
  networks.
• The only, partially implemented, solution is to
  probe a single shortest path for the link
  establishment.

3
Motivation (2)

• There were proposed a number of algorithms for
  QoS routing using different techniques.
• Our aim is to write simulator in C and using it
  to compare those algorithms.
• We also compare the difference of implementation
  of the simulator. The previous one, implemented
  in Java (from the previous project) is compared
  to the new one that will be implemented in C.

4
Reference And Proposed Algorithms

• Proposed Algorithms
• Ellipse
• Multiple Paths
• Backward Reservation
• Reference Algorithms
• Shortest Path
• Ideal

5
Ellipse Approach

• The Source node broadcasting the probes in
  restrected area.
• Every node performs BW reservation and forewords
  the probe message to all its permitted neighbors
  in such way that the hop count will not exceed
  the defined maximum hop-count.
• Permitted neighbors
• There is enough BW to allocate.
• The neighbor is inside the restricted area.
• Each probe collects the path and the first probe
  that reached the destination is wins.

6
Ideal reference

• Is Ellipse approach that has zero-time messages
  transmissions.
• Doesnt suffer from the probing interference.

7
Multiple Paths Approach

• The algorithm performs Source Routing by multiple
  routes using Max-Flow algorithm.
• The routes are calculated at the Source node with
  restriction to maximum hop count.
• The maximum number of multiple routes is equal to
  number of Source's neighbors.
• The probe messages are sent through the routes
  toward the destination and the first one wins.

8
Shortest Path Reference

• The existing approach.
• Only single path is checked.
• Our approach is expected to provide better
  performance.
• Used in all existing commercial approaches.

9
Backward Reservation Approach

• The probe massages does not perform reservation.
• The probes forwarding algorithm is like in
  Ellipse.
• The path has been build in the way back on each
  node.

10
Project Results
11
Project Results - Continue
12
Project Results - Continue
13
Java vs. C

• No Operator Overloading
• Single Inheritance
• No Implicit Type Conversion.
• Flexible
• Dynamic Memory Management
• Programming Easy
• Rich Standard Libraries
• Slow
• Programmer Protection

• Operator Overloading
• Multiple Inheritance
• Implicit Type Conversion
• Must Recompile For New Hardware
• No Automatic Memory Management
• Programming Difficult
• No Graphics Libraries
• Fast
• Standard Not Implemented