Variable Length Packet Switches: Delay Analysis of Crossbar Switches under Poisson and Self Similar Traffic
نویسندگان
چکیده
We consider crossbar switches for switching variable length packets. Analysis of such switches is important in the context of IP switches where the packet interarrival times and packet lengths are drawn from continuous distributions. Assuming a single stage M N switch we obtain a very general throughput delay model for Poisson packet arrivals and exponential service times. We then analyze an M N switch for self similar packet arrivals and exponential packet lengths. An MMPP-based self similar arrival process model corresponding to the arrival rate, the autocorrelation, the Hurst parameter and the time scales over which burstiness exists in the input process is first obtained using results from [1]. We then use queuing theory available for MMPP/G/1 queues to model the switch performance for self similar packet arrivals. The results from the analytical model are compared against those from a simulation model that is driven by traces that are statistically similar to the Bellcore traces. We also analyse the effect of link multiplicities (speedup) to the output and asymmetries in the input traffic. Keywords—Variable Length Packet Switches, IP Switching, Self Similar Traffic.
منابع مشابه
High-performance variable-length packet scheduling algorithm for IP traffic
A high-performance variable-length packet scheduling algorithm is proposed for efficiently accommodating IP traffic in inputqueued crossbar switches. It uses a rotating priority(round-robin) arbitration and a masking operation for variable-length packets. This algorithm achieves 100% throughput with a single iteration for uniform IP traffic and performs better packet latency and similar cell la...
متن کاملA Parallel-Polled Virtual Output Queued Switch with a Buffered Crossbar
* This material is based upon work supported by the National Science Foundation under Grant No. 9875177. Abstract Input buffered switches with Virtual Output Queues (VOQ) are scalable to very high speeds, but require switch matrix scheduling algorithms to achieve high throughput. Existing scheduling algorithms based on parallel requestgrant-accept cycles cannot natively support variable length ...
متن کاملStarvation Free Scheduler for Buffered Crossbar Switches (RESEARCH NOTE)
Need for high speed internet connectivity has lead to a substantial research in switching systems. Buffered crossbar switches have received a lot of attention from both research and industrial communities due of its flexibility and scalability. Designing a scheduling algorithm for buffered crossbar switches without starvation is a major challenge as of now. In this paper, we proposed a Delay ba...
متن کاملResource Allocation for Quality of Service Provision in Buffered Crossbar Switches with Traffic Aggregation
The capability of providing quality of service (QoS) in packet switches of computer networks is critical to implementation of distributed multimedia systems. The buffered crossbar switching architecture is promising to achieve high performance without complex implementation. In this paper, we study the problem of resource allocation to aggregated traffic classes in buffered crossbar switches fo...
متن کاملNovel High Performance Scheduling Algorithms for Crosspoint Buffered Crossbar Switches
-Crosspoint buffered crossbar switches have gained much attention due to simple distributed scheduling algorithms. However, almost all the algorithms proposed for buffered crossbar switches either have unsatisfactory scheduling performance under non-uniform traffic or poor service fairness between input traffic flows. In order to overcome the disadvantages, in this paper we propose a novel effi...
متن کامل