期刊文献+

网络拓扑与容量的关系初探 被引量:2

Discussion about Network Capability Relevant to Topology Information of Network
下载PDF
导出
摘要 网络服务质量(QoS)是现在计算机网络科学中被广泛关注的热点,大多数基于视频媒体服务的Internet业务都提出了服务质量的要求。不同于已有的基于局部网络拓扑信息的优化方法,文章以Watts等人提出的小世界(SmallWorld)网络作为网络拓扑模型,讨论如何利用全局拓扑信息进行网络资源和性能的优化。以一类小世界网络为例,讨论了捷径(捷径)路径对于网络拓扑容量的影响。经过理论的分析和仿真的实验表明:通过适当的增加捷径路径,可以提高网络的拓扑容量,进而使用户得到更好的网络服务。其中作为例子,该文给出了环形网络和具有规则捷径路径的网络拓扑容量的显示表达式。以小世界网络为研究对象的优点在于小世界网络具有简单性和普遍性,基于此类网络的拓扑容量分析为进一步研究复杂网络的网络拓扑容量问题提供了一条新的途径。 QoS on IP network is now becoming a hot topic in the field of computer science;most of multimedia appli-cations,such as interactive games and videoconference,request network can provide QoS-guaranteed services.This paper tries to calculate the capability of a set of Small World network,which is proposed by D.J.Watts and S.H.Strogatz in1998,relevant to shortcut routes.Theoretical analysis and simulation data show that adding properly shortcuts can result in improvement of transporting capability,that is,users of network can get much bandwidth and smaller delay.For in-stance,this paper has derived the explicit relationship of capability of a serial of Small World network with bandwidth of links and the number of nodes.The advantage of discussing transporting capability based on Small World network model is that Small World network is one of most popular model in the world at present ,and its structure network is so simple that calculation of transporting capability can be quantified,therefore provides a promising way to analyze the network capacity in a network environment.
作者 蔡研 赵千川
出处 《计算机工程与应用》 CSCD 北大核心 2003年第15期178-183,共6页 Computer Engineering and Applications
基金 国家自然科学基金资助(编号:60074012 60274011) 攀登计划预研项目资助(编号:970211017) 清华大学985基础研究基金资助(编号:985信息-07-基金-07)
关键词 服务质量(QoS) 网络拓扑信息 小世界(Small World)网络 网络拓扑容量 QoS,Topology Information,Small World network,Network Capacity
  • 相关文献

参考文献12

  • 1Juttner A,Szviatovski B,Mecs I et al.Lagrange relaxation based method for the QoS routing problem[C].In :INFOCOM 2001, Proceedings,IEEE, 2001 ;2 : 859-868.
  • 2Ghosh D,Sarangan V,Acharya R.Quality-of-service routing in IP networks[J].Multimedia,IEEE Transactions on,2001 ;5(2) :200-208.
  • 3Baoxian Zhang,Krunz M,Mouftah H T et al.Stateless QoS routing in IP networks[C].In : Global Telecommunications Conference, GLOBEC- OM'01 ,IEEE ,2001 ;3 : 1600-1604.
  • 4Bin Wang,Hou J C.Muhicast routing and its QoS extension:problems, algorithms ,and protocols[J].IEEE Network ,2000; 14( 1 ) :22-36.
  • 5Sahasrabuddhe L H,Mukherjee B.Muhicast routing algorithms and protocols :a tutorial[J].IEEE Network ,2000 ; 14( 1 ) :90-102.
  • 6Qing Zhu,Parsa M,Garcia-Luna-Aceves J J.A source-based algorithm for delay-constrained minimum-cost multicasting[C].In : INFOCOM'95,Fourteenth Annual Joint Conference of the IEEE Computer and Communications Societies , "Bringing Information to People', Proceedings .IEEE. 1995 : 377-385.
  • 7Kompella V P,Pasquale J C,Polyzos G C.Multicast routing for multimedia communication[J].Networking,IEEE/ACM Transactions on, 1993 ; 1 (3) :286-292.
  • 8Srihari Nelakuditi,Zhi-Li Zhang,Rose P Tsang.Adaptive Proportional Routing:A Localized QoS Routing Approach[C].In:Proc IEEE INFOCOM'00,Tel Aviv, Israel,2000.
  • 9Martin Heusse,Yvon Kermarrec ,ENST de Bretagne.A New Routing Policy for Load Balancing in Communication Networks[C].In :ACS/IEEE International Conference on Computer Systems and Applications ( AICCSA'01 ), 2001 : 25-29.
  • 10X Yuan,A Saifee.Path Selection Methods for Localized Quality of Service Routing[C].In:The 10th IEEE International Conference on Computer Communications and Networks(IC3N 2001 ) ,Phoenix ,Arizona,2001 : 15-17.

同被引文献19

引证文献2

二级引证文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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