Sciweavers

4004 search results - page 92 / 801
» How Many Packets Can We Encode
Sort
View
113
Voted
TON
2008
84views more  TON 2008»
15 years 2 months ago
Trajectory sampling with unreliable reporting
We define and evaluate methods to perform robust network monitoring using trajectory sampling in the presence of report loss. The first challenge is to reconstruct an unambiguous s...
Nick G. Duffield, Matthias Grossglauser
106
Voted
CN
2007
103views more  CN 2007»
15 years 2 months ago
A game theoretic comparison of TCP and digital fountain based protocols
In this paper we analyze a novel paradigm of reliable communication which is not based on the traditional timeout-andretransmit mechanism of TCP. Our approach, which we call Fount...
Luis López, Antonio Fernández, Vicen...
110
Voted
GLOBECOM
2009
IEEE
15 years 5 months ago
Protecting SIP against Very Large Flooding DoS Attacks
—The use of the Internet for VoIP communications has seen an important increase over the last few years, with the Session Initiation Protocol (SIP) as the most popular protocol u...
Felipe Huici, Saverio Niccolini, Nico d'Heureuse
140
Voted
CI
2004
125views more  CI 2004»
15 years 2 months ago
Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory
This paper shows how action theories, expressed in an extended version of the language B, can be naturally encoded using Prioritized Default Theory. We also show how prioritized d...
Tran Cao Son, Enrico Pontelli
122
Voted
DEXAW
2008
IEEE
252views Database» more  DEXAW 2008»
15 years 9 months ago
XML Tree Structure Compression
In an XML document a considerable fraction consists of markup, that is, begin and end-element tags describing the document’s tree structure. XML compression tools such as XMill ...
Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr