期刊文献+

适用于流媒体传输的动态门限调度算法 被引量:1

A Dynamic Threshold Schedule Algorithm for Media Traffic
在线阅读 下载PDF
导出
摘要 为保证网络流媒体传输质量,在流媒体传输网络中需要对交换设备实施有效的缓存管理策略.结合流媒体数据对时延和丢包率敏感的特点,提出了一种基于E-Model传输级别的动态门限控制算法(EDTA),将交换设备的缓存管理分为全局门限控制和队列门限控制两部分.全局门限控制通过判断不同的传输场景进行门限控制,保证不同传输场景下的传输性能.队列门限控制则基于E-Model传输级别参数进行门限的划分和调整,保证流媒体的传输质量.实验结果表明该算法能有效改善流媒体的传输性能,对交换设备的缓存资源进行有效控制,并提高网络流媒体传输质量. Real-time multimedia applications are getting more and more popular in the last several years with internet capability keeping improved,in order to guarantee the transmission quality of medium traffic,effective strategies for buffer management are applied in exchanging devices in flow medium network,such as switches and routers.Considering the characteristics of packet delay and loss sensitivity of medium data,this paper proposes a novel dynamic threshold algorithm at media traffic level for shared buffer packet switches,known as dual-dynamic threshold control based on E-model(EDTA).EDTA divides buffer management of switch into two parts: the global threshold strategy and the queue threshold strategy.The global threshold strategy controls the shared buffer by a whole threshold through judging different traffic scenarios to ensure good transmission performance in all situations.The queue threshold strategy decides and adjusts output queue threshold based on E-model traffic levels,which transforms several medium service quality effecting parameters into users' psychological factors,thus guarantees the quality of flow medium data.Experimental results show that our proposed algorithm(EDTA) can improve the traffic performance for flow media more effectively,achieve better quality of network flow medium transmission,comparing with those algorithms using traditional control.And it is suitable to be used in any network condition and can improve the utilization of the network resources.
出处 《计算机研究与发展》 EI CSCD 北大核心 2011年第1期110-117,共8页 Journal of Computer Research and Development
基金 国家"八六三"高技术研究发展计划基金项目(2005AA121410)
关键词 缓存管理 双动态门限 传输级别 公平性 媒体传输 buffer management dual-dynamic threshold traffic level fairness media traffic
作者简介 Wang Xueshun, born in 1970. PhD candidate. His current research interests include quality of service in muitimedia traffic and congestion control of switches.wang_xueshun@ 163. com Yu Shaohua, born in 1962. PhD. Senior engineer and PhD supervisor. His main research interests include IP network and MAN. Xu Ning, born in 1976. PhD candidate. His current research interests include computer network. Dai Jinyou, born in 1968. PhD and senior pr6fessor. His current research interests include multi-service Ethernet and IP network.
  • 相关文献

参考文献11

  • 1Guerin R, Kamat S, Peris V, et al. Scalable QoS provision through buffer management [C]//Proe ACM SIGCOMM 1998. New York: ACM, 1998:29-40.
  • 2Heinanen J, Guerin R. A Two Rate Three Color Marker [S]. New York: Institute of Electrical and Electronics Engineers, 1999.
  • 3Hurley P, Kara M, et al. ABE: Providing a low-delay service within best effort [J]. IEEE Network Mag, 2001, 15 (3) : 60-69.
  • 4宋美娜,宋俊德,战晓苏.高速路由器中一种有效的组播交换排队机制[J].计算机研究与发展,2005,42(5):810-817. 被引量:1
  • 5Yang Juipin, Chu Yuansun, Liang Mingcheng. Threshold- based selective drop for shared buffer packet switches [J]. IEEE Communications Letters, 2003, 7(4) : 183-185.
  • 6Nachio.ndo T, Filch J, Duato J. Buffer management strategies to reduce HOL blocking [J]. IEEE Trans on Parallel and Distributed Systems, 2009, 6 (1) : 1-15.
  • 7Ascia G, Catania V, Panno D. An evolutionary management scheme in high-performance packet switches [J]. IEEE/ACM Trans on Networking, 2005, 13(2): 262-275.
  • 8Chu Y S, Yang J P, Wu C S, et al. Partial sharing and partial partitioning buffer management scheme for shared buffer pxeket switches [J]. IEEE Trans on Communications, 2002, E85-B(1): 79-88.
  • 9Choudhury A K, Hahne E L. Dynamic queue length threshold for shared-memory packet switches [J]. IEEE/ ACM Trans on Network, 1998, 6(2): 130-140.
  • 10Choudhurya G, Cole R. Design and analysis of optimal adaptive de-jitter buffers [EB/OL]. (2006-04-12) [2009-03- 18]. htt://wotan, liu. edu/docis/dbl/cocomm /2004 27 6 529 DAAOOA. htm.

二级参考文献15

  • 1G. Phillips, S. Shenker, H. Tangmunarunkit. Scaling of multicast trees: Comments on the Chuang-Sirbu Scaling law. The ACM SIGCOMM'99, Cambridge, Massachusetts, USA, 1999.
  • 2C. Minkenberg. Integrating unicast and multicast traffic scheduling in a combined input-and-output-queued packetswitching system. ICCCN'2000, Las Vegas, NV, 2000.
  • 3X. Chen, J. F. Hayes. Call scheduling in multicasting packet switching. IEEE ICC'92, Chicago, 1992.
  • 4X. Chen, J. F. Hayes, M. K. Mehmet-Ali. Performance analysis of cyclic-priority input access method for a multicast switch. IEEE INFOCOM'91, Bal Harbour, FL, USA, 1991.
  • 5J.Y. Hui, T. Renner. Queueing strategies for multicast packet switching. IEEE GLOBECOM'90, San Diego, CA, 1990.
  • 6B. Prabhakar, N. McKeown, R. Ahuja. Multicast scheduling for input-queued switches. IEEE Journal on Selected Areas in Communications, 1997, 15(5): 855~866.
  • 7K.J. Schultz, P. G. Gulak. Distributed multicast contention resolution using content addressable FIFOS. IEEE ICC' 94, New Orleans, LA, 1994.
  • 8A. Andrews, S. Khanna, K. Kumarau. Integrated scheduling of unicast and multicast traffic in an input-queued switch. IEEE INFOCOM'99, New York, 1999.
  • 9W.E. Denzel, A. P. J. Engbersen, I. Iliadis. A flexible sharedbuffer switch for ATM at Gb/s rates. Computer Networks and ISDN Systems, 1995, 27(4): 611~624.
  • 10International Business Machines Corporation. IBM PowerPRS (tm) Q-64G Packet Routing Switch Datasheet. http: // www-3. ibm. com/chips/techlib/techlib. nsf/techdocs/C5EAAEA07E36E8EC87256ABF0066ABE5/$ file/prsQ-64Gds_02_pub.pdf, 2001-09-07/2002-08-15.

引证文献1

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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