Sciweavers

35 search results - page 4 / 7
» ase 2010
Sort
View
ASE
2010
126views more  ASE 2010»
13 years 8 months ago
Generating a checking sequence with a minimum number of reset transitions
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
Robert M. Hierons, Hasan Ural
ICDCS
2010
IEEE
14 years 14 days ago
Guaranteeing BGP Stability with a Few Extra Paths
Abstract—Policy autonomy exercised by Autonomous Systems (ASes) on the Internet can result in persistent oscillations in Border Gateway Protocol, the Internet’s inter-domain ro...
Rachit Agarwal, Virajith Jalaparti, Matthew Caesar...
TON
2010
122views more  TON 2010»
13 years 7 months ago
The (in)completeness of the observed internet AS-level structure
— Despite significant efforts to obtain an accurate picture of the Internet’s connectivity structure at the level of individual autonomous systems (ASes), much has remained un...
Ricardo V. Oliveira, Dan Pei, Walter Willinger, Be...
SIGCOMM
2010
ACM
13 years 8 months ago
Rethinking iBGP routing
The Internet is organized as a collection of administrative domains, known as Autonomous Systems (ASes). These ASes interact through the Border Gateway Protocol (BGP) that allows ...
Iuniana M. Oprescu, Mickael Meulle, Steve Uhlig, C...
ASE
2010
129views more  ASE 2010»
13 years 8 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...