Fair queuing is the mechanism by which routers schedule packets on output links in order to guarantee fairness and latency bounds. Fair queuing, along with with address lookup and switching, is one of the major bottlenecks for routers today. We describe an eecient fair queuing scheme, Leap Forward Virtual Clock , that provides end-to-end delay bounds and throughput fairness comparable to the be...

Virtual Output Queuing is widely used by fixedlength high-speed electronic switches to overcome head-of-line blocking. This is done by means of matching algorithms. These matching algorithms have typically been cell-based. That is, in every time slot, a new matching set is calculated and the switch fabric is updated to connect matched inputs and outputs. Fabric reconfiguration in an optical swi...

Dong-Yong Kwak et al. 475 In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the...

-The performance in terms of reliability of multi-server computer networks motivates this paper. The probability limit theorem is derived on the virtual waiting time of job in nodes in a multi-server open queueing network and applied to a reliability model for multi-server computer networks where we relate the time of failure of a multi-server computer network to the system parameters. Key-Word...

Ration shops are one of the main food product supply centers Government. has an insignificant amount goods, theft material, large waiting time in ration store and they keep all records big paper file. This project is execute to overcome obstacle that exist current distribution system. cards replaced with smart card which required information (name, contact number, aadhar number) saved. Once mat...

This paper presents the integrated queuing and scheduling for an N × N input-queued packet switch that efficiently supports both unicast and multicast traffic. Each input port maintains two sets of queues each for unicast and multicast traffic. For unicast traffic, we deploy the wellknown virtual output queuing scheme. For multicast traffic, we propose a novel queuing scheme in which a small nu...

We present a new Fair Queuing policy adapted to low-bandwidth ows, and preventing discrepancy which is encountered under almost all of the existing Fair Queuing policies. Unlike Packet-by-packet Generalized Processor Sharing PGPS and its version Worst-case Fair, Fair Queuing WF 2 Q which eliminates discrepancy, the proposed scheduling algorithm is computationally eecient hence feasible for high...

The Input-Buffered Wavelength-Routed (IBWR) switch is a promising switching architecture for slotted Optical Packet Switching (OPS) networks. The benefits of the IBWR fabric are a better scalability and lower hardware cost, when compared to output buffered OPS proposals. A previous work characterized the scheduling problem of this architecture as a type of matching problem in bipartite graphs. ...