The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, an improved genetic algorithm to solve the unicast routing problem with QoS restrictions is proposed. The proposed algorithm uses real-coded strategy, which has unique crossover strategy, mutation strategy and fitness function, and in addition, the strategy of introducing alien species is adopted in the algorithm, in order to enhance the algorithm's global search ability. The simulation...
This paper presents a new QoS multicast routing algorithm TPMA for MPLS-TE. The algorithm first modifies the evolution equation to improve standard PSO, and then utilizes TS technique to realize the balance of global and local search, further combines Fitness function to enhanced the global search ability, simultaneously considers other QoS parameters. The main objective of TPMA is to build a QoS...
Routing of packets in networks requires that a path will be selected either dynamically while the packets are being forwarded, or statically (in advance) as in source routing from a source node to a destination. The genetic algorithms which has been applied to routing optimization problem is difficult because network is not a widely connectivity network. If we use traditional GA, it may generate some...
As a new network addressing and routing scheme, anycast has been defined as a standard communication model in IPv6. The multiple QoS constrained anycast routing problem is a nonlinear combination optimization problem, which is proved to be a NP complete problem. This paper studies anycast routing technology with multiple QoS constraints and proposes a multiple QoS anycast routing algorithm based adaptive...
Due to the massive popularity and spread of internet and advent of many new multimedia applications like Video Conferencing etc, the issue of multicast routing with multiple quality of service (QoS) constraints becomes more important. For Example, in order to ensure smooth playback of multimedia data, a video conference require guarantee on both end to end delay and loss probability. Artificial Immune...
The anycast is a new network addressing and routing scheme, and has been defined as a standard communication model in IPv6. By analyzing the characters of anycast service, an anycast routing model with multiple QoS constraints and a felicitous estimate function of the optimal route path are presented in this paper, and a multiple QoS anycast routing algorithm based adaptive genetic algorithm is proposed...
QoS routing problem in wireless mesh networks is a NP-complete problem, and it is hard to get the global solution with the traditional algorithm. In this paper, we adopt a novel dynamic ant genetic hybrid algorithm to solve QoS unicast routing problem for wireless mesh network, whose innovation are using the best melting point evaluation strategy to control the calling of the two algorithms dynamically...
As a new communication mode, anycast brings along challenges and opportunities for domestic and international researchers. The quality of anycast service mainly relies on the selection of QoS routing. Aiming at the proposed anycast routing algorithm, this paper introduces its disadvantages on the experimental analyses and its advantages of simulation based on NS2. It then focuses on a proposed anycast...
Qos anycast is a newly rising network communication service, playing an important role in the area of video stream on-demand. Although the DiffServ network QoS anycast routing architecture is very good, the interleaving services problems exist, which makes its service efficiency decline. A QoS anycast network cluster balancing algorithm based on genetic algorithm and scheduler is introduced in this...
In this paper, a new algorithm, intelligent agent antnet based routing algorithm (IANRA) is proposed to enhance load balancing strategy in wireless networks (WNs). IANRA is based on ants behaviour with some important factors such as: the specific self-organizing behaviour of ant colonies, the shortest path discovery and the related framework of ant colony optimization (ACO). The main focus in IANRA...
Qos multicast routing is of great importance for many multimedia communication applications such as videos conference, remote education, CSCW and so on. In order to effectively resolve Qos multicast routing, this paper mainly focus on the bandwidth-delay-constrained least-cost multicast routing problem, and present a memetic algorithm(MA) to deal with this problem. The experimental results show that...
The requirements for quality of service (QoS) of applications in networks are becoming stricter. Toward to solve the routing problem in IP networks, MPLS architecture allows to define explicit routes in the network. This paper describes a multi-objective heuristic approach to solve the routing problem in MPLS networks. An evolutionary multi-objective algorithm is proposed based on Dijkstra's shortest...
This paper proposes an algorithm for QoS multicast routing with multiple constraints using genetic algorithm. It considers multiple QoS parameters such as delay, bandwidth, jitter and losing rate. The algorithm utilizes the tree-coding to save the encoding space and cut down the decoding operation, designs the improved crossover and the mutation operations based on the tree-coding. The experiment...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.