Proceedings of the 15th International Conference on World Wide Web 2006
DOI: 10.1145/1135777.1135790
|View full text |Cite
|
Sign up to set email alerts
|

Fine grained content-based adaptation mechanism for providing high end-user quality of experience with adaptive hypermedia systems

Abstract: New communication technologies can enable Web users to access personalised information "anytime, anywhere". However, the network environments allowing this "anytime, anywhere" access may have widely varying performance characteristics such as bandwidth, level of congestion, mobility support, and cost of transmission. It is unrealistic to expect that the quality of delivery of the same content can be maintained in this variable environment, but rather an effort must be made to fit the content served to the curr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 16 publications
0
5
0
Order By: Relevance
“…The key assumption of Chatzimisios's model is that the transmission loss probability (P DCF ) of a transmitted packet is constant and independent of the number of the collisions or errors occurred in the past. The probability P DCF is given by (2), where n indicates the number of contending stations, BER is the bit error rate, L is the packet size, H is the packet header, and τ denotes the probability that a station transmits a packet in a randomly chosen slot time. The probability τ is given by (3), where W represents the initial contention window size and m means retry limit.…”
Section: ) Tcp Reno Throughput Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…The key assumption of Chatzimisios's model is that the transmission loss probability (P DCF ) of a transmitted packet is constant and independent of the number of the collisions or errors occurred in the past. The probability P DCF is given by (2), where n indicates the number of contending stations, BER is the bit error rate, L is the packet size, H is the packet header, and τ denotes the probability that a station transmits a packet in a randomly chosen slot time. The probability τ is given by (3), where W represents the initial contention window size and m means retry limit.…”
Section: ) Tcp Reno Throughput Modelmentioning
confidence: 99%
“…The probability τ is given by (3), where W represents the initial contention window size and m means retry limit. Chatzimisios's model has proved that there is a unique solution for (2) and (3).…”
Section: ) Tcp Reno Throughput Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…Two types of nodes apply to the design of adaptive hypermedia (Brusilovsky, 2001;Muntean, 2005): navigational nodes and content-comprising nodes. Usually, websites are mixtures of different types of media (text, flash, documents, etc.).…”
Section: Structuring Hypermediamentioning
confidence: 99%
“…Yet, content providers should take some key decisions at the beginning of the delivery. For instance, most web sites have different versions of their pages, with a variable number of elements and different versions, e.g., pictures with different resolutions [1,2]. The decision of which version to deliver must be taken at the very beginning of the connection, even though no past observation of the network path performance is available.…”
Section: Introductionmentioning
confidence: 99%