An Efficient Approximate Markovian Model for Optical Packet Switches Employing Partial Buffer Sharing Mechanism under Self-Similar Traffic Input
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Abstract
In this paper, we propose an efficient approximate Markovian model for optical packet switch (OPS) employing partial buffer sharing (PBS) mechanism under self-similar traffic input The computation complexity could be greatly reduced while retaining satisfactory accuracy. Accordingly, we investigate and analyze both the short term and long term performance measures. Our model is useful in performing the optimal buffer control for OPS employing PBS to provide differentiated services (DiffServ) under self-similar traffic input.Keywords
This publication has 10 references indexed in Scilit:
- Improvements on performance of photonic packet switching nodes by priority assignment and buffer sharing2002
- Exploitation of DWDM for optical packet switching with quality of service guaranteesIEEE Journal on Selected Areas in Communications, 2002
- Loss behavior in space priority queue with batch Markovian arrival process — discrete-time casePerformance Evaluation, 2000
- On approximating higher order MAPs with MAPs of order twoQueueing Systems, 2000
- A Markovian approach for modeling packet traffic with long-range dependenceIEEE Journal on Selected Areas in Communications, 1998
- Queuing analysis of a non-pre-emptive MMPP/D/1 priority systemComputer Communications, 1997
- On the self-similar nature of Ethernet traffic (extended version)IEEE/ACM Transactions on Networking, 1994
- A single-server queue with server vacations and a class of non-renewal arrival processesAdvances in Applied Probability, 1990
- The n/g/l finite capacity queueCommunications in Statistics. Stochastic Models, 1989
- On the Phase-Type Approximations of General DistributionsIIE Transactions, 1985