期刊文献+

基于层次队列的全光缓存技术 被引量:1

Hierarchical Queueing Based Optical Buffer
下载PDF
导出
摘要 为了解决全光分组交换机中的分组缓存问题,提出了一种基于层次队列的全光缓存技术.该技术利用了分组缓存以队列为基本数据结构的特点,将长度逐层翻倍的若干层光纤环存储器用交叉开关组织起来,并将每一层队列的中间部分存储在下一层存储器中,从而实现了一种高效、灵活的缓存机制.这种技术可以用于构造交换设备中各种用途的缓存器.器件复杂度与存储容量呈对数关系,能够提供对服务质量的支持,并可通过使用波分复用(WDM)技术成倍减少光纤使用量. A hierarchical queueing based optical buffer (HQOB) is presented for all optical packet switches. HQOB is in a layered structure. Each layer is a fiber loop buffer group, whose fiber length is multiple of the previous layer. As packets are normally stored in queues, the middle part of a queue can be moved between adjacent layers when needed. Thus HQOB can simulate normal packet buffer with QoS support using much less FDL (fiber delay line) segments (proportional to the logarithm of the buffer depth). The amount of FDLs can be further reduced when WDM (wavelength division multiplexing) is employed.
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2004年第5期26-30,共5页 Journal of Beijing University of Posts and Telecommunications
基金 国家自然科学基金项目(60132020)
关键词 全光缓存器 层次队列 光纤环缓存器 Buffer storage Optical communication Optical fibers Quality of service
  • 相关文献

参考文献3

  • 1[1]Hunter D K, Chia M C, Andonovic I. Buffering in optical packet switches[J]. J Lightwave Technol, 1998,16(12):2081-2094.
  • 2纪越峰.ATM光交换实验系统[J].北京邮电大学学报,2000,23(3):78-82. 被引量:2
  • 3[4]Sundar Iyer, Kompella R R, Nick McKeown. Designing buffers for router line cards[EB/OL]. Stanford University HPNG Technical Report-TR02-HPNG-031001, Stanford, CA. http:∥klamath.stanford.edu/~sundaes/Papers/buffersubmit.pdf, 2002.

二级参考文献4

  • 1[1] VARVARIGOS E.The “Packing” and the “Scheduling Packet” switch architectures for almost all-optical lossless networks[J].J of Lightwave Te chnology,1998,16(10):1 757-1 767.
  • 2[2] HUNTER D K.SLOB:a switch with large optical buffers for pa cket switching[J]. J of Lightwave Technology,1998,16(10):1 725-1 735.
  • 3[3] DANIELSEN S L,JOERGENSEN C,MIKKELSEN B,et al. Optical packet sw itched network layer without optical buffers[J].IEEE Photon Technol Lett, 1998 ,10(6):896-898.
  • 4[4] YAMADA Y,SASAYAMA K,HABARA K,et al.Optical output buffered ATM switch prototype based on frontiernet architecture[J].IEEE J on Selected Areas in Commun, 1998,16(7):1 298-1 308.

共引文献1

同被引文献8

  • 1闫晓东,徐惠民.一种可扩展的分布式副本定位方法[J].北京邮电大学学报,2005,28(3):46-48. 被引量:5
  • 2Carman M, Zini F, Serafini L, et al. Towards an economy-based optimization of file access and replication on a data grid[C]//Proceeding of 2nd IEEE/ACM Int Symposium on Cluster Computing and the Grid. Berlin: IEEE, 2002: 340-345.
  • 3O'Neil E, O'Neil P, Weikum G. The LRU-K page replacement algorithm for database buffering[C]//Int Conf on Management of Data. Washington: IEEE, 1993:297-306.
  • 4Prischepa V. An efficient Web caching algorithm based on LFU-K replacement policy[C]//Proceedings of the Spring Young Researcher's Collo-Quium on Database and Information Systems. Petersburg: IEEE, 2004: 23-26.
  • 5Cao P, Irani S. Cost-aware WWW proxy caching algorithms[C]//USENIX Symposium on Internet Technologies and Systems. California: [s.n.], 1997: 32-35.
  • 6Ekow O, Arie S. Accurate modeling of cache replacement policies in a data grid[ C]//Proceedings of the 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS '03). Washington: IEEE, 2003: 10.
  • 7Ekow O, Olken F, Shoshani A. Disk cache replacement algorithm for storage resource managers in data grids[C]// The 15th Annual Supper Computer Conf. Baltimore: IEEE, 2002: 1-15.
  • 8Bell W, Cameron D, Carvajal-Schiaffino R, et al. Evaluation of an economy-based file replication strategy for a data grid[C]//The International Workshop Agent-Based Cluster and Grid Computing at CCGrid. Tokyo: IEEE, 2003 : 661-668.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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