Network capacity allocation for traffic with time priorities

ABSTRACT

The packet switching techniques are undergoing evolution. The conventional 'best effort' approach will no longer be the dominant service. The next generation of IP networks must provide QoS to customers. Inadequacy is obvious when the conventional capacity allocation (CA) models are applied to the new IP architecture. In this paper, we propose several CA models that characterize: (1) the service priority scheme; (2) the service preemption scheme; and (3) the non-Poisson traffic in which the packets follow heavy tailed distributions.

REFERENCES

• 1: Dimitri Bertsekas , Robert Gallager, Data networks (2nd ed.), Prentice-Hall, Inc., Upper Saddle River, NJ, 1992
• 2: E. Gelenbe , G. Pujolle , J. C. C. Nelson, Introduction to queueing networks, John Wiley & Sons, Inc., New York, NY, 1987
• 3: 3. Kingman J. Some inequalities for the queue GI/G/1. Biometrika 1962; 49: 315-324.
• 4: Alan Scheller-Wolf , Karl Sigman, Delay moments for FIFO $GI/GI/s$ queues, Queueing Systems: Theory and Applications, v.25 n.1-4, p.77-95, 1997 [doi>10.1023/A:1019152317954]
• 5: 5. Whitt W. The queuing network analyzer. The Bell System Technical Journal 1983; 62: 2779-2815.
• 6: Will E. Leland , Murad S. Taqqu , Walter Willinger , Daniel V. Wilson, On the self-similar nature of Ethernet traffic (extended version), IEEE/ACM Transactions on Networking (TON), v.2 n.1, p.1-15, Feb. 1994 [doi>10.1109/90.282603]
• 7: 7. Norros I. A storage model with self-similar input. Queuing Systems 1994; 16: 387-396.
• 8: 8. Norros I. On the use of fractional Brownian motion in the theory of connectionless networks. IEEE JSAC 1995; 13: 953-962.
• 9: Vern Paxson, Empirically derived analytic models of wide-area TCP connections, IEEE/ACM Transactions on Networking (TON), v.2 n.4, p.316-336, Aug. 1994 [doi>10.1109/90.330413]
• 10: Vern Paxson , Sally Floyd, Wide area traffic: the failure of Poisson modeling, IEEE/ACM Transactions on Networking (TON), v.3 n.3, p.226-244, June 1995 [doi>10.1109/90.392383]
• 11: 11. Cruz R. A calculus for network delay, Part I: network elements in isolation. IEEE Transactions on Information Theory 1991; 37(1): 114-131.
• 12: 12. Demers A, Keshav S, Shenker S. Analysis and simulation of a fair queuing algorithm. Journal of Internetworking Research and Experience 1990; 1: 3-26.
• 13: Abhay K. Parekh , Robert G. Gallagher, A generalized processor sharing approach to flow control in integrated services networks: the multiple node case, IEEE/ACM Transactions on Networking (TON), v.2 n.2, p.137-150, April 1994 [doi>10.1109/90.298432]
• 14: Nikolaos Anerousis , Aurel A. Lazar, Virtual path control for ATM networks with call level quality of service guarantees, IEEE/ACM Transactions on Networking (TON), v.6 n.2, p.222-236, April 1998 [doi>10.1109/90.664270]
• 15: Jonathan M. Pitts , J. A. Schormans, Introduction to ATM Design and Performance: With Applications Analysis Software, John Wiley & Sons, Inc., New York, NY, 1996

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Packet-switching networks

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

          Nouns: IP
      C.2.5 Local and Wide-Area Networks
          Subjects: Internet (e.g., TCP/IP)
  C.4 PERFORMANCE OF SYSTEMS
      Subjects: Performance attributes

General Terms:
Algorithms, Documentation, Theory