期刊文献+

QoS网络最优节点状态搜索算法研究 被引量:1

Best-fit node-state search algorithm in QoS-based networks
下载PDF
导出
摘要 提出最优节点状态搜索算法,证明能够以最小的代价在网络单节点状态搜索图中找到最符合某种特定网络QoS要求的单节点状态,作为本节点在此次业务传输中的最优状态.则可根据某种网络业务的具体QoS要求,适当选取算法中的代价函数,达到分别满足相应业务QoS保证的目的. A Best-Fit Node-State Search(BFNS) algorithm is presented. The algorithm is proved to find the state of a single node from the node-state searching map that can satisfy the special QoS request at the lowest cost. The found state of the node is regarded as the most appropriate in the network in the given traffic transmission. Then an appropriate cost function can be chosen from the algorithm in order to satisfy specific QoS requriements for a given traffic.
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2005年第6期973-976,共4页 Journal of Xidian University
基金 863资助项目(2001AA115126)
关键词 节点状态 服务质量 最优搜索 node-state QoS best-first search
  • 相关文献

参考文献6

  • 1Wrege D, Knightly E, Zhang H, et al. Deterministic Delay Bounds for VBR Video in Packet-switching Networks: Fundamental Limits and Practical Tradeoffs[J]. IEEE/ACM Trans on Networking, 1996, 4(3): 352-362.
  • 2Reisslein M, Ross K W, Rajagopal S. A Framework for Guaranteeing Statistical QoS[J]. IEEE/ACM Trans on Networking, 2002, 10(1): 27-42.
  • 3Demers A, Keshav S, Shenker S. Analysis and Simulation of a Fair Queueing Algorithm[A]. Proc ACM SIGCOMM'89[C]. [s.l.]: ACM, 1989.
  • 4Georgiadis L, Guerin R, Parekh A. Optimal Multiplexing on a Single Link: Delay and Buffer Requirements[J]. IEEE Trans on Infor, 1997, 43(5): 1 518-1 535.
  • 5Zhang H. Service Disciplines for Guaranteed Performance Service in Packet-switching Neworks[J]. Proceedings of the IEEE, 1995, 83(10): 1 374-1 396.
  • 6Nageshwara Rao V, Kumar V, Ramesh K. A Parallel Implementation of Iterative-deepending-a^#[A]. Proceedings of the National Conference on Articial Intelligence(AAAI-87)[C]. Morgan Kaufmann: AAAI, 1987. 878-882.

同被引文献7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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