期刊文献+

A New Congestion Prevention Policy for the Router

A New Congestion Prevention Policy for the Router
下载PDF
导出
摘要 The performance of one router will degrade and the network will have congestion because many packets arrive in the router at the same time. A new congestion prevention policy for router, which is based on the M/G/1 retrial queue with Bernoulli vacation and generic retrial, vacation, setup and service time, is proposed. In this policy, the packets from other routers find the router busy and the packets will be queued in the orbit in accordance with a first-in-first-out (FIFO) discipline which the router starts to process. Only the packet at the head of the queue is allowed access to the router for processing. The ergodical condition of this model is analyzed and the probability generating functions of content of system are obtained. At last, some performance measures and numerical results are given. The performance of one router will degrade and the network will have congestion because many packets arrive in the router at the same time. A new congestion prevention policy for router, which is based on the M/G/ 1 retrial queue with Bernoulli vacation and generic retrial, vacation, setup and service time, is proposed. In this policy, the packets from other routers find the router busy and the packets will be queued in the orbit in accordance with a first-in-first-out (FIFO) discipline which the router starts to process. Only the packet at the head of the queue is allowed access to the router for processing. The ergodical condition of this model is analyzed and the probability generating functions of content of system are obtained. At last, some performance measures and numerical results are given.
出处 《Journal of Shanghai Jiaotong university(Science)》 EI 2006年第3期286-289,共4页 上海交通大学学报(英文版)
基金 China Postdoctoral Science Fund ( No.2005037582) Guangdong Natural ScienceFund (No.05300200)
关键词 congestion prevention retrial queue first-in-first-out (FIFO) 阻塞预防 复审队列 FIFO 计算机网络
  • 相关文献

参考文献10

  • 1Andrew S Tanenbaum.Computer Networks[]..2003
  • 2Artalejo JR.Accessible bibliography on retrial queues[].Mathematical and Computer Modelling.1999
  • 3B. Krishna Kumar and D. Arivudainambi.The M/G/1 retrial queue with Bernoulli schedules and general retrial times[].Computers and Mathematics With Applications.2002
  • 4Langaris,C.Gated Polling Models with Customers in Orbit[].Mathematical and Computer Modelling.1999
  • 5Chan Y.Design and performance evaluation of an improved TCP congestion avoidance scheme[].IEE Proceedings Communications.2004
  • 6Byun H J,Lim J T.On a fair congestion control scheme for TCP Vegas[].Communications Letters.2005
  • 7Sastry N R,Lam S.CYRF: A theory of window- based unicast congestion control[].Networking.2005
  • 8Elcan A.Asymptotic bounds for an optimal state-de- pendent retrial rate of the M/M/1 queue with return- ing customers[].Mathematical and Computer Modelling.1999
  • 9Gomez C A.Analysis of a single-server queue with quasi-random input and nonpreemptive priority[].Computers and Mathematics With Applications.2002
  • 10Zhou W H.Analysis of a single-server retrial queue with FCFS orbit and Bernoulli vacation[].Journal of Applied Mathematics.2005

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部