ly, we may picture an actor with a mail queue on which all . communications are placed in the order in which they arrive and an actor machine8 which points to a particular cell in the mail queue. The end of a communication on the mail queue can be indicated by some special symbol reserved for the purpose.' We represent this pictorially as in Fig. 3.1. When an actor machine Xn accepts the nth co...

Queue computers are a viable option for embedded systems design. Queue computers feature a dense instruction set, high parallelism, low hardware complexity. In this paper we propose an optimization technique to reduce the overhead of long reaching definitions of variables in queue processors. Long reaching definitions have direct relationship with the queue register file utilization of the proc...

This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...

As the Internet becomes increasingly heterogeneous, the issue of congestion avoidance and control becomes ever more important. And the queue length, end-to-end delays and link utilization is some of the important things in term of congestion avoidance and control mechanisms. In this work we continue to study the performances of the New-AIMD (Additive Increase Multiplicative Decrease) mechanism ...

Current TCP flow control depends on packet losses to find the workload that a network can support. Packet drops not only reduce TCP performance, but also add large transfer delay to the packets. Instead of dropping the overflowed packets, Explicit Congestion Notification (ECN) detects incipient congestion and notifies the sources to reduce their windows when the queue length exceeds a threshold...

This paper proposes a rate-based active queue management algorithm or RAQM. It uses the aggregated traffic input rate to calculate packet drop probability according to an exponential rule. The proposed RAQM algorithm works in two modes: queue-independent and queuedependent. In the queue-independent mode, it only relies on the aggregate traffic input rate to regulate the input rate to the expect...

Active queue management (AQM) is a key congestion control scheme for reducing packet loss and improving network utilization in TCP/IP networks. This paper proposes a proportional–integral-derivative (PID) controller as an active queue manager for Internet routers. Due to the limitations of packet-dropping probability and the effects of propagation delays in TCP networks, the TCP AQM network was...

The main goals of a switch scheme are high utilization, low queuing delay and fairness. To achieve high utilization the Ž . switch scheme can maintain non-zero small queues in steady state which can be used if the sources do not have data to Ž . send. Queue length delay can be controlled if part of the link capacity is used for draining queues in the event of queue build up. In most schemes a s...