WiMob'2005), IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, 2005.
DOI: 10.1109/wimob.2005.1512854
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic capacity allocation for multimedia services in TDMA/CDMA cellular networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…However, it is important to highlight two main differences: i. The download time of WWW browsing sessions could be shown to follow a Weibull distribution [11]. In other words, ARP/E lifetime is no longer exponential and, therefore, computation of η down and η up using (8) only reflects an approximation, rather than an exact value due to the memory exhibited by Weibull distributions.…”
Section: B Www Browsing Servicementioning
confidence: 99%
See 1 more Smart Citation
“…However, it is important to highlight two main differences: i. The download time of WWW browsing sessions could be shown to follow a Weibull distribution [11]. In other words, ARP/E lifetime is no longer exponential and, therefore, computation of η down and η up using (8) only reflects an approximation, rather than an exact value due to the memory exhibited by Weibull distributions.…”
Section: B Www Browsing Servicementioning
confidence: 99%
“…An exact formula for the satisfieduser probability is derived for speech services. For WWW browsing, the error-free download time follows a Weibull distribution [11]. The ARP/E analysis developed for speech is employed as an approximation for the corresponding satisfied-user probability of WWW browsing users.…”
Section: Introductionmentioning
confidence: 99%
“…This is superior in terms of signaling cost and reliability to other adaptive schemes that rely on the receiver reporting its BER state or asking for a resource re-assignment when packet loss occurs [11,12]. To address the limitations of the distributed MIP, we propose the minimum sum of path-loss ratios (MS-PLR) algorithm [18]. The scheme functions in a distributed processing structure with global interference information.…”
Section: Introductionmentioning
confidence: 99%