2000
DOI: 10.1145/505672.505675
|View full text |Cite
|
Sign up to set email alerts
|

Optimised batch patching with classes of service

Abstract: In this paper we present a new technique called Optimised Batch Patching with Classes of Service(OBP with CoS) which can be used to leverage the benefits of multicast within the context of 'near' video-on-demand systems in IP networks. OBP with CoS builds on an earlier scheme, known as Optimised Patching, but is different in two respects. Firstly, in OBP with CoS, the server artificially delays requests in order to increase the probability of accumulating duplicates, thereby allowing greater exploitation of mu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2003
2003
2005
2005

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 5 publications
0
14
0
Order By: Relevance
“…Moreover, the longer the duration of patching window, the higher buffer size required at the proxy. Accordingly, in practice the initial value of the patching window can be determined using the expression in literature [3], afterwards, we let the patching window size to adaptively expand or shorten in terms of request arrival rate. Intuitively, if all batches during the duration of the stream have no-zero requests, this media object is really very popular and we ought to expand the patching window in order to much cache this entire object at proxy and not have to request from the server.…”
Section: Numerical Results and Comparisonsmentioning
confidence: 99%
See 3 more Smart Citations
“…Moreover, the longer the duration of patching window, the higher buffer size required at the proxy. Accordingly, in practice the initial value of the patching window can be determined using the expression in literature [3], afterwards, we let the patching window size to adaptively expand or shorten in terms of request arrival rate. Intuitively, if all batches during the duration of the stream have no-zero requests, this media object is really very popular and we ought to expand the patching window in order to much cache this entire object at proxy and not have to request from the server.…”
Section: Numerical Results and Comparisonsmentioning
confidence: 99%
“…There is an optimal patching window after which it is more bandwidth efficient to start a new entire stream rather than send patches. This scheme outperforms other multicast-based techniques such as optimal patching [4] in terms of average backbone rate over a large range of request rates [3].…”
Section: Previous Workmentioning
confidence: 93%
See 2 more Smart Citations
“…Recently White and Crowecroft [8] have introduced the concept of optimal batch patch for prefix cache in order to minimize the average stream rate of the server. We present optimal batch patch using dynamic cache based on segmented video.…”
Section: Batch Patch Based On Segmented Dynamic Cachementioning
confidence: 99%