Sciweavers

2862 search results - page 374 / 573
» Bicriteria Network Design Problems
Sort
View
WINET
2002
163views more  WINET 2002»
15 years 6 months ago
TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
Claudio Casetti, Mario Gerla, Saverio Mascolo, M. ...
INFOCOM
2010
IEEE
15 years 5 months ago
Distributed Caching Algorithms for Content Distribution Networks
—The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV se...
Sem C. Borst, Varun Gupta, Anwar Walid
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 10 months ago
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
Silvia Acid, Luis M. de Campos
VTC
2006
IEEE
110views Communications» more  VTC 2006»
16 years 17 days ago
DeuceScan: Deuce-Based Fast Handoff Scheme in IEEE 802.11 Wireless Networks
— WLANs will become a major portion of the fourth generation (4G) cellular system. The seamless handoff problem in WLANs is a very important design issue to support the new astou...
Yuh-Shyan Chen, Chung-Kai Chen, Ming-Chin Chuang
MOBICOM
2006
ACM
16 years 15 days ago
OURS: optimal unicast routing systems in non-cooperative wireless networks
We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic i...
Weizhao Wang, Xiang-Yang Li, Stephan Eidenbenz, Yu...