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.
Wireless Multimedia Sensor Networks(WMSNs) have the characteristics of limited resources, variable channel capacities and high data redundancy, which pose great challenges to the QoS routing of WMSNs. Addressing these issues, an Ant Colony Optimization-based Load Balancing Routing Algorithm (ACOLBR) is proposed. Firstly, the intra-cluster routing is built by the minimum spanning tree. And then the...
One of the important concepts in MPLS Traffic Engineering (TE) is LSP setup routing. The objective of routing algorithm is to increase the number of accepted request and satisfying Quality of Service (QoS) constrains. Although much work has been done on laying MPLS paths to optimize performance, most has focused on satisfying bandwidth requirements as QoS constrains. The previously published research...
This paper aims to find the most optimal Grey-Fuzzy routing algorithm within multinomial time about the NP-complete problem of multi-objective optimization QoS routing. With the help of Grey-Fuzzy theory, this algorithm achieves an O(mn) time complexity through integrating the QoS metrics to a Grey-Fuzzy synthetic attribute according to its membership degree and grey degree. Our algorithm can use...
Computing the multi-constrained quality of service (QoS) routing according to multi-dimensions vector will cause that actual transmission route is inconsistent with optimal theoretical route and that QoS cannot meet requirements. To solve this, a novel multi-constrained QoS routing algorithm based on vector converting is proposed. The multi-dimensions vector space, which is composed of multiple additive...
Anycast communication is a new Internet service defined in IPv6, and it can make a host communication with the one ldquonearestrdquo 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, a QoS anycast routing algorithm based on ant...
The QoS is a key measure for satisfaction level of next-generation network (NGN). QoS multicast routing is becoming an urgent problem to promote NGN. An optimization mode is proposed for it, and an immune inspired algorithm is designed to solve the model. The simulation study shows the promising effects of the model and the algorithm. The study can meet the requirements of NGN performance optimization.
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...
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...
Next generation Internet applications provide guaranteed end-to-end quality-of-service (QoS). Optimization based on constraints for QoS routing is computationally complex and for this reason many heuristics have been proposed for routing in a practical situation. Among these delay constrained least cost (DCLC) routing is popular. In this paper we propose an algorithm for delay-constrained problems...
The problem of multi-constrained QoS (quality of service) routing is known to be NP-complete. It has absorbed many attentions. Varied heuristic algorithms have been presented to solve it. Most of them were based on basic algorithms, for example BFS (Bread First Search), DFS (depth first search), Dijkstra, and Bellman-Ford. Among them, BFS has least computation complexity. Whereas BFS can deal with...
Many applications in the network have strict demands for QoS, such as bandwidth, delay, packet loss rate, etc. Finding the best routing to satisfy those requirements is, in general, an NP-hard problem. Many heuristic algorithms are used to solve this problem, which, however, either belonging to local search or centralized algorithms, cannot guarantee the finding of best solutions in real networks...
In this paper, we propose an optimization-based approach for Quality of Service (QoS) routing in high-bandwidth networks. We view a network that employs QoS routing as an entity that distributively optimizes some global utility function. By solving the optimization problem, the network is driven to an efficient operating point. In earlier work, it has been shown that when the capacity of the network...
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.