Sciweavers

45 search results - page 3 / 9
» Dynamic Packet Routing on Arrays with Bounded Buffers
Sort
View
JCO
2006
126views more  JCO 2006»
13 years 6 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
ICN
2005
Springer
13 years 11 months ago
Packet Scheduling Across Networks of Switches
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
Kevin Ross, Nicholas Bambos
SPAA
2003
ACM
13 years 11 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
USS
2004
13 years 7 months ago
TIED, LibsafePlus: Tools for Runtime Buffer Overflow Protection
Buffer overflow exploits make use of the treatment of strings in C as character arrays rather than as first-class objects. Manipulation of arrays as pointers and primitive pointer...
Kumar Avijit, Prateek Gupta, Deepak Gupta
INFOCOM
1998
IEEE
13 years 10 months ago
Dynamic Flow Switching, A New Communication Service for ATM Networks
This paper presents a new communication service for ATM networks that provides one-way, adjustable rate, on-demand communication channels. The proposed dynamic flow service is des...
Qiyong Bian, Kohei Shiomoto, Jonathan S. Turner