The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
A comprehensive analytical model for wormhole routing in multicomputer systems
Journal of Parallel and Distributed Computing
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Experimental queueing analysis with long-range dependent packet traffic
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes
IEEE Transactions on Computers
Performance-Based Constraints for Multidimensional Networks
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Self-Similar Network Traffic and Performance Evaluation
Self-Similar Network Traffic and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Wormhole-Switched k-Ary n-Cubes with Bursty Traffic
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
MMR: A High-Performance Multimedia Router - Architecture and Design Trade-Offs
HPCA '99 Proceedings of the 5th International Symposium on High Performance Computer Architecture
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Self-similarity in SPLASH-2 workloads on shared memory multiprocessors systems
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
A Markovian approach for modeling packet traffic with long-range dependence
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Recently a number of studies have indicated that network traffic exhibits noticeable self-similar behaviour, i.e., traffic is bursty over a wide range of time scales. This fractal-like nature of traffic has received significant attention in the networking community as it has a considerable impact on queueing performance. Thus, it is very necessary to examine the performance properties of interconnection networks in the presence of self-similar traffic before practical implementations show their potential faults. However, adopting the simulation approach to evaluate system performance under selfsimilar workloads may be very costly and time-consuming because the convergence of simulations to a steady state is often very slow as burstiness appears over many time scales. This paper proposes the first analytical performance model for k-ary n-cubes with self-similar traffic. The validity of the model is demonstrated by comparing analytical results to those obtained through simulation experiments of the actual system.