Vishal Jain, 200411029 1.1 AntNet Agent Based Strategy for CMDR “Agent Based Multiple Destination Routing ”

Slides:



Advertisements
Similar presentations
Universidade do Minho A Framework for Multi-Class Based Multicast Routing TNC 2002 Maria João Nicolau, António Costa, Alexandre Santos {joao, costa,
Advertisements

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Data and Computer Communications
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
1 Asian Institute of Technology May 2009 MULTI-CONSTRAINED OPTIMAL PATH QUALITY OF SERVICE (QoS) ROUTING WITH INACCURATE LINK STATE INFORMATION AIT Master.
The Antnet Routing Algorithm - A Modified Version Firat Tekiner, Z. Ghassemlooy Optical Communications Research Group, The University of Northumbria, Newcastle.
2001 Winter CS215 Course Project Simulation Comparison of Routing Algorithms for Multicast with Bandwidth Reservation Zhihong Duan
Mobile Agents for Adaptive Routing Presented by Hong-Jiun Chen & Manu Prasanna Gianni Di Caro & Marco Dorigo.
© nCode 2000 Title of Presentation goes here - go to Master Slide to edit - Slide 1 Reliable Communication for Highly Mobile Agents ECE 7995: Term Paper.
Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints 晏廷.
Algorithms for Precomputing Constrained Widest Paths and Multicast Trees Paper by Stavroula Siachalou and Leonidas Georgiadis Presented by Jeremy Witmer.
Investigation of antnet routing algorithm by employing multiple ant colonies for packet switched networks to overcome the stagnation problem Firat Tekiner.
Algorithms for Precomputing Constrained Widest Paths and Multicast Trees Paper by Stavroula Siachalou and Leonidas Georgiadis Presented by Jeremy Witmer.
1 A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm Quan Sun and Horst Langendorfer Telecommunication Systems Journal, vol.11, p.47~58,
Multicast Routing in ATM Networks with Multiple Classes of QoS Ren-Hung Hwang, Min-Xiou Chen, and Youn-Chen Sun Department of Computer Science & Information.
LPT for Data Aggregation in Wireless Sensor networks Marc Lee and Vincent W.S Wong Department of Electrical and Computer Engineering, University of British.
Bluenet a New Scatternet Formation Scheme * Huseyin Ozgur Tan * Zifang Wang,Robert J.Thomas, Zygmunt Haas ECE Cornell Univ*
Path Protection in MPLS Networks Using Segment Based Approach.
Routing.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 21 Introduction to Computer Networks.
TUDelft Knowledge Based Systems Group Zuidplantsoen BZ Delft, The Netherlands Roland van der Put Léon Rothkrantz Routing in packet switched networks.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Multicast Communication Multicast is the delivery of a message to a group of receivers simultaneously in a single transmission from the source – The source.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Roadmap-Based End-to-End Traffic Engineering for Multi-hop Wireless Networks Mustafa O. Kilavuz Ahmet Soran Murat Yuksel University of Nevada Reno.
AntNet: Distributed Stigmetric Control for Communications Networks Gianni Di Caro & Marco Dorigo Journal of Artificial Intelligence Research 1998 Presentation.
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
Self-Organizing Agents for Grid Load Balancing Junwei Cao Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04)
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Mediamatics / Knowledge based systems Dynamic vehicle routing using Ant Based Control Ronald Kroon Leon Rothkrantz Delft University of Technology October.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Swarm Computing Applications in Software Engineering By Chaitanya.
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
Discrete optimization of trusses using ant colony metaphor Saurabh Samdani, Vinay Belambe, B.Tech Students, Indian Institute Of Technology Guwahati, Guwahati.
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,
A Novel Multicast Routing Protocol for Mobile Ad Hoc Networks Zeyad M. Alfawaer, GuiWei Hua, and Noraziah Ahmed American Journal of Applied Sciences 4:
Evaluation of the XL Routing Algorithm in Multiple Failure Conditions Nguyen Cao Julie Morris Khang Pham.
Serverless Network File Systems Overview by Joseph Thompson.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
A Multicast Mechanism in WiMax Mesh Network Jianfeng Chen, Wenhua Jiao, Pin Jiang, Qian Guo Asia-Pacific Conference on Communications, (APCC '06)
Routing and Routing Protocols
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
Optimizing Pheromone Modification for Dynamic Ant Algorithms Ryan Ward TJHSST Computer Systems Lab 2006/2007 Testing To test the relative effectiveness.
AntNet: A nature inspired routing algorithm
Peer to Peer Network Design Discovery and Routing algorithms
Static Process Scheduling
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
COS 420 Day 15. Agenda Finish Individualized Project Presentations on Thrusday Have Grading sheets to me by Friday Group Project Discussion Goals & Timelines.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
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,
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Confluent vs. Splittable Flows
Firat Tekiner (Phd Student) Z. Ghassemlooy
ECE 544 Protocol Design Project 2016
Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.
PRESENTATION COMPUTER NETWORKS
Presentation transcript:

Vishal Jain, AntNet Agent Based Strategy for CMDR “Agent Based Multiple Destination Routing ”

Vishal Jain, AntNet Agent Based Strategy for CMDR Goals and Non-Goals Goals  To see how simulation helps in studying a system?  To see, with an example of AntNet Multicasting, how modeling is done?  To see how by changing system configuration we can study system in better way?  To see how to validate your new idea with the help of simulation? Non Goals  To study computer network routing in details  To see other algorithm for multicasting.

Vishal Jain, AntNet Agent Based Strategy for CMDR Steps in Sound Simulation

Vishal Jain, AntNet Agent Based Strategy for CMDR Formulating the Problem:1 Warm up……  What is computer network?  Modeling network as graph  What is routing between network nodes?  What we wish to achieve in routing?  A new approach to routing : Multicasting….  Is multicasting is same as multiple point to point routing?

Vishal Jain, AntNet Agent Based Strategy for CMDR Example

Vishal Jain, AntNet Agent Based Strategy for CMDR Formulating the Problem:2 Problem statement  Let T(s,D) is a tree rooted at source node s with a set of destination nodes D.  Find a tree T(s,D), if it exists, which satisfies the following optimization problem min(cost(T))  Delay(P T (s,di)) <= delta for each destination  Bandwidth of each link included in tree must be greater than B.  | Delay(P T (s,di)) - Delay(P T (s,dj)) | <= del for each pair of destination.

Vishal Jain, AntNet Agent Based Strategy for CMDR How Ants Works To find Shortest Path Advantages: 1.Distributed in nature 2.No direct communication is required among agents 3.Robust and adaptive to changes

Vishal Jain, AntNet Agent Based Strategy for CMDR Study and Modelling Study of “A New Intelligent Agent Based Strategy for Constrained Multiple Destination Routing Problems”, David Elliman and Sherin M. Youssef. The computer Journal, BCS Jan Paper Model + True Distributive Approach = New Paper

Vishal Jain, AntNet Agent Based Strategy for CMDR Brief Conceptual Model of Paper The forward agent colony searches for the target node it stores path as well as cost of path. At the destination(s) total tree cost is calculated and then corresponding amount of pheromone is updated at each traversed node in forward journey. This task is done by the backward agent NodeCost Curr Path Delay Start Node Selection Pool & Decision ABAB

Vishal Jain, AntNet Agent Based Strategy for CMDR Is conceptual model Valid?: No Why?  Global Locking  Cycle avoiding New Conceptual Model (Novel Idea © )  Each node will be having information about which colony has visited it already along with the information from where it arrived to this node. It helps in cycle avoiding as well as agents need not to be LOCKED. Example:

Vishal Jain, AntNet Agent Based Strategy for CMDR Program Structure:The Network

Vishal Jain, AntNet Agent Based Strategy for CMDR Program Structure:Node

Vishal Jain, AntNet Agent Based Strategy for CMDR Make Pilot Run

Vishal Jain, AntNet Agent Based Strategy for CMDR Tree Cost

Vishal Jain, AntNet Agent Based Strategy for CMDR Queue at Nodes

Vishal Jain, AntNet Agent Based Strategy for CMDR Comparison & Conclusion

Vishal Jain, AntNet Agent Based Strategy for CMDR

Vishal Jain, AntNet Agent Based Strategy for CMDR Successes & Failures Successes  Desired size topology can be constructed at runtime  Any value of alpha, beta, gama, delta, del can be given  Excellent visualization  Results are accurate again Failure  Couldn’t able to separate data and ant generator  Traffic move as random not as per the routing table as it moves in the real network.  Note: But to check the feasibility of my idea these assumptions are ok

Vishal Jain, AntNet Agent Based Strategy for CMDR Write Computer Program and Verify…… Used OMNet++ as a tool…..  Confidence in tool ?  Do tool support real life scenario for the simulation ?  Degree of insight it gives for the model you are programming…  Support for development (manual, community site, mailing list etc)….. Developed an application….

Vishal Jain, AntNet Agent Based Strategy for CMDR Index Conceptual Framework Black Box Model Understanding Simulation Run Queuing Models and Results

Vishal Jain, AntNet Agent Based Strategy for CMDR Model

Vishal Jain, AntNet Agent Based Strategy for CMDR General Node Model

Vishal Jain, AntNet Agent Based Strategy for CMDR

Vishal Jain, AntNet Agent Based Strategy for CMDR Black Box Model Queuing Model Stops by statistical data Arrival Rate Service Rate Num Of Server System Capacity Server Busy Time Mean Q Length Mean Life Time in System Dropped Customer Number of Customers Mean Number of customer present in system Mean P[ i ]

Vishal Jain, AntNet Agent Based Strategy for CMDR Features of Implementation The server is selected for service on the basis of idle time FreeServerList[] Two way send() Methods isEmpty(), recordReq(), Request() Stop by statistical information Generalized Very accurate results

Vishal Jain, AntNet Agent Based Strategy for CMDR M/M/1 1/ = /  = C=1 System Capacity = inf Lq =.2474 Lq =.24666

Vishal Jain, AntNet Agent Based Strategy for CMDR Graph of Mean Q Length

Vishal Jain, AntNet Agent Based Strategy for CMDR M/M/1/N 1/ = /  = 0.05 C=1 System Capacity = 4 ParamBookSimulation Lq Ls Wq Ws Server Busy Time p

Vishal Jain, AntNet Agent Based Strategy for CMDR Busy Server status

Vishal Jain, AntNet Agent Based Strategy for CMDR M/M/C 1/ = /  = C=4 System Capacity = inf ParamBookSimulation Lq Ls Wq Ws Server Busy Time p What if only three servers are there?

Vishal Jain, AntNet Agent Based Strategy for CMDR M/M/C 1/ = /  = C=3 System Capacity = inf ParamSimulation NewSimulation-old Lq Ls Wq Ws Server Busy Time p

Vishal Jain, AntNet Agent Based Strategy for CMDR Graph

Vishal Jain, AntNet Agent Based Strategy for CMDR M/M/C/N 1/ = /  = C=3 System Capacity = 6 ParamBookSimulation Lq Ls Wq Ws Server Busy Time p

Vishal Jain, AntNet Agent Based Strategy for CMDR M/M/C/C 1/ = /  = C=4 System Capacity = 4 ParamAppletSimulation Lq00 Ls Wq00 Ws Server Busy Time p

Vishal Jain, AntNet Agent Based Strategy for CMDR M/M/inf 1/ = /  = C=inf System Capacity = inf ParamAppletSimulation Lq00 Ls Wq00 Ws Server Busy Time p

Vishal Jain, AntNet Agent Based Strategy for CMDR M/M/C without & with priority Q Without PriorityWith Priority S[0]= S[1]= S[3]= S[4]= S[0] = S[1] = S[3] = S[4] = / = /  = C=4 System Capacity = inf

Vishal Jain, AntNet Agent Based Strategy for CMDR Failures INF=150 or more M/M/inf not satisfactory Dynamic module creation was not successful Calling source limit

Vishal Jain, AntNet Agent Based Strategy for CMDR What Next with OMNet++ NoC : Async2005 paper for ASD course SCMDR : Antnet Muticast routing for NO course Quantum Cryptography