Sciweavers

1022 search results - page 125 / 205
» New models and algorithms for programmable networks
Sort
View
ICC
2009
IEEE
161views Communications» more  ICC 2009»
14 years 10 months ago
Energy-Efficient Itinerary Planning for Mobile Agents in Wireless Sensor Networks
Compared to conventional wireless sensor networks (WSNs) that are operated based on the client-server computing model, mobile agent (MA) systems provide new capabilities for energy...
Min Chen, Victor C. M. Leung, Shiwen Mao, Taekyoun...
116
Voted
NETWORKING
2008
15 years 2 months ago
Towards an ISP-Compliant, Peer-Friendly Design for Peer-to-Peer Networks
Peer-to-peer (P2P) applications are consuming a significant fraction of the total bandwidth of Internet service providers (ISPs). This has become a financial burden to ISPs and if ...
Haiyong Xie 0002, Yang Richard Yang, Avi Silbersch...
CACM
2006
160views more  CACM 2006»
15 years 20 days ago
Service systems, service scientists, SSME, and innovation
: Computer scientists work with formal models of algorithms and computation, and someday service scientists may work with formal models of service systems, which we define as value...
Paul P. Maglio, Savitha Srinivasan, Jeffrey T. Kre...
95
Voted
VTC
2007
IEEE
15 years 6 months ago
Energy-Optimized Low-Complexity Control of Power and Rate in Clustered CDMA Sensor Networks with Multirate Constraints
—In this paper, we propose a low-complexity scheme for minimizing energy consumption in a clustered multirate CDMA sensor network with multiple receive antennas by jointly contro...
Chun-Hung Liu
127
Voted
ICNP
2002
IEEE
15 years 5 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman