EvoWorkshops2006: EvoCOMNET

3rd European Workshop on Evolutionary Computation in Communication, Networks and Connected Systems

EvoComNet2006 is the second European Workshop on the application of evolutionary computation techniques to problems in communication, networks, and connected systems. New communication technologies, the creation of interconnected communication and information networks such as the Internet, new types of inter-personal and interorganisational communication, and the integration and interconnection of production centres and industries are the driving forces on our road towards a connected, networked, society. Such sophisticated technologies and applications demand high quality solutions to increasingly complex, inherent problems.

Web address: http://www.evonet.info/eurogp2006

Topics include

EvoComNet2006 addresses applications of evolutionary computation methods, as well as other nature-inspired, metaheuristic techniques, to the solution of problems in the following and related domains:

All applications of evolutionary computation methods, as well as other nature-inspired, meta-heuristic techniques, to the solution of these and related problems, are welcome.

Submission procedure

High quality papers are sought on topics related to the focus of the EvoComNet, ranging from theoretical work to innovative applications. Submissions should be a maximum of TWELVE A4 pages and they should be sent in zipped postscript or pdf format to rothlauf@uni-mannheim.de. It is recommended that the papers conform to the Springer Lecture Notes in Computer Science format (http://www.springer.de/comp/lncs/authors.html). It is important that the email accompanying submission should state ALL the authors, including ALL their email addresses. A notification of receipt will be emailed a few days after the submission. The reviewing process is DOUBLE BLIND. Authors should remove their names from submitted papers, and should take reasonable care that their identity is disguised. References to own work can be included in the paper, but should be referred to in the third person.

Organising Committee

Program Chairs
Franz Rothlauf
rothlauf AT uni-mannheim DOT de
University of Mannheim, Germany
George D. Smith
gds AT cmp DOT uea DOT ac DOT uk
University of East Anglia, Norwich, UK
EvoWorkshops2006 Chair
Franz Rothlauf
rothlauf AT uni-mannheim DOT de
University of Mannheim, Germany
Local Chair
Anikó Ekárt
ekart AT sztaki DOT hu
Hungarian Academy of Sciences
Publicity Chair
Steven Gustafson
smg AT cs DOT nott DOT ac DOT uk
University of Nottingham, UK

Note: the e-mail addresses are masked for spam protection.

Accepted Papers: titles and abstracts

Tracing Denial of Service Origin: Ant Colony Approach
Chia-Mei Chen, Bing Chiang Jeng, Chia Ru Yang, Gu Hsin Lai

Denial-of-Service (DoS) attacks with fake source IP addresses have become a major threat to the Internet. Intrusion detection systems are often used to detect DoS attacks. However, DoS attack packets attempt to exhaust resources, degrading network performance or, even worse, causing network breakdown. The proposed proactive approach is allocating the original attack host(s) issuing the attacks and stopping the malicious traffic, instead of wasting resources on the attack traffic. Ant colony based traceback approach is presented in this study to identify the DoS attack original source IP address. Instead of creating a new function or processing a high volume of fine-grained data, the proposed IP address traceback approach uses flow level information to identify the origin of a DoS attack. The proposed method is evaluated through simulation on various network environments. The simulation results show that the proposed method can successfully and efficiently find the DoS attack path in various simulated network environments.

A multiagent algorithm for graph partitioning
Francesc Comellas, Emili Sapena

The $k$-cut problem is an NP-complete problem which consists of finding a partition of a graph into $k$ balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrical and evolutionary methods. In this paper we present a new simple multiagent algorithm, {\em ants}, and we test its performance with standard graph benchmarks. The results show that this method can outperform several current methods while it is very simple to implement.

Optimal Broadcasting in Metropolitan MANETs Using Multiobjective Scatter Search
Francisco Luna, Antonio J. Nebro, Bernab´e Dorronsoro, Enrique Alba,Pascal Bouvry, Luc Hogie

Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenario, broadcasting becomes an operation of capital importance for the own existence and operation of the network. Optimizing a broadcasting strategy in MANETs is a multiobjective problem accounting for three goals: reaching as many stations as possible, minimizing the network utilization, and reducing the makespan. In this paper, we face this multiobjective problem with a state-of-the-art multiobjective scatter search algorithm called AbSS (Archive-based Scatter Search) that computes a Pareto front of solutions to empower a human designer with the ability of choosing the preferred configuration for the network. Results are compared against those obtained with the previous proposal used for solving the problem, a cellular multiobjective genetic algorithm (cMOGA). We conclude that AbSS outperforms cMOGA with respect to three different metrics.

Evolutionary Design of OAB and AAB Communication Schedules for Interconnection Networks
Milos Ohlidal, Jiri Jaros, Josef Schwarz, Vaclav Dvorak

Since chip multiprocessors are quickly penetrating new application areas in network and media processing, their interconnection architectures become a subject of sophisticated optimization. One-to-All Broadcast (OAB) and All-to-All Broadcast (AAB) [2] group communications are frequently used in many parallel algorithms and if their overhead cost is excessive, performance degrades rapidly with a processor count. This paper deals with the design of a new application-specific standard genetic algorithm (SGA) and the use of Hy-brid parallel Genetic Simulated Annealing (HGSA) to design optimal commu-nication algorithms for an arbitrary topology of the interconnection network. Each of these algorithms is targeted for a different switching technique. The OAB and AAB communication schedules were designed mainly for an asym-metrical AMP [15] network and for the benchmark hypercube network [16] us-ing Store-and-Forward (SF) and Wormhole (WH) switching.

BeeHiveGuard: A Step Towards Secure Nature Inspired Routing Algorithms
Horst F. Wedde, Constantin Timm, Muddassar Farooq

Nature inspired routing protocols for fixed and mobile networks are becoming an active area of research. However, analyzing their security threats and countering them have received little attention. In this paper we discuss the security threats of a state-of-the-art routing protocol, {\em BeeHive}, and then extend the algorithm with our security model to counter them. We further conclude from our extensive experiments that standard cryptography techniques can not be utilized due to their large processing and communication costs, if Nature inspired routing protocols are to be deployed in real world networks.