26th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'06) 2006
DOI: 10.1109/icdcsw.2006.47
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of a Network Extraction Topology Algorithm for Reducing Search Space of a GA-based Routing Approach

Abstract: In order to support multimedia communication, it is necessary to develop routing algorithms which use for routing more than one QoS parameters. This is because new services such as video on demand and remote meeting systems require better QoS. Also, for admission control of multimedia applications different QoS parameters should be considered. In our previous work, we proposed an intelligent routing and CAC strategy using cooperative agents. The proposed routing algorithm is a combination of source and distrib… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2007
2007
2010
2010

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(11 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…Ikeda et al (2006) describe the relationship between Pareto solution and the solution space (see Fig. 1).…”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…Ikeda et al (2006) describe the relationship between Pareto solution and the solution space (see Fig. 1).…”
Section: Problem Formulationmentioning
confidence: 99%
“…Albrecht (2006, 2008) import logarithmic simulated annealing (LSA) as pre-processing of GA; the algorithm utilizes the partially crossover operation (PMX) under the elitist model and the landscape analysis is presented to estimate the depth of the deepest local minimal in the landscape generated by the routing tasks and the objective function; experimental results show that the algorithm is effective on the randomly generated networks. Yang, Xu, Li, and Liu (2004) and Ikeda et al (2006) focus on creating a robust path to find solution for specified networks; the genetic algorithm is proposed and, respectively, the individuals of the population are represented by trees, algorithm uses the single point crossover and a mutation operation where the ''tree junctions" are chosen randomly, the algorithm employs the elitist model where the individual with the highest fitness value in a population is left unchanged in the next generation, the simulation results show that the algorithm is reasonably fast on small and medium size networks. Differ from the above network architecture, Rango, Tropea, Santamaria, and Marano (2007) and Mala and Swlvakumar (2006) refer a scheme called Core Based Tree (CBT) with genetic algorithm which provides a new way for realizing multicast routing protocol in wireless networks, however, it needs much running time.…”
Section: Introductionmentioning
confidence: 99%
“…In order to extract the ET, the network connectivity information, link and node metrics, and QoS requirement of the new connection are required. In our previous work [12], we used link parameters T SR T h, DT T h, CC T h to specify the QoS demands of a new connection. If DT < DT T h, T SR > T SR T h, CC < CC T h for a connection, this means that every path which passes via this link satisfies the connection requirements.…”
Section: Proposed Ssra Algorithmmentioning
confidence: 99%
“…However, in the proposed Fuzzy Admission Control (FAC) scheme and Fuzzy Equivalent Capacity Estimator (FECE), we considered only two indicators for QoS and Congestion Control (CC) [10,11]. In [12,13], we extended our work by proposing two additional schemes: Fuzzy QoS Controller (FQC) and Fuzzy Congestion Controller (FCC), which are integrated in the previous scheme. The new scheme is called Fuzzy Admission Control for Multimedia applications (MFAC).…”
Section: Introductionmentioning
confidence: 98%
See 1 more Smart Citation