Equivalent capacity and its application to bandwidth allocation in high-speed networks

Guérin, Roch; Ahmadi, H.; Naghshineh, M.

doi:10.1109/49.103545

Cited by 1,109 publications

(472 citation statements)

References 17 publications

Supporting

Mentioning

460

Contrasting

Unclassified

Order By: Relevance

“…Usually this involves a reduction in the complexity, and therefore a reduction of the accuracy ofthe evaluation models. In (Guerin, 1991) an approach is proposed that combines two basic approximated models to study Bandwidth Allocation: the fluid flow model and the stationary model. By the second model, the convolution approach is the most accurate method used in bandwidth allocation when a priori traffic estimation is considered.…”

Section: Bandwidth Allocationmentioning

confidence: 99%

Dynamic routing based on a single parameter: Link Congestion Probability

Marzo

Domingo‐Pascual

Fabregat

et al. 1995

High Performance Networking

View full text Add to dashboard Cite

In this paper we present a dynamic routing algorithm with alternative paths for call establishment on ATM Networks based on anticipated calculations. The routing decision criteria basically depends on the type of source of the new connection and the current network load supported by the network. We suggest an algorithm based on the Probability of Congestion in the link as an optimal control parameter for routing decision. The calculation of the Probability of Congestion is based on the Convolution Approach.The objectives of our suggestion are: to obtain a fast connection setup with the routing algorithm, to define an optimal Routing Control Parameter, to maximize network resources utilization and to minimize call blocking probabilities. In order to obtain fast connection setup when a new connection demand arrives, each node already has a pre-computed Probability of Congestion table for each type of source and for each output VIrtual Path. To obtain the improvement of resource utilization we suggest a dynamic routing scheme with alternative routes. The method proposed for the selection of the route is based on the well-known Least Loaded Routing (LLR) algorithms used in circuit switched networks. Different routing algorithms are compared when changing the criteria by the selection of available alternative routes and when changing the choice of alternative route. INTRODUCTIONNetwork Provisioning (NP) is the set of the long-term control actions that determine the physical quantities of the resources to be placed in the network. Given the network resources by a suitable NP, Network Resource Management (NRM) is the set of control functions related to establish VPs and to allocate bandwidth, which are performed by the network in order to optimize performance and utilization objectives, namely to provide the required Quality of Service (QOS) and to maximize utilization, with simple Connection Admission Control (CAC) and Routing procedures. The drawback of many existing routing algorithms is the lack of cooperation between congestion control and routing. Bandwidth AllocationThe basic objective of a bandwidth management and traffic control strategy in Asynchronous Transfer Mode (ATM) network is to allow for high utilization of network resources (transmission bandwidth, buffer space, etc.), while sustaining an acceptable QOS for all connection~. Several network traffic control functions, such as congestion control and routing, depend on the characterization of the bandwidth required for each individual connection and the resulting load on network links and buffer utilization. Some authors assign for each source an equivalent bandwidth that reflects its characteristics. Usually this involves a reduction in the complexity, and therefore a reduction of the accuracy ofthe evaluation models. In (Guerin, 1991) an approach is proposed that combines two basic approximated models to study Bandwidth Allocation: the fluid flow model and the stationary model. By the second model, the convolution approach is the most accurate...

show abstract

Section: Bandwidth Allocationmentioning

confidence: 99%

Dynamic routing based on a single parameter: Link Congestion Probability

Marzo

Domingo‐Pascual

Fabregat

et al. 1995

High Performance Networking

View full text Add to dashboard Cite

show abstract

“…Bufferless statistical multiplexing aims to ensure that the combined arrival rate of the multiplexed sources exceeds the allocated capacity only with very small probability. Examples of such bandwidth allocation schemes can be found in [6,7]. The second category comprises schemes based on buffered statistical multiplexing.…”

Section: Bandwidth Allocation Schemesmentioning

confidence: 99%

“…Contrary to bufferless multiplexing, buffered multiplexing allows an input rate excess, with surplus traffic being stored in large buffers. Examples of such bandwidth allocation schemes can be found in [6,7,8]. Generally speaking, both categories take into account factors such as the number and characteristics of flows, the required loss rate and, in case of buffered multiplexing, the available buffer size and derive the required capacity (effective bandwidth) needed for the loss rate to be kept below the required threshold.…”

Section: Bandwidth Allocation Schemesmentioning

confidence: 99%

“…According to [6], when the effect of statistical multiplexing is significant, the distribution of the stationary bit rate can be accurately approximated by a Gaussian distribution. In [12] it is suggested that the aggregation of even a fairly small number of traffic streams is usually sufficient for the Gaussian characterization of the input process.…”

Section: The Effects Of Topological Placementmentioning

confidence: 99%

See 1 more Smart Citation

On the Location-Awareness of Bandwidth Allocation and Admission Control for the Support of Real-Time Traffic in Class-Based IP Networks

Georgoulas

Trimintzios

Pavlou

et al. 2006

Autonomic Management of Mobile Multimedia Services

View full text Add to dashboard Cite

Abstract. The support of real-time traffic in class-based IP networks requires reservation of resources, accompanied by admission control in order to guarantee that newly admitted real-time traffic flows do not cause any violation to the Quality of Service (QoS) perceived by the already established ones. In this paper we highlight certain issues with respect to bandwidth allocation and admission control for supporting real-time traffic in class-based IP networks. We investigate the implications of topological placement of both bandwidth allocation and admission control schemes. We show that their performance depends highly on the location of the employed procedures with respect to the end-users and the various network boundaries. We conclude that the strategies for applying these schemes should be location-aware, because their performance at different points in a class-based IP network can be different and can deviate from the expected performance. Through simulations we also provide a quantitative view of these deviations.

show abstract

“…Therefore bandwidth of various connections can be simply summed to check capacity constraints. The notion of equivalent capacity, proposed in paper [5], provides a unified metric representing the load for the connections, and can be applied for determining the estimated bandwidth requirement for connections. This approach simplifies the analysis.…”

Section: Definition Of a New Function For Reroutingmentioning

confidence: 99%

A New Approach to Survivability of Connection Oriented Networks

Walkowiak

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Issues of network reliability are very important in modern computer networks. Even a short failure of a network link can cause substantial consequences. In this paper we concentrate on survivability of connection oriented networks (ATM, MPLS, Frame Relay). We introduce a new approach to network survivability. We propose a novel function for optimization of network routes. A combinatorial problem is formulated and solved by an heuristic algorithm. Numerical results of simulations and discussion are included.

show abstract

Equivalent capacity and its application to bandwidth allocation in high-speed networks

Cited by 1,109 publications

References 17 publications

Dynamic routing based on a single parameter: Link Congestion Probability

Dynamic routing based on a single parameter: Link Congestion Probability

On the Location-Awareness of Bandwidth Allocation and Admission Control for the Support of Real-Time Traffic in Class-Based IP Networks

A New Approach to Survivability of Connection Oriented Networks

Contact Info

Product

Resources

About