DOI QR코드

DOI QR Code

Scheduling Performance Evaluation and Testing Functions of a Connection-Oriented Packet Switching Processor

연결지향형 패킷교환 처리기의 스케줄링 성능평가 및 시험 방안 연구

  • Kim, Ju-Young (Department of Industrial and Management Engineering, Hankuk University of Foreign Studies) ;
  • Choi, Ki-Seok (Department of Industrial and Management Engineering, Hankuk University of Foreign Studies)
  • 김주영 (한국외국어대학교 산업경영공학과) ;
  • 최기석 (한국외국어대학교 산업경영공학과)
  • Received : 2013.11.18
  • Accepted : 2013.11.27
  • Published : 2014.02.15

Abstract

In a connection-oriented packet switching network, the data communication starts after a virtual circuit is established between source and destination. The virtual circuit establishment time includes the queue waiting times in the direction from source to destination and the other way around. We use this two-way queueing delay to evaluate scheduling policies of a packet switching processor through simulation studies. In this letter, we also suggest user testing functions for the packet switching processor to manage virtual circuits. By detecting error causes, the user testing helps the packet switching processor provide reliable connection-oriented services.

Keywords

References

  1. Baran, P. (2002), The Beginnings of Packet Switching : Some Underlying Concepts, Communications Magazine, 40(7), 42-48.
  2. Baset, S. A., Misra, V., Rubenstein, D., and Schulzrinne, H. (2010), The Delay-Friendliness of TCP for Real-time Traffic, IEEE/ACM Transactions on Networking, 18(5), 1478-1491.
  3. Chang, W. and Down, D. (2000), Asymptotics for Polling Models with Limited Service Policies, Proceedings of the 39th IEEE Conference Decision and Control, Sydney, Australia.
  4. Choi, W. (2012), Tighter Throughput Lower Bounds of Connectivity-Based Reliable Multicast MAC Protocol for IEEE 802.11 Wireless LANs, Journal of the Korean Institute of Industrial Engineers, 38(4), 235-289.
  5. Cooper, R. B. (1970), Queues Served in Cyclic Order : Waiting Times, The Bell System Technical Journal, 49(3), 399-413. https://doi.org/10.1002/j.1538-7305.1970.tb01778.x
  6. Cooper, R. B. (1972), Introduction to Queueing Theory, Macmillan Company, New York.
  7. Gurbuz, O. (2008), Design and Performance Analysis of an ARQ Scheme for Broadband Wireless Access, IEICE Transactions on Communications, E91-B(6), 1989-1998. https://doi.org/10.1093/ietcom/e91-b.6.1989
  8. Kim, S. H. and Lee, H. H. (1996), On-Line ISDN Packet Protocol Test Using Reference Protocol, Proceedings of the 18th AIC Conference, Beijing, China.
  9. Kuhn, P. J. (1979), Multi-Queue Systems with Non-Exhaustive Cyclic Service, Bell System Technical Journal, 58(3), 671-698. https://doi.org/10.1002/j.1538-7305.1979.tb02239.x
  10. Paik, C. (2011), Queueing Traffic Model of Giving a Priority to Handoff Calls in OFDMA Wireless Communication Systems, Journal of the Korean Operations Research and Management Science Society, 36(3), 45-59.
  11. Rohanimanesh, K., Eydgahi, A. M., Ghavamzadeh, M., and Poorali, B. (1995), Design of an ISDN Terminal, Proceedings of the 1995 IEEE IECON 21st International Conference, Orlando, Florida.
  12. van Vuuren, M. and Winands, E. M. M. (2006), Iterative Approximation of k-Limited Polling Systems, Queueing Systems, 55(3), 161-178.