3751 search results - page 538 / 751 » Events in security protocols |
123
Voted
ESA
2005
Springer
15 years 9 months ago
2005
Springer
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
122
click to vote
PADS
2004
ACM
15 years 9 months ago
2004
ACM
Parallel discrete event simulation techniques have enabled the realization of large-scale models of communication networks containing millions of end hosts and routers. However, t...
137
click to vote
ICTAC
2004
Springer
15 years 9 months ago
2004
Springer
Scenario based requirements specifications are the industry norm for defining communication protocols. Basic scenarios captured as UML sequence diagrams, Message Sequence Charts ...
139
click to vote
IMC
2003
ACM
15 years 9 months ago
2003
ACM
Routing loops are caused by inconsistencies in the routing state of the network. Although undesirable from this aspect, they can provide insight into the routing dynamics that cau...
141
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...