2008
DOI: 10.1007/s11280-007-0039-4
|View full text |Cite
|
Sign up to set email alerts
|

Improving the Hybrid Data Dissemination Model of Web Documents

Abstract: One of the major problems in the Internet today is the scalable delivery of data. With more and more people joining the Internet community, web servers and services are being forced to deal with workloads beyond their original data dissemination design capacity. One solution that has arisen to address scalability is to use multicasting, or push-based data dissemination, to send out data to many clients at once. More recently, the idea of using multicasting as part of a hybrid system with unicasting has shown p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 24 publications
0
5
0
Order By: Relevance
“…When receiving the Fs from I 1 , an IS, say I 2 , leverages the received Fs to prune some of its polled documents in step (4), and forwards the remaining documents back to I 1 in step (5). In the steps (3)(4)(5), using the Fs to prune unnecessary documents and forwarding only the remaining documents leads to less forwarding cost. After receiving the forwarded documents from all other ISes, I 1 finds the final top-k documents for its maintained filters.…”
Section: Solution Overviewmentioning
confidence: 99%
See 3 more Smart Citations
“…When receiving the Fs from I 1 , an IS, say I 2 , leverages the received Fs to prune some of its polled documents in step (4), and forwards the remaining documents back to I 1 in step (5). In the steps (3)(4)(5), using the Fs to prune unnecessary documents and forwarding only the remaining documents leads to less forwarding cost. After receiving the forwarded documents from all other ISes, I 1 finds the final top-k documents for its maintained filters.…”
Section: Solution Overviewmentioning
confidence: 99%
“…4.3.1 and 4.3.2, we give the algorithm details in Algorithm 3. We first add terms to the set T (lines [3][4][5][6][7][8][9][10][11]. For such terms in T , we ensure that the upper bound Relevscore_ub (approximated by lines 5-8) is larger than T (t i ), i.e.…”
Section: Algorithm Detailsmentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, data broadcast is able to serve any number of queries, and the query performance is not affected by the number of mobile clients in a cell [41]. Strategies to broadcast data through wireless channels have been effective in addressing the efficiency and scalability issue [2,41,42]. …”
Section: Related Workmentioning
confidence: 99%