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.
The interest for providing services with performance guarantees across different connected networks has given new technical solutions allowing the computation of constrained inter-domain paths. Thus, the present paper treats the problem of computing inter-domain paths subject to multiple constraints. We study here existing algorithms for inter-domain computations, and describe new approach approximating...
Localized Quality of Service (QoS) routing has been recently proposed for supporting the requirements of multimedia applications and satisfying QoS constraints. Localized algorithms avoid the problems associated with the maintenance of global network state by using statistics of flow blocking probabilities. Using local information for routing avoids the overheads of global information with other nodes...
The biggest contemporary drawback in the maintenance and distribution of the global state is the increase in communication overheads. Localized routing is the method to avoid this problem. New localized routing algorithms called Highest Minimum Bandwidth routing (HMB) is introduced in this paper. The new algorithm is compared under different traffic loads and network topologies to the existing localized...
Quality of service (QoS) routing has recently been improved by using localized routing rather than global state information. The traditional global method is associated with many problems which are avoided by using the Localized Quality of Service (QoS) routing. The network in this technique is inferred by the source nodes using statistics which is collected locally. This paper presents new localized...
A complete system which ensures reliable transmission of streaming flows in flow-aware networks (FAN) is presented and analyzed in the paper. A new congestion control mechanism, called RPAEF (remove and prioritize in access active elastic flows), is described in detail. It allows for fast acceptance of new streaming flows in the admission control (AC) block of FAN routers. The mechanism of limiting...
Finding the link-disjoint path pair with respect to a number of additive constraints is a key issue of QoS routing. This paper presents and evaluates a new algorithm based on Lagrangian relaxation framework for this problem. Under the Lagrangian relaxation framework, the algorithm relaxes all the additive constraints and reduces the original problem to an unconstrained link-disjoint routing problem,...
Future force networks such as FCS and WIN-T are anticipated to support a wide spectrum of applications with stringent and diverse quality of service (QoS) constraints. While many QoS control mechanisms are being designed, judicious multi-metric QoS route selection mechanisms are often put forth as a key means to help provide QoS assurances. QoS routing based on multiple metrics can potentially provide...
In distributed virtual environments, e.g., online gaming, collaborative designs and distributed military simulations, interactivity is one of the most important requirements. The users may notice serious degradations in quality of service when interacting in the virtual world if the response from the system is much slower than what they have experienced in real life. In this paper, we consider the...
The well-known greedy multicast routing algorithm Mamcra, proposed in the literature, computes the set of shortest paths from a source to all destinations, and then reduces this set to an efficient set of multicast routes, without compromising the requested level of QoS. In this paper, we propose a taboo search algorithm, named TabooQMR, that is augmented by some meta-heuristics to improve the multicast...
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging...
A principal factor in sensor network design is energy efficiency. In this work, we propose to extend the lifetime of sensor networks using appropriate choice of sensor node distribution. The key idea of our scheme is to deploy more nodes in areas of extensive energy usage. Using this scheme of sensor node distribution, we use probabilistic angular routing to route data packets from the sensor nodes...
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.