scispace - formally typeset
Journal ArticleDOI

Optimizing the system of virtual paths

Reads0
Chats0
TLDR
An efficient algorithm is presented that finds a system of VP routes for a given set of VP terminators and VP capacity demands and numerical results show that the proposed solution carries the potential for a near optimal allocation of VPs.
Abstract
The virtual path (VP) concept is known to be a powerful transport mechanism for ATM networks. This paper deals with the optimization of the virtual paths system from a bandwidth utilization perspective. While previous research on VP management has basically assumed that bandwidth in ATM networks is unlimited, emerging technologies and applications are changing this premise. In many networks, such as wireless, bandwidth is always at a premium. In wired networks, with increasing user access speeds, less than a dozen of broadband connections can saturate even a Gigabit link. We present an efficient algorithm that finds a system of VP routes for a given set of VP terminators and VP capacity demands. This solution is motivated by the need to minimize the load, or reduce congestion, generated by the VP's on individual links. A nontrivial performance guarantee is proven for the quality of the proposed solution and numerical results show that the proposed solution carries the potential for a near optimal allocation of VPs. >

read more

Citations
More filters
Patent

Multi-protocol telecommunications routing optimization

TL;DR: In this article, a multi-protocol routing optimization for a telecommunications switching system employing a set of user priorities in determining the selection of a telecommunications path to be utilized for transmitting a data file to a remote destination is presented.
Patent

Using a fixed network wireless data collection system to improve utility responsiveness to power outages

TL;DR: A system for determining a service outages and restorations that includes an outage management server (OMS) that generates reports outage and restoration information for metering endpoints is discussed in this article.
Patent

Data collector for an automated meter reading system

TL;DR: In this article, an electronic utility meter, a data collector/meter and a method for communicating data in an automated meter reading system is described. But the method is not suitable for large numbers of users.
Patent

In-home display that communicates with a fixed network meter reading system

TL;DR: In this paper, a display system that communicates with existing automated meter reading communications systems to provide information to a user is presented, which includes a radio that listens to communications between a utility meter and the reading system.
Patent

Dynamic self-configuring metering network

TL;DR: In this paper, a dynamic self-configuration system for collecting metering data comprises a collector meter and a level two meter, which scans for meters that are operable to directly communicate with the collector and registers such meters as level one meters.
References
More filters
Journal ArticleDOI

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

TL;DR: In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.
Journal ArticleDOI

Lightpath communications: an approach to high bandwidth optical WAN's

TL;DR: It is shown that although the problem of optimally establishing lightpaths is NP-complete, simple heuristics provide near optimal substitutes for several of the basic problems motivated by a lightpath-based architecture.
Book ChapterDOI

On the Distribution of the Number of Successes in Independent Trials

TL;DR: In this paper, the authors considered the problem of finding the maximum and the minimum of the expected value of a real-valued function of a function g(S) when ES = np, and showed that the variability in the number of successes is highest when the successes are equally probable.
Journal ArticleDOI

Shortest path algorithms

TL;DR: Eight algorithms which solve the shortest path tree problem on directed graphs are presented, together with the results of wide-ranging experimentation designed to compare their relative performances on different graph topologies.
Journal ArticleDOI

Trends in cellular and cordless communications

TL;DR: The evolution of wireless information networks is traced from the present first generation systems to next century's third generation, envisioned as a unified wireless access replacing the diverse and incompatible second-generation networks with a single means of wireless access to advanced information services.