Sciweavers

176 search results - page 25 / 36
» Abstraction and Refinement in Protocol Derivation
Sort
View
TON
2002
91views more  TON 2002»
13 years 7 months ago
The stable paths problem and interdomain routing
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilf...
PLDI
2012
ACM
11 years 10 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
CALCO
2007
Springer
118views Mathematics» more  CALCO 2007»
14 years 1 months ago
Coalgebraic Epistemic Update Without Change of Model
Abstract. We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions an...
Corina Cîrstea, Mehrnoosh Sadrzadeh
TMC
2012
11 years 10 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
INFOCOM
2009
IEEE
14 years 2 months ago
Delay-Limited Cooperative Communication with Reliability Constraints in Wireless Networks
Abstract—We investigate optimal resource allocation for delaylimited cooperative communication in time varying wireless networks. Motivated by real-time applications that have st...
Rahul Urgaonkar, Michael J. Neely