1 / 1

Networked Software Systems Laboratory Department of Electrical Engineering Technion

Networked Software Systems Laboratory Department of Electrical Engineering Technion. Networked Software Systems Laboratory Department of Electrical Engineering Technion. Networked Software Systems Laboratory Department of Electrical Engineering Technion.

niesha
Download Presentation

Networked Software Systems Laboratory Department of Electrical Engineering Technion

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. Networked Software Systems LaboratoryDepartment ofElectrical EngineeringTechnion Networked Software Systems LaboratoryDepartment ofElectrical EngineeringTechnion Networked Software Systems LaboratoryDepartment ofElectrical EngineeringTechnion Networked Software Systems LaboratoryDepartment ofElectrical EngineeringTechnion Networked Software Systems LaboratoryDepartment ofElectrical EngineeringTechnion Networked Software Systems LaboratoryDepartment ofElectrical EngineeringTechnion Wireless Sensor Network for Tracking the Traffic in Internet Network Routers Project Goals 3 0 • Investigation of existed solutions • Development and implementation of algorithm for improving network performance by using WSN network • Running various parameterized simulations on different network topology with new algorithm • Gathering simulation results, building graphs and compeering VS. regular simulation results 1 2 5 4 The Problem Load Balancing Algorithm - Global What is the problem? • Performs for all stations simultaneously pereodicly • Counting the shortest path from source to destination by Bellman-Ford algorithm for SPT • For each path in the SPT: if the last node is a destination of the root in routing table then calculate the load on current path and on the new path • Update this path by changing an old one by new one: • add new edges • move edges that are not used by other flows that don’t contain the first station of old path. Load Balancing Flow: 0->3, QS=4, ST=0.5 Complicated Simulation Flow: 0->4, QS=4, ST=0.5

More Related