Sciweavers

5 search results - page 1 / 1
» Strong approximations for Markovian service networks
Sort
View
QUESTA
1998
62views more  QUESTA 1998»
13 years 4 months ago
Strong approximations for Markovian service networks
Avishai Mandelbaum, William A. Massey, Martin I. R...
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
JUCS
2008
120views more  JUCS 2008»
13 years 5 months ago
Guaranteeing Seamless Mobility with User Redials and Automatic Handover Retrials
: In communication systems that guarantee seamless mobility of users across service areas, repeated attempts occur as a result of user behavior but also as automatic retries of blo...
José Manuel Giménez-Guzmán, M...
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 5 months ago
Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study
—Established in 2005, YouTube has become the most successful Internet site providing a new generation of short video sharing service. Today, YouTube alone comprises approximately...
Xu Cheng, Cameron Dale, Jiangchuan Liu
INFOCOM
2003
IEEE
13 years 10 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz