Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A comparative study of evolutionary network design
Download
index.pdf
Date
2003
Author
Kalkan, Sinan
Metadata
Show full item record
Item Usage Stats
221
views
80
downloads
Cite This
In network design, a communication network is optimized for a given set of parameters like cost, reliability and delay. This study analyzes network design problem using Genetic Algorithms in detail and makes comparison of different approaches and representations. Encoding of a problem is one of the most crucial design choices in Genetic Algorithms. For network design problem, this study compares adjacency matrix representation with list of edges representation. Also, another problem is defining a fair fitness function that will not favor one optimization parameter to the other. Multi-objective optimization is a recommended solution for such problems. This study describes and compares some of those approaches for different combinations in network design problem.
Subject Keywords
Computer networks
,
Genetic algorithms
,
Multiobjective optimization
,
Network design
,
Network repre sentations
,
Adjacency representation
,
Edge representation
URI
http://etd.lib.metu.edu.tr/upload/1097518/index.pdf
https://hdl.handle.net/11511/13872
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
A new scalable service discipline for real-time traffic: The framed-deadline scheduler
Schmidt, Şenan Ece (Elsevier BV, 2007-03-26)
Qulaity of Service (Qos) support in a scalable and low-complexity fashion is important in high-speed networks carrying real-time traffic. There are service disciplines that can provide end-to-end bandwidth and delay guarantees. However, they are designed to operate with expensive output quenching switches or with combined input-output queuing (CIOQ) switches that require very complicated fabric work with a CIOQ packet switch to provide the same end-to-end QoS guarantees as service disciplines that only work...
Improving performance of network intrusion detection systems through concurrent mechanisms
Atakan, Mustafa; Şener, Cevat; Department of Computer Engineering (2003)
As the bandwidth of present networks gets larger than the past, the demand of Network Intrusion Detection Systems (NIDS) that function in real time becomes the major requirement for high-speed networks. If these systems are not fast enough to process all network traffic passing, some malicious security violations may take role using this drawback. In order to make that kind of applications schedulable, some concurrency mechanism is introduced to the general flowchart of their algorithm. The principal aim is...
A simulation study of scheduling algorithms for packet switching networks
Babur, Özgür; Baykal, Buyurman; Department of Electrical and Electronics Engineering (2003)
A scheduling algorithm has the primary role in implementing the quality of service guaranteed to each flow by managing buffer space and selecting which packet to send next with a fair share of network. In this thesis, some scheduling algorithms for packet switching networks are studied. For evaluating their delay, jitter and throughput performances, a discrete event simulator has been developed. It has been seen that fair scheduling provides, fair allocation of bandwidth, lower delay for sources using less ...
A Flow Aggregation Method for the Scalable and Efficient Quality of Service Support in Next Generation Networks
Sanli, Mustafa; Schmidt, Şenan Ece; Guran, Hasan Cengiz (2013-12-13)
The services in the Next Generation Network (NGN) will be created on demand by the customers and will require end-to-end Quality of Service (QoS) for each flow. A very significant component for the end-to-end QoS support in the Internet is the packet schedulers in the routers. The complexity of the packet scheduling algorithms increases with the number of flows. As a solution, flow aggregation decreases the number of flows processed by the scheduler. The previous work in the literature proves that if the fl...
Evaluation of Terahertz Channel in Data Centers
MOLLAHASANİ, Shahram; Onur, Ertan (2016-04-29)
Designing data center network topologies with the objective of minimizing cost, increasing bisection bandwidth and decreasing latency is a difficult problem. The solutions in the literature mainly concentrate on wired networks and minimizing wiring costs thereof. Only a few proposals address the benefit of employing wireless communications in data centers due to spectrum and bandwidth limitations of current wireless communication technologies. By using terahertz communication in a data center as a complemen...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Kalkan, “A comparative study of evolutionary network design,” M.S. - Master of Science, Middle East Technical University, 2003.