Essay Instructions: I have a lot of references, study material on atnet routing.
In the note which I have sent earlier I have not given the details of thesis.I am giving now a little bit.I am giving here the title of the paper and the abstract with which you can proceed furter.You can change it,you can modify it or you can use the title as it is also.It's upto you.I can send you the details and the references of the websites also.So first tell me how to proceed further .To whom I have to send this information etc.
Pattern of Generation, Decay & Updating of Routing Tables by Using Historical Data in Software Agents.
Abstract: Antnet is a new agent based adaptive & distributed routing algorithm for packet routing in communication networks. Although, an ant is a simple creature, collectively a colony of ants (nothing but software agents) performs useful tasks such as collecting information and finding the shortest path to food source and sharing this information with other ants by depositing pheromone. In the first part of the paper, a new pattern for generation and decay of the software agents is proposed. In the second part of the paper, the historical data collected about each route's trip time and the way this data is used to update the routing tables is discussed.
Keywords: Routing, Antnet, Reinforcement learning, Ant algorithm, Adaptive routing
http://www.idsia.ch/~gianni/my_publications.html
http://www.aco-metaheuristic.org/
1."Ant Algorithms", Special Issue on Future Generation Computer
Systems (FGCS) , Vol. 16, N. 8, 2000
2."AntNet: Distributed Stigmergetic Control for Communications
Networks" (reprinted by permission from JAIR), Vivek, A Quarterly in
Artificial Intelligence, Vol. 12(3-4), Pag. 2-37, 1999.
3."Ant Algorithms for Distributed Discrete Optimization" , Artificial
Life, Vol. 5, N. 2, 1999.
4."AntNet: Distributed Stigmergetic Control for Communications
Networks", Journal of Artificial Intelligence Research (JAIR), Vol. 9,
Pag. 317-365, 1998.
5.., "Toward the formal foundation of Ant Programming", Ant Algorithms
- Proceedings of ANTS 2002, Third International Workshop on Ant
Algorithms, Brussels, Belgium, September 12-14, 2002, Lecture Notes in
Computer Science Vol. 2463, Springer-Verlag, 2002.
6.., "Ant-SELA: Ant-agents and stochastic automata learn adaptive
routing tables for QoS routing in ATM networks", ANTS'2000 - From Ant
Colonies to Artificial Ants: Second International Workshop on Ant
Algorithms, Brussels, Belgium, September 8-9, 2000
I am providing some more sites, kindly update the order
The main people involved in research of Antnet are
Marco Dorigo
Gianni Di caro(Toward the Formal Foundation of Ant Programming) This can be used as reference
Luca M.Gambardella
Benjamin Baran(Improved Antnet Routing)
F.Tekiner
Tony White(Routing With Swarm Intelligence) This can be used as a reference
(Connection Management by Ants: An Aplication of Mobile Agents in Network Management)
Appleby,S.. & Steward,S.(1994). (Mobile Software Agents for Control in Telecommunications Networks)This can also be used as a reference
Some people who are partially involved
Colorni,A.
Joshua R.Hertz(Routing with Swarm Intelligence :Improving the Antnet Algorithm)
For research papers of Marco Dorigo & Gianni Di Caro kindly refer to the site I had mentioned in my previous mail
Some research papers that can be used as reference
F. Tekiner
http://www.sve.man.ac.uk/General/Staff/tekiner
•Improved Antnet Routing Algorithm to overcome Stagnation Problem", Elsevier Sciences, Journal of Systems and Software, 2005, In review
•"Improved Antnet Routing Algorithm for Packet Switching", Mediterranean Journal of Computer Networks, Oct 05, Vol 1, No,2, pp. 69-76
•"Improved Antnet Routing Algorithm with Link Probability Evaporation Over the Given Time Window", in Proceedings of IEEE SOFTCOM04, Split/Venice, 11-13 Oct 2004, pp. 502-505.
•"Investigation of Antnet Routing Algorithm by Employing Multiple Ant Colonies for Packet Switched Networks to Overcome the Stagnation Problem", Proceedings of LCS04, London 13-15 Sep 2004, pp. 185-188.
•"Antnet Routing Algorithm-Improved Version", in: Proceedings of CSNDSP04, Newcastle, UK, 22-22 July 2004, pp. 416-419.
•"Comparison of the Q-Routing and Shortest Path Routing Algorithms" PGNET04, 28 - 29 June 2004, Liverpool, UK, pp. 428 - 432
Luca M.Gambardella
•Montemanni R., Gambardella L.M., Rizzoli A.E. and Donati A.V. Ant colony system for a dynamic vehicle routing problem . Journal of Combinatorial Optimization, 10, 327-343, December 2005.
•Di Caro G.A., Ducatelle F., Gambardella L.M., BISON: Biology-Inspired techniques for Self-Organization in dynamic Networks, Kuenstliche Intelligenz, Special Issue on Swarm Intelligence, Vol.4 November 2005
•Dorigo M., Gambardella L. M, Middendorf M. and Stützle T. Guest Editorial -- Special Section on Ant Colony Optimization, IEEE Transactions On Evolutionary Computation, vol. 6, no. 4, pp. 317-320, 2002.
•Dorigo M., Gambardella L.M, Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transactions on Evolutionary Computation Vol. 1,No. 1,pp. 53-66, 1997
•Dorigo M., Gambardella L.M, Ant Colonies for Traveling Salesman Problem , BioSystems,No. 43,pp. 73-81, 1997
•Gambardella L.M, Dorigo M., Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem, Twelfth International Conference on Machine Learning, A. Prieditis and S. Russell (Eds.), Morgan Kaufmann, 1995, pp. 252-260.
In my future correspondence I will provide some more sites.
All these authors have a lot of research papers on this particular topic.Kindly refer to these sites.
My research focus is " Finding Shortest Path Using Antnet Routing"
What will be the parameters which these software agents will carry ?Their complexity should be minimum. All that I require is routing algorithm should be optimized.
Any clearance is needed? Kindly mail me back.I want to contact with the authors directly if it is possible.