2421 search results - page 210 / 485 » Approximate Flow-Aware Networking |
149
Voted
ICMCS
2006
IEEE
15 years 9 months ago
2006
IEEE
This research is motivated by the needs of robust streaming of vector graphics contents over the Internet, wireless and other lossy networks. We present a multiple description cod...
107
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
144
Voted
QOSIP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
116
click to vote
WCNC
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract—The Nakagami-lognormal distribution is the commonly used composite distribution for modeling multipath fading and shadowing. In this paper1 , simple and new form of dist...
122
Voted
ASUNAM
2009
IEEE
15 years 10 months ago
2009
IEEE
—We study information diffusion in real-life and synthetic dynamic networks, using well known threshold and cascade models of diffusion. Our test-bed is the communication network...