Optimal channel allocation policies for access control of circuit-switched traffic in ISDN environments

Meempat, G.; Sundareshan, Malur K.

doi:10.1109/26.216509

Cited by 23 publications

(14 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this form, the problem was given in [14] as Problem APUT. This problem can be transformed into a mixed integer programming problem by treating ⃗ as a set of integer decision variables.…”

Section: =1mentioning

confidence: 99%

“…A dynamic programming approach to the determination of the optimal solution was provided in [13], and a mixed integer programming approach was provided in [14]. While these techniques can be applied to classes with arbitrary bandwidth usage, we consider here only the subset of the complete partitioning problem in which class bandwidth is an integer multiple of the next lower class, i.e.…”

Section: A Recursive Algorithmmentioning

confidence: 99%

“…In this section, we compare the computational complexity of the proposed algorithm to that of the dynamic programming approach given in [13] and of the mixed integer approach given in [14].…”

Section: Complexitymentioning

confidence: 99%

“…The mixed integer approach is presented in [14] as Problem APUT-MIP. It introduces decision variables that dictate the allocation of bandwidth to class .…”

Section: The Execution Time Of the Dynamic Programming Approach Is (mentioning

confidence: 99%

“…In this case, the time required to compute the optimal policy can be critical. A dynamic programming approach to the determination of the optimal solution was provided in [13], and a mixed integer programming approach was provided in [14]. Let denote the number of classes and denote the number of resources.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A recursive algorithm for bandwidth partitioning

Jordan

Charrington

Apivatanagul

2010

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-We consider complete partitioning of bandwidth among multiple services. When class bandwidth is an integer multiple of the next lower class and total bandwidth is an integer multiple of the largest class bandwidth, we develop a recursive algorithm that determines the optimal complete partitioning policy with a significantly lower complexity than that of known dynamic programming or mixed integer programming approaches.

show abstract

Section: =1mentioning

confidence: 99%

Section: A Recursive Algorithmmentioning

confidence: 99%

Section: Complexitymentioning

confidence: 99%

“…The mixed integer approach is presented in [14] as Problem APUT-MIP. It introduces decision variables that dictate the allocation of bandwidth to class .…”

Section: The Execution Time Of the Dynamic Programming Approach Is (mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A recursive algorithm for bandwidth partitioning

Jordan

Charrington

Apivatanagul

2010

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

Static and dynamic resource allocation in a multiservice satellite network with fading

Celandroni

Davoli

Ferro

2003

Satell Commun Network

View full text Add to dashboard Cite

SUMMARYA control architecture for resource allocation in satellite networks is proposed, along with the specification of performance indexes and control strategies. The latter, besides being based on information on traffic statistics and network status, rely upon some knowledge of the fading conditions over the satellite network channels. The resource allocation problem consists of the assignment, by a master station, of a total available bandwidth among traffic earth stations in the presence of different traffic types. Traffic stations are assumed to measure continuously their signal fade level, but this information may either be used only locally or also communicated to the master station. According to the information made available on-line to the master station on the level of the fading attenuation of the traffic stations, the assignment can be made static, based on the a priori knowledge of long-term fading statistics, or dynamic, based on the updated measurements. In any case, the decisions can be adapted to slowly time-varying traffic characteristics. At each earth station, two basic traffic types are assumed to be present, namely guaranteed bandwidth, real time, synchronous data (stream traffic) and best-effort traffic (datagram traffic). Numerical results are provided for a specific architecture in the dynamic case, in a real environment, based on the Italsat satellite national coverage payload characteristics.

show abstract

A Practical Approach to Resource Allocation in Video-on-Demand Servers

Abram-Profeta

Shin

1998

Journal of Visual Communication and Image Representation

View full text Add to dashboard Cite

Optimal channel allocation policies for access control of circuit-switched traffic in ISDN environments

Cited by 23 publications

References 14 publications

A recursive algorithm for bandwidth partitioning

A recursive algorithm for bandwidth partitioning

Static and dynamic resource allocation in a multiservice satellite network with fading

A Practical Approach to Resource Allocation in Video-on-Demand Servers

Contact Info

Product

Resources

About