Methods and apparatus for protecting against overload conditions on nodes of a distributed network

Y Afek, A Bremler-Barr, D Touitou - US Patent 7,707,305, 2010 - Google Patents
Methods and apparatus for protecting against and/or responding to an overload condition at
a node (“victim”) in a distributed network divert traffic otherwise destined for the victim to one …

[PDF][PDF] 分组交换网络中队列调度算法的研究及其展望

王重钢, 隆克平, 龚向阳, 程时端 - 电子学报, 2001 - ejournal.org.cn
分组交换网络中队列调度算法的研究及其展望 Page 1 © 1994-2010 China Academic Journal
Electronic Publishing House. All rights reserved. http://www.cnki.net 分组交换网络中队列调度 …

Weighted fair queuing-based methods and apparatus for protecting against overload conditions on nodes of a distributed network

A Bremler-Barr, D Touitou, K Horvitz… - US Patent …, 2008 - Google Patents
An improved network device that controls throughput of packets received thereby, eg, to
downstream devices or to downstream logic contained within the same network device. The …

Achieving high utilization in guaranteed services networks using early-deadline-first scheduling

FM Chiussi, V Sivaraman - … on Quality of Service (IWQoS'98) …, 1998 - ieeexplore.ieee.org
Among packet scheduling disciplines for providing end-to-end quality-of-service (QoS)
guarantees to different applications, two classes of algorithms have received particular …

Authentication of SIP and RTP traffic

C Jennings, D Touitou, D Wing - US Patent 7,568,224, 2009 - Google Patents
(57) ABSTRACT A method for authenticating communication traffic includes receiving a
Session Initiation Protocol (SIP) data packet sent over a network from a source address to a …

Minimum-delay self-clocked fair queueing algorithm for packet-switched networks

FM Chiussi, A Francini - … IEEE INFOCOM'98, the Conference on …, 1998 - ieeexplore.ieee.org
The minimum-delay self-clocked fair queueing (MD-SCFQ) algorithm that we present in this
paper is the first algorithm that achieves the same delay bounds as the packet by packet …

Traffic shaping for end-to-end delay guarantees with EDF scheduling

V Sivaraman, FM Chiussi… - 2000 Eighth International …, 2000 - ieeexplore.ieee.org
The provision of quality of service (QoS) in terms of end-to-end delay guarantees to real-time
applications is an important issue in emerging broadband packet networks. Of the various …

Design of packet-fair queuing schedulers using a RAM-based searching engine

HJ Chao, YR Jenq, X Guo… - IEEE journal on selected …, 1999 - ieeexplore.ieee.org
The implementation of packet-fair queuing (PFQ) schedulers, which aim at approximating
the generalized processor sharing (GPS) policy, is a central issue for providing multimedia …

End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms

W Sun, KG Shin - IEEE/ACM Transactions on networking, 2005 - ieeexplore.ieee.org
This paper evaluates, via both analysis and simulation, the end-to-end (e2e) delay
performance of aggregate scheduling with guaranteed-rate (GR) algorithms. Deterministic …

The complexity of computing virtual-time in weighted fair queuing schedulers

H Tayvar, H Alnuweiri - 2004 IEEE International Conference on …, 2004 - ieeexplore.ieee.org
This paper presents two fundamental theorems that show that the O (N) complexity for
updating the virtual time in a weighted fair queuing (WFQ) scheduler with N sessions is …