2003
DOI: 10.1016/s1077-2014(02)00114-6
|View full text |Cite
|
Sign up to set email alerts
|

A new approach to optimize bandwidth reservation for real-time video transmission with deterministic guarantees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2004
2004
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 40 publications
0
9
0
Order By: Relevance
“…Thus, the appropriate value of bandwidth that needs to reserve at each link can be determined according to the user service level agreement (SLA). In the works of Hernández and Vila and Anjali et al, authors examined how to dynamically determine and adjust the optimal bandwidth reserved for traffic to minimize the resource consumption while still ensuring the service quality. Moreover, in related works,() authors researched how to use the multiflow aggregation bandwidth overprovisioning method to reduce the signaling overhead in bandwidth reservation.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, the appropriate value of bandwidth that needs to reserve at each link can be determined according to the user service level agreement (SLA). In the works of Hernández and Vila and Anjali et al, authors examined how to dynamically determine and adjust the optimal bandwidth reserved for traffic to minimize the resource consumption while still ensuring the service quality. Moreover, in related works,() authors researched how to use the multiflow aggregation bandwidth overprovisioning method to reduce the signaling overhead in bandwidth reservation.…”
Section: Related Workmentioning
confidence: 99%
“…The initial solution is ⃗ C = {C i }. However, the initial solution may not be a feasible solution as it may not be able to meet constraint (7). In each iteration of Algorithm 1, while C ij of each link grows, the algorithm can always ensure that the links with more available bandwidth always reserve more.…”
Section: Algorithm Designmentioning
confidence: 99%
“…Assume that the aggregate traffic flow has n frames and that the number of encoded bits produced by frame i is E i . If the flow source is constrained by a token bucket, then it cannot transmit more than b+rt bits at time t. Considering f frames per second, and ignoring the finite capacity of the bucket, the bucket fullness (in bits) at the end of the frame period i is [10,11]:…”
Section: Traffic Characterizationmentioning
confidence: 99%
“…The function b(r) is a decreasing function in the domain [1, p] (p is the traffic peak rate) as shown in [11].…”
Section: Traffic Characterizationmentioning
confidence: 99%
“…The reservation is based on the worst bitrate value, generally a non representative peak. Token bucket parameters may be set to an average value to optimize the link usage but it may increase the network delay [6]. A trade-off is proposed in [7], with an adapted joint rate and admission control.…”
Section: Introductionmentioning
confidence: 99%