Sciweavers

525 search results - page 102 / 105
» A Fair e-Tendering Protocol
Sort
View
IIWAS
2008
13 years 9 months ago
A model-prover for constrained dynamic conversations
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...
Diletta Cacciagrano, Flavio Corradini, Rosario Cul...
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 7 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez
ADT
2006
13 years 7 months ago
Characterization and evaluation of TCP and UDP-based transport on real networks
Standard TCP (Reno TCP) does not perform well on fast long distance networks, due to its AIMD congestion control algorithm. In this paper we consider the effectiveness of various a...
Roger Les Cottrell, Saad Ansari, Parakram Khandpur...
CCR
2006
82views more  CCR 2006»
13 years 7 months ago
Why flow-completion time is the right metric for congestion control
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
Nandita Dukkipati, Nick McKeown
JCM
2008
81views more  JCM 2008»
13 years 7 months ago
Power Allocation for Amplify-and-Forward Cooperative Transmission Over Rayleigh-Fading Channels
Cooperative transmission has been used to achieve diversity gain through partner to create multiple independent fading channels. It has attracted lots of research attention in rece...
Lian Zhao, Zaiyi Liao