Sciweavers

321 search results - page 24 / 65
» Testing protocols modeled as FSMs with timing parameters
Sort
View
INFOCOM
1999
IEEE
15 years 4 months ago
A Model for Window Based Flow Control in Packet-Switched Networks
Recently, networks have increased rapidly both in scale and speed. Problems related to the control and management are of increasing interest. The average throughput and end-to-end ...
Xiaowei Yang
97
Voted
BMCBI
2007
172views more  BMCBI 2007»
15 years 17 days ago
msBayes: Pipeline for testing comparative phylogeographic histories using hierarchical approximate Bayesian computation
Background: Although testing for simultaneous divergence (vicariance) across different population-pairs that span the same barrier to gene flow is of central importance to evoluti...
Michael J. Hickerson, Eli Stahl, Naoki Takebayashi
CSFW
2007
IEEE
15 years 6 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
FOCS
2008
IEEE
15 years 7 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
SIGCOMM
2012
ACM
13 years 2 months ago
AutoNetkit: simplifying large scale, open-source network experimentation
We present a methodology that brings simplicity to large and comt labs by using abstraction. The networking community has appreciated the value of large scale test labs to explore...
Simon Knight, Askar Jaboldinov, Olaf Maennel, Iain...