Sciweavers

663 search results - page 98 / 133
» Process Algebra with Local Communication
Sort
View
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 9 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
GLOBECOM
2007
IEEE
13 years 7 months ago
Cooperative Beamforming for Wireless Ad Hoc Networks
—Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of mak...
Lun Dong, Athina P. Petropulu, H. Vincent Poor
SIGMETRICS
2008
ACM
143views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Pictures from the Skype
This demo focuses on the online characterization and classification of Skype traffic, a very popular and fashionable VoIP application nowadays. Building over previous work on the ...
Dario Rossi, Silvio Valenti, Paolo Veglia, Dario B...
CCR
2002
111views more  CCR 2002»
13 years 7 months ago
A taxonomy and design considerations for Internet accounting
Economic principles are increasingly being suggested for addressing some complex issues related to distributed resource allocation for QoS (Quality of Service) enhancement. Many p...
Michel Kouadio, Udo W. Pooch
JSAC
2010
122views more  JSAC 2010»
13 years 6 months ago
Scalable service migration in autonomic network environments
Abstract— Service placement is a key problem in communication networks as it determines how efficiently the user service demands are supported. This problem has been traditional...
Konstantinos Oikonomou, Ioannis Stavrakakis