Ant-link Agents for Load Balancing in Telecommunications Networks

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Costas Busch Louisiana State University CCW08. Becomes an issue when designing algorithms The output of the algorithms may affect the energy efficiency.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Ant Colony Optimization An adaptative nature inspired algorithm explained, concretely implemented, and applied to routing protocols in wired and wireless.
The Antnet Routing Algorithm - A Modified Version Firat Tekiner, Z. Ghassemlooy Optical Communications Research Group, The University of Northumbria, Newcastle.
Routing Strategies Fixed Routing
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture XVII: Distributed Systems Algorithms Inspired by Biology.
TCP over ad hoc networks Ad Hoc Networks will have to be interfaced with the Internet. As such backward compatibility is a big issue. One might expect.
Investigation of antnet routing algorithm by employing multiple ant colonies for packet switched networks to overcome the stagnation problem Firat Tekiner.
Ants-based Routing Marc Heissenbüttel University of Berne
CMPT Dr. Alexandra Fedorova Lecture XVII: Distributed Systems Algorithms Inspired by Biology.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.
Transportation, Assignment, Network Models
TUDelft Knowledge Based Systems Group Zuidplantsoen BZ Delft, The Netherlands Roland van der Put Léon Rothkrantz Routing in packet switched networks.
Swarm Intelligent Networking Martin Roth Cornell University Wednesday, April 23, 2003.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
Algorithms for Self-Organization and Adaptive Service Placement in Dynamic Distributed Systems Artur Andrzejak, Sven Graupner,Vadim Kotov, Holger Trinks.
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
The Research of Applying Random Early Blocking strategy to Dynamic Lightpath Routing National Yunlin University of Science & Technology.
Internet Traffic Engineering by Optimizing OSPF Weights Bernard Fortz (Universit é Libre de Bruxelles) Mikkel Thorup (AT&T Labs-Research) Presented by.
From Natural to Artificial Systems mohitz, bhavish, amitb, madhusudhan
Mediamatics / Knowledge based systems Dynamic vehicle routing using Ant Based Control Ronald Kroon Leon Rothkrantz Delft University of Technology October.
NTU GICE Swarm Intelligence for Routing in Communication Networks Speaker: Shih-Chun Lin Advisor: Kwang-Cheng Chen.
Multicast Routing in Mobile Ad Hoc Networks (MANETs)
Wireless Access Research Congestion Avoidance in Source Routed Ad-Hoc Networks Bryan Hogan, Michael Barry, Ronan Skehill, Sean McGrath
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
Some questions about multipath Damon Wischik, UCL Trilogy UCL.
Vishal Jain, AntNet Agent Based Strategy for CMDR “Agent Based Multiple Destination Routing ”
AntNet: A nature inspired routing algorithm
Heuristic Methods for Topological Design of Telecommunication Networks Andrzej Mysłek, Piotr Karaś Institute of Telecommunications Warsaw University of.
به نام خدا سيد عليرضا كارداني مجتبي اميرخاني Path Set Selection in Mobile Ad Hoc Networks زمستان 1382.
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
GridNets 2006 – October 1 st Grid Resource Management by means of Ant Colony Optimization Gustavo Sousa Pavani and Helio Waldman Optical Networking Laboratory.
M ulti m edia c omputing laboratory Biologically Inspired Cooperative Routing for Wireless Mobile Sensor Networks S. S. Iyengar, Hsiao-Chun Wu, N. Balakrishnan,
A Standard Measure of Mobility for Evaluating Mobile Ad Hoc Network Performance By Joseph Charboneau Karthik Raman.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Draft-deoliveira-diff-te-preemption-02.txt J. C. de Oliveira, JP Vasseur, L. Chen, C. Scoglio Updates: –Co-author: JP Vasseur –New preemption criterion.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
William Stallings Data and Computer Communications
Confluent vs. Splittable Flows
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
A comparison of Ad-Hoc Routing Protocols
Routing.
Routing in Wireless Ad Hoc Networks by Analogy to Electrostatic Theory
Lecture XVII: Distributed Systems Algorithms Inspired by Biology
Firat Tekiner (Phd Student) Z. Ghassemlooy
Dewan Tanvir Ahmed and Shervin Shirmohammadi
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Distributed P2P File System
Data and Computer Communications
   Storage Space Allocation at Marine Container Terminals Using Ant-based Control by Omor Sharif and Nathan Huynh Session 677: Innovations in intermodal.
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Overview of SWARM INTELLIGENCE and ANT COLONY OPTIMIZATION
and 6.855J Flow Decomposition
Routing.
Chapter-5 Traffic Engineering.
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. I propose ‘extent of resource pooling’
Routing.
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

Ant-link Agents for Load Balancing in Telecommunications Networks Nathan Lindle Xiaofeng Tao Based on the paper by Ruud Schoonderwoerd, Owen Holland, and Janet Bruten

The Problem Congested network is causing dropped calls and disconnects. Surges in demand from certain areas makes the location of congestion unpredictable.

Load Balancing Large telecommunications networks require distribution of calls across all nodes for improved efficiency Two general categories - Pre-specified routing - Dynamic routing

Appleby/Steward Agents Original Mobile Agent System Load management agents launch from a source node and report the best route from every node to the source node Parent agents measure network congestion and distribute load management agents accordingly

Maybe Ants Could do Better The system is expensive and is based mostly in AI and heuristics An ant system needs to simulate the pheromones that ants drop without using too many system resources. They can alter the routing tables of each node based on the age of the ants.

Probabilistic Decision Making The routing tables are altered with the formula Then the entries are normalized by taking 5% noise model added

Finding the Shortest Paths Using this system, a simulation was run to test if the ants could find the shortest path for a given network.

Adding Congestion Increasing the ants age was found to be the best way to take congestion into account. Keeping the ants at one site has another subtle effect

Improved Appleby/Steward Eliminating circular routes by updating routes only in the direction of the source node and having each node contain at most one agent Eliminating excessively long routes by creating a bias for shorter routes

Simulation Each node is issued a demand weight from .01 to .07 which is then normalized (simulates random call distribution) Each node has a call capacity of 40 calls Links between nodes have unlimited capacity

Experiment The system was tested first without changing the distributions

Experiment Cont. They then tested the system with changing distributions.

Conclusion The paper concludes by saying that further study is being conducted to find out if this system will work with an actual network and how it deals with failure. Questions?