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.
To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established,...
In the highly connected Internet most of domains have more than one interconnection link to different providers. In such a multi-homed scenario destinations for inter-domain traffic may be reachable through multiple egress routers with different offered cost and path performance. In this paper, we address the problem of route selection in a multi-homed stub network to optimize transit costs and paths...
It is a challenge to thwart both the passive attacks and active attacks in mobile ad hoc networks for their unique characteristics. The improvement of security often sacrifices the delivery rate or other QoS. We propose secure multipath routing scheme based on modified secret sharing as an effective mechanism to protect data confidentiality and simultaneously enhance data delivery rate in mobile ad...
Quality of service support for MANETs is a challenging task due to dynamic topology and limited resources. The main purpose of QoS routing is to find a feasible path that has sufficient resources to satisfy the constraints. In this paper a novel QoS routing algorithm based on ant colony optimization is proposed. The proposed algorithm uses Ant-like agents to discover and maintain paths, that satisfy...
Supporting multimedia for Mobile ad hoc networks (MANETs) is an important issue. This paper presents two routing algorithms in MANETs inspired by the ant colony optimization routing algorithms. The first algorithm is a Hybrid Multi-Ant (HMAnt) routing algorithm. It is a hybrid since it combines reactive path establishment with proactive path maintenance. It supports multi-path while maintaining an...
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficient control and management of these networks. We address the problem of quality-of-service routing, more specifically the planning of bandwidth allocation to communication demands. Shortest path routing is the traditional technique...
Anycast communication is a new Internet service defined in IPv6, and it can make a host communication with the one "nearest" member in a group of servers. The anycast routing problem with multiple QoS constrained is known to be NP-complete problem and we can't get satisfying results when using the precise method in polynomial time. In this paper, an improved ant colony optimization algorithm...
The problem of finding a path that satisfies two additive constraints, such as delay and cost, has been proved to be NP-complete. Many heuristic and approximation algorithms have been developed to identify a path given a certain QoS request. Unfortunately, these algorithms cannot be applied directly in the Internet because routing in the Internet is based on table lookups and routing tables are computed...
A new way of solving the bandwidth, delay, delay jitter and packet loss constrained least-cost quality of service (QoS) multi-routing problem is presented. It harmonizes the intrinsic attributes of each constraint of QoS and in different stage, the algorithm updates pheromone according to different constraints, optimizes its control parameters to simplify the parameter selection process and to speed...
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.