Searching for authors named "George Varghese" – sorted by Relevance.
101 documents found, showing 1 through 10.
Next 10 →
-
Trading Packet Headers for Packet Processing
- …In high speed networks, packet processing is relatively expensive while bandwidth is cheap. This begs the question: what fields can be added to packets to make packet processing easier? By exploring this question, we devise a number of novel mechanisms to speed up packet processing. With the advent …
- Cited by 17 (2 self) – Add To MetaCart
-
Dijkstra's Protocols as Examples of Local Checking and Counter Flushing
- …Introduction We will focus on the ability of network protocols to stabilize to "correct behavior" after arbitrary initial perturbation. This property was called self-stabilization by Dijkstra [Dij74]. The "self" emphasizes the ability of the system to stabilize by itself without manual interventio…
- Cited by 1 (0 self) – Add To MetaCart
-
Self-stabilization by Counter Flushing
- …A useful way to design simple and robust protocols is to make them self-stabilizing. A protocol…
- Cited by 34 (6 self) – Add To MetaCart
-
Detecting Evasion Attacks at High Speeds Without Reassembly
- …Ptacek and Newsham [14] showed how to evade signature detection at Intrusion Prevention Systems (IPS) using TCP and IP Fragmentation. These attacks are implemented in tools like FragRoute, and are institutionalized in IPS product tests. The classic defense is for the IPS to reassemble TCP and IP pac…
- Cited by 4 (0 self) – Add To MetaCart
-
Faster IP Lookups using Controlled Prefix Expansion
- …Internet (IP) address lookup is a major bottleneck in high performance routers. IP address lookup is challenging because it requires a longest matching prefix lookup. It is compounded by increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addres…
- Cited by 76 (3 self) – Add To MetaCart
-
Efficient Fair Queuing using Deficit Round Robin
- …Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was …
- Cited by 214 (3 self) – Add To MetaCart
-
Cv
- …ects include: working as part of DEC's Corporate Interconnect Task Force to design DEC's next generation network layer for Clusters, Storage, and Networks (a precursor to Gigabit Ethernet); helping design and writing specification for DEC's Bridge Architecture, later adopted by IEEE as a standard. …
- Add To MetaCart
-
Packet Filtering in High Speed Networks
- …Introduction The commercial viability of the future Internet depends on its ability to provide differentiated service to paying customers. The existing Internet delivers only the socalled best effort (undifferentiated) service. Examples of differentiated service include firewalls for enterprise netw…
- Cited by 7 (0 self) – Add To MetaCart
-
The Fault Span of Crash Failures
- …A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driven to arbitrary global states, where each node is in a state reached in some (possibly different) execution, and each li…
- Cited by 3 (0 self) – Add To MetaCart
-
Hashed and Hierarchical Timing Wheels: Efficient Data Structures for Implementing a Timer Facility
- …Conventional algorithms to implement an Operating System timer module take O(n) time to start or maintain a timer, where n is the number of outstanding timers: this is expensive for large n. This paper shows that by using a circular buffer or timing wheel, it takes O(1) time to start, stop, and mai…
- Cited by 8 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
