基于网络演算的无线Mesh网络QoS性能研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
无线Mesh网络(Wireless Mesh Networks, WMNs)是一种高容量高速率的分布式网络,不同于传统的无线网络,可以看成是一种WLAN和Ad Hoc网络的融合,且发挥了两者的优势。具有可靠性、自组织性和自愈性等特点。随着人们对网络通信需求的增加,人们对无线Mesh网络的要求越来越高,并且希望能够提供QoS保障。因此,无线Mesh网络的QoS性能研究显得越来越迫切和重要。然而,无线Mesh网络的无线多跳通信以及带宽受限等特点,都使得在无线Mesh网络中QoS的研究困难,给广大研究人员提出了挑战。研究提高无线Mesh网络性能,有效实施网络QoS控制,避免网络拥塞,具有重要的研究价值。
     本文以无线Mesh网络的QoS性能问题为主要研究对象,在对无线Mesh网络的流量特征进行深入分析的基础上,针对无线Mesh网络中无线链路不稳定、信道误码率高以及流量的统计性等特点,利用网络演算(Network Calculus)理论系统地研究了基于网络演算的无线Mesh网络QoS性能模型。本文的主要研究成果和创新点如下:
     (1)基于随机/统计网络演算理论,构建了无线Mesh网络流量模型WgSBB(Wireless generalized Stochastically Bounded Burstiness)。
     在总结分析目前国内外网络流量模型主要研究成果的基础上,基于随机/统计网络演算理论,提出了一种适合于无线Mesh网络的业务流的流量模型WgSBB,该模型采用队列长度进行统计描述,构造了无线Mesh网络单节点和多节点的WgSBB流量模型,其突发函数受限于一个最小加卷积函数,表明其具有较严密的边界函数;阐明了它的求和特性和输出流量特征及其输入输出关系,从理论上证明了每个资源的流量特征,研究表明该模型能正确地描述无线Mesh网络业务流量特征的实际情况。
     (2)基于随机/统计网络演算理论,提出了适应于无线Mesh网络网关通信量的贪婪分形漏桶整形器(Greedy Fractal Leaky Bucket, GFLB),推导了GFLB的性能。
     基于随机/统计网络演算理论,给出了适应于无线Mesh网络网关通信量控制的贪婪分形漏桶整形器GFLB的一般数学模型,并推导了GFLB的输出特性、队列长度与延迟等性能,讨论了GFLB的引入对网络端到端延迟以及数据丢失总量的影响,并得出GFLB的引入并不增加系统端到端延迟上界、不增加缓存容量需求等结果。这些分析工作和所得结果对于基于GFLB的业务流控制方案的评价和如何有效地调节和控制网关节点通信流具有实际意义。
     (3)基于随机/统计网络演算理论,推导了基于GFLB的无线Mesh网络网关节点QoS性能随机/统计上界模型。
     网关是无线Mesh网络的性能瓶颈,网关节点的缓存区队列长度上界、延迟上界以及延迟抖动上界在网络规划、设计及配置中具有重要意义。基于已有研究成果,引入GFLB对传输到网关的网络业务流进行整形,运用公平的带宽分配策略,分析了网关节点的QoS性能随机/统计上界模型,给出缓存区队列长度随机/统计上界、延迟随机/统计上界和延迟抖动随机/统计上界。数值分析结果表明:基于GFLB的网关可用带宽能公平地分配给各会话流,并隔离不同的会话流,各会话流互不影响;基于GFLB对网关流量整形,结合公平的带宽分配策略,能为无线Mesh网络网关业务流QoS提供性能上界保证;利用网络演算理论计算基于GFLB的网关QoS性能边界问题具有简单性和实用性。
     (4)基于随机/统计网络演算理论,推导了网关与Mesh路由器端到端QoS随机/统计上界模型。
     网关与Mesh路由器之间端到端QoS性能,其上界能否得到保证将直接影响拥塞和接纳等网络控制算法与策略的有效性。在对网络端到端QoS性能研究方面,利用随机/统计网络演算理论计算网关到Mesh路由器之间端到端通信流QoS性能上界,推导出基于缓存队列共享的无线Mesh网络单节点的队列长度随机/统计上界以及端到端队列长度随机/统计上界、单节点的延迟随机/统计上界、端到端延迟理想随机/统计上界、端到端延迟近似随机/统计上界、端到端延迟抖动随机/统计上界。证明了基于端到端有效服务曲线的无线Mesh网络通信量端到端延迟随机/统计上界具有更好的紧致性。数值分析结果分析表明,基于有效服务曲线和网络演算理论能很好地对无线Mesh网络通信流端到端随机/统计上界进行计算。这对无线Mesh网络环境中提供随机/统计的服务保证的有效控制、调度和管理具有参考价值。
Wireless Mesh Networks (WMNs) is a high capacity and transmission rates distributed network organized in a mesh topology. The difference from conventional wireless networks are WMNs combine WLAN and Ad Hoc networks and possess the advantages of both with reliability, self-organizing and self-healing characteristics. Along with the increasing demand of network communications, more and more reliable WMNs are required. WMNs Quality of Service (QoS) enhancement research, therefore, is important. However, the characteristics of multi-hop routing and bandwidth fairness bring many challenging problems in QoS research. In order to enhance the quality of networks, the research on how to efficiently implement QoS control for WMNs and how to prevent network congestion collapse, has profound impacts.
     In this dissertation, we focus on the QoS performance concerns in WMNs, and carry out our in-depth study the characteristics of traffic in WMNs. Aimming at the WMNs characteristics of instability wireless link, high probability wrong code channel and statistical traffic, this thesis employs Network Calculus theory to elaborate a WMNs QoS performance evaluation model. The research contributes to the development of the body of knowledge surrounding WMNs QoS. Its contributions include the following:
     A new proposed WMNs traffic model WgSBB based on stochastic/statistical network calculus.
     Having reviewed the literature on network traffic modeling, a new traffic model WgSBB is proposed for WMNs based on stochastic/statistical network calculus. It adopts backlog bound as descriptive statistics to represent a single and multiple node(s) traffic model for WMNs. The busty function of the model is constrained under a min-plus algebra, which indicates the model has a rigorous boundary function, then it illustrates the possession of summation and in/outbound traffic characteristics, and the relationship of inbound and outbound traffic. It has been theoretically proved that the model is able to properly depict WMNs traffic characteristics.
     A new proposed greedy fractal leaky bucket shaper GFLB and its performance parameters for WMNs gateway traffic based on stochastic/statistical network calculus.
     In this thesis, a mathematical model of the greedy fractal leaky bucket shaper(GFLB) is proposed for WMNs to optimize or guarantee performance, and a number of corollaries of the greedy fractal leaky bucket shaper are derived, such as input/output, queue length and latency characteristics. Also, a thorough arid sound discussion of the impact of integrating the greedy fractal leaky bucket shaper into network edges on communication latency and the total packets losing is conducted, and it concludes that the migrated greedy fractal leaky bucket shaper has no negative impact on the WMNs. The discussion significantly contributes to other researchers on how to evaluate the greedy fractal leaky bucket shaper traffic control solution and how to effectively adjust and control Mesh gateway traffic.
     A new proposed QoS performance stochastic/statistical upper bound model for GFLB WMNs gateway nodes.
     In WMNs, Mesh gateways are the performance drawback. Upper bound on cache backlog bound, delay and jitter of Mesh gateway node, therefore, play important roles in WMNs planning, designing and deploying. According to the art of the state in WMNs, in this thesis, greedy fractal leaky bucket shaper and strategy for bandwidth distribute fairly are applied at the network edges to analyze the QoS performance statistics upper bound model to assess the upper bound of cache backlog bound, delay and jitter. The experimental data indicates that applied greedy fractal leaky bucket shaper in WMNs gateways can fairly allocate network bandwidth to all network sessions without interfering. With the proposed model, the WMNs traffic QoS performance upper bound can be guaranteed, and it is simple and applicable.
     A new proposed end-to-end QoS stochastic/statistical upper bound model for WMNs gateways and Mesh routers.
     The end-to-end QoS performances between Mesh routers and Mesh gateways are determined in the mean of whether upper bound can be guaranteed. It can directly affect the network control algorithms of network congestion collapse. Therefore, in this thesis, the employment of network calculus to calculate the Mesh routers end-to-end QoS performances upper bound can conclude the stochastic/statistical upper bounds of WMNs single node backlog bound, delay, idealized delay, approximate delay and jitter. The conclusion proves WMNs traffic delay statistics upper bound on service curve has better compactness. The experimental data indicates that the effective service curve and statistics (stochastic) network calculus are suitable for WMNs, and it contributes the development of WMNs traffic control, plan and manage for stochastic/statistical services.
引文
[1]Akyildiz I.F., Wang X., Wang W. Wireless mesh networks:a survey. Computer Networks,2005,47:445-487.
    [2]Akyildiz I.F., Wang X. A Survey on Wireless Mesh Networks. IEEE Radio Communications Magazine, IEEE,2005,43(9):23-30.
    [3]张晖,董育宁,杨龙祥等.无线Mesh网络QoS保障技术综述,南京邮电大学学报(自然科学版),2009,29(2):79-87.
    [4]傲丹,方旭明,马忠建.无线网格网关键技术及其应用.电讯技术,2005(2):16-23.
    [5]Draves R., Padhye J., Zill B. Routing in multi-radio, multi-hop wireless mesh networks. ACM Annual International Conference on Mobile Computing and Networking(MOBICOM), Philadelphia, PA, USA,2004.114-128.
    [6]Zhang L., Yang S., Sun W., et al. Markov-Based Analytical Model for TCP Unfairness over Wireless Mesh Networks. First International Multi-Symposiums on Computer and Computational Sciences, Hangzhou, Zhejiang, China, April 2006(2).642-648.
    [7]Violeta G., Bahareh S., and Edward W. K. End to End Performance and Fairness in Multihop Wireless Backhaul Networks. MobiCom'04, Philadelphia, Pennsylvania, USA,2004.9.287-301.
    [8]Viswanathan H. Mukherjee S. Throughput-range tradeoff of wireless mesh backhaul networks. IEEE Journal on Selected Areas in Communications,2006, 24(3):593-602.
    [9]Imad J. Wu J. A race-Free bandwidth reservation protocol for QoS routing in mobile Ad hoc Networks,37th Annual Hawaii International Conference on System Sciences, Hawaii, Jan.2004.293-302.
    [10]Lianggui L., Guangzeng F. Mean field network based QoS routing scheme in wireless mesh networks. Proceedings of International Conference on Wireless Communications, Networking and Mobile Computing, Wuhan, China, Sept. 2005(2).1110-1113.
    [11]Mansoor A., Randeep B., Li (Erran) L. Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. Proceedings of the 11th annual international conference on Mobile computing and networking MobiCom'05, Cologne, Germany, August 2005.58-72.
    [12]Anindya B., Brian B., Sayandev M., et al. Network deformation:traffic-aware algorithms for dynamically reducing end-to-end delay in multi-hop wireless networks. Proceedings of the 10th annual international conference on Mobile computing and networking, Philadelphia, PA, USA,2004.100-113.
    [13]Roy S., Koutsonikolas D., Das S., et al. High-Throughput Multicast Routing Metrics in Wireless Mesh Networks.26th IEEE International Conference on Distributed Computing Systems, Lisboa, Portugal,2006.48-48.
    [14]802.11s tackles mesh networks, http://www.nwfusion.com/newsletters/wireless/2004/0621 wireless 1. html.
    [15]Srikrishna D., et al. Selection of routing paths based upon path quality of a wireless mesh network. Patent No US2004008663, Jan 15 2004.
    [16]Seo C.E., Leonardo E.J., Cardieri P., et al. Performance of IEEE 802.11 in wireless mesh networks. IEEE MTT-S International Conference on Microwave and Optoelectronics, Brasilia, Brazil, July 2005.363-367.
    [17]Lei C., et al. QoS-Aware routing based on bandwidth estimation for mobile Ad hoc networks. IEEE Journal on Selected Areas in Communications, March 2005, 23(3):561-572.
    [18]Vidhyashankar V., Manoj B.S. and Siva Ram Murthy C. Slot allocation schemes for delay sensitive traffic support in asynchronous wireless mesh networks. Computer Networks,2006,50(15):2595-2613.
    [19]Braunstein B., Trimble T., Mishra R., et al. On The Traffic Behavior of Distributed Wireless Mesh Networks. International Symposium on a World of Wireless, Mobile and Multimedia Networks, Niagara Falls, New York, June 2006. 581-586.
    [20]Lianggui L., Guangzeng F. Research on Multi-constrained QoS Routing Scheme Using Mean Field Annealing. Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, Dalian, China, Dec.2005. 181-185.
    [21]Jianfeng C., Caixia C., Qian G. A Bandwidth Allocation Model with High Concurrence Rate in IEEE802.16 Mesh Mode, Asia-Pacific Conference on Communications, Perth Australia, Oct.2005.750-754.
    [22]Luigi I., Serge F. MRS:a simple cross-layer heuristic to improve throughput capacity in wireless mesh networks. Proceedings of the 2005 ACM conference on Emerging network experiment and technology CoNEXT'05, Tou;ouse, France, 2005.21-30.
    [23]Xiaojing T., Kunz T., Falconer D. Traffic balancing in wireless MESH networks. International Conference on Wireless Networks, Communications and Mobile Computing, Maui, Hi, June 2005(1).169-174.
    [24]Rui Z., Bernhard W. Decentrally controlled wireless multi-hop mesh networks for high quality multi-media communications. Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems MSWiM'05, Montreal, Quebec, Canada,2005.200-208.
    [25]中国互联网络信息中心.中国互联网络发展状况统计报告[EB/OL],http://www.cnnic.net.cn/images/2006/download/2006011701.pdf,2006.1
    [26]Tang D., Baker M. Analyzing wireless LAN[Ph D dissertation]. Stanford, California:Department of Computer Science, University of Stanford,2000.
    [27]王楠,侯紫峰,陈军等.基于分形理论的无线链路性能分析[J].计算机学报,2003,26(9):1078-1085.
    [28]尹首一,林孝康.无线Mesh网络流量自相似性研究[J].电信科学,2005,21(4):53-55.
    [29]Leland W., Taqqu M.S., Willinger W., et al. On the Self-Similar Nature of Ethernet Traffic (Extended Version)[J]. IEEE/ACM Transactions on Networking,1994, 2(1):1-15.
    [30]Paxson V., Floyd S. Wide Area Traffic:The Failure of Poisson Modeling[J]. IEEE/ACM Transactions on Networking,1995,3(3):226-244.
    [31]Park K., Willinger W. Self-Similar Network Traffic and Performance Evaluation[M]. New York:John Wiley & Sons,2000.
    [32]吴昱静,孙海荣,李乐民.长期相关过程的自相关对排队性能的影响[J].电子 学报,1999,27(6):92-95.
    [33]Willinger W., Wilson D., Taqqu M.S. On Traffic Measurements that Defy Traffic Models (and vice versa):Self-Similar Traffic Modeling for High-Speed Networks[J]. ConneXions,1994,8(11):14-24.
    [34]Erramilli A., Narayan O., Willinger W. Experimental Queuing Analysis with Long-Range Dependent Packet Traffic [J]. IEEE/ACM Transactions on Networking,1996,4(2):209-223.
    [35]Grossglauser M., Bolot J. On the Relevance of Long-Range Dependence in Network Traffic[J]. IEEE/ACM Transactions on Networking,1999,7(5):629-640.
    [36]Ryu B., Lowen S. Point Process Approaches for Modeling and Analysis of . Self-Similar Traffic, Part II-Applications[A]. In:Proceedings of the 5th International Conference on Telecommunications Systems, Modeling, and Analysis[C]. Nashville, TN,1997.62-70.
    [37]方旭明.移动Ad hoc网络研究与发展现状[J].数据通信,2003,(4):15-23.
    [38]方旭明,何蓉等.短距离无线与移动通信[M].北京:人民邮电出版社,2004.
    [39]Chlamtac I., Conti M., Liu J. Mobile Ad hoc networking:imperatives and challenges[J], Ad hoc Networks,20031(1):13-64.
    [40]Richard D., et al. Routing in multimedia-radio. multi-hop wireless mesh networks. In:Proceedings of the 10th annual International Conference on Mobile Computing and Networking, Philadelphia, PA, USA,2004.114-128
    [41]Luo R., Belis D., Edwards R.M., et al. A simulation design for link connection-oriented wireless mesh networks[J]. Mobile and Wireless Communications Network,2002,12(10):665-669.
    [42]Kee N.T., Yin F.K., Moh L.S. Voice performance study on single radio multihop IEEE 802.11b systems with chain topology. In:The 13th IEEE International Conference on Networks, Kuala Lumpur, Malaysia,2005.16-18.
    [43]孙伟峰.基于802.11无线-有线结合网络的QoS研究:[博士学位论文].合肥:中国科学技术大学,2007.
    [44]Shenker S., Partridge C., Guerin R. Specication of guaranteed quality of service [EB/OL]. RFC2212,1997.
    [45]Firoiu V., Le Boudec J.Y., Towsley D, et al. Theories and Models for Internet Quality of Service[J], Proceedings of the IEEE,2002,90(9):1565-1591.
    [46]Cruz R. L. A calculus for network delay, part I and II[J]. IEEE Transactions on Information Theory,1991,37(l):114-141.
    [47]Chang C.S., Cruz R.L., Le Boudec J.Y., and Thiran P. A min-plus system theory for constrained traffic regulation and dynamic service guarantees. In Technical Report SSc/1994/024 EPFL, July 1999
    [48]Chang C.S. Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Transactions on Automatic Control,39(5):9136931, May 1994
    [49]Chang C.S. On deterministic traffic regulation and service guarantees:a systematic approach by filtering. IEEE/ACM Transactions on Information Theory, 44(3):1097(?)1110,1998
    [50]Le Boudec J.Y., Thiran P. Network Calculus:A Theory of Deterministic Queuing System for the Internet. London, Britain:Springer Verlag; 2004.
    [51]Baccelli F., Cohen G, Olsder G.J., et al. Synchronization and Linearity. An Algebra for Discrete Event Systems[M]. John Wiley and Sons,1992.
    [52]Patek S. D., Liebeherr J., Burchard A. A calculus for end-to-end statistical service guarantees[R]. Technical Report CS-2001-19, University of Virginia, Department of Computer Science,2001.1-21.
    [53]Ciucu F., Burchard A., Liebeherr J. Scaling Properties of Statistical End-to-End Bounds in the Network Calculus [J]. IEEE Transactions on Information Theory,2006,52(6):2300-2312.
    [54]Vojnovic M., Le Boudec J.Y. Stochastic analysis of some expedited forwarding networks. In:INFOCOM 2002. New York, USA.2002.1004-1013.
    [55]Cruz R.L. Quality of service guarantees in virtual circuit switched networks[J]. IEEE Journal on Selected Areas in Communications,1995,13(6):1048-1056.
    [56]Fidler M. Elements of Probabilistic Network Calculus Applying Moment Generating Functions, Preprint Series of the Institute Mittag-Leffler, The Royal Swedish Academy of Sciences.2005. Report No.12.
    [57]张奇智,张彬,张卫东.基于网络演算计算交换式工业以太网中的最大延迟[J].控制与决策,2005,20(1):117-120.
    [58]王子君,许维胜,王中杰.控制网络的确定性延迟演算理论研究[J].电子学报,2006,34(2):380-384.
    [59]Wang X., Liu J., Chen G. Analysis of Bottleneck Delay and Throughput in Wireless Mesh Networks. Proceedings of the IEEE MASS. Vancouver, Canada, 2006.765-770.
    [60]杨盘隆,陈贵海.无线网状网容量分析与优化理论研究[J].Journal of Software,2008,19(1):111-125.
    [61]张勇,蔡杰,宋梅,等.无线mesh网络公平性研究[J].中国科学技术大学学报,2007,37(2):164-170.
    [62]Jangeun J., Sichitiu M.L.. Fairness and QoS in multihop wireless networks. In: Proceedings of the Vehicular Technology Conference. Orlando, Florida, USA.2003. 2936-2940.
    [63]Kamran J., Paul A.S. Experiences using Gateway-Enforced Rate-Limiting Techniques in Wireless Mesh Networks. In:Wireless Communications and Networking Conference, Kowloon, China.2007.3725-3730.
    [64]Norihiko S., Takeo F. Multi Antenna Utilization Scheme for Congestion Avoidance Around the Gateway for Wireless Mesh Networks. In:Personal, Indoor and Mobile Radio Communications, Athens, Greece.2007.1-5.
    [65]Liu T., Liao W. Location-Dependent Throughput and Delay in Wireless Mesh Networks[J]. IEEE Transactions on Vehicular Technology,2008, 57(2):1188-1198.
    [66]Kyasanur P., Vaidya N.H. Routing and interface assignment in multi-channel multi-interface wireless networks. In:Wireless Communications and Networking Conference, New Orleans, LA.2005.2051-2056.
    [67]So J., Vaidya N.H. Routing and channel assignment in multi-channel multi-hop wireless networks with single-nic devices:University of Illinois at Urbana-Champaign, Technical Report,2004.1-12.
    [68]Jungmin S., Nitin H.V. Routing and Channel Assignment in Multi-Channel Multi-Hop Wireless Networks with Single Network Interface. Invited Paper, In: The Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks(QSine), Orlando, FL, USA,2005.1-20.
    [69]Jungmin S., Nitin V. Multi-Channel MAC for Ad Hoc Networks:Handling Multi-Channel Hidden Terminals Using A Single Transceiver. In:The fifth ACM International Symposium on Ad Hoc Networking and Computing (Mobihoc), Roppongi Hillss, Tokyo, Japan, Technical Report,2004.1-41.
    [70]Wang W., Liu X. A Framework for Maximum Capacity in Multi-channel Multi-radio Wireless Networks. In:Consumer Communications and Networking Conference(CCNC 2006), Las Vegas, NV.2006.720-724.
    [71]Pradeep K.r, Nitin H.V. Capacity of MultiChannel Wireless Networks:Impact of Channels, Interfaces and Interface Switching Delay, Technical Report,2006.1-41.
    [72]张信明.聚集业务流特性与QoS性能界限的研究[J].计算机科学,2004,31(12):31-33.
    [73]Koubaam A., Alves M., Tovar E. GTS Allocation Analysis in IEEE 802.15.4 for Real-Time Wireless Sensor Networks. In:International Parallel and Distributed Processing Symposium, Rhodes Island, Greece.2006.25-29.
    [74]张连明,陈志刚,黄国盛.网络演算理论及应用研究[J].计算机工程与应用,2006,42(27):8-11.
    [75]谭献海,李明辉,金炜东.网络演算在Intserv中的应用研究[J].微电子学与计算机,2001,24(11):60-63.
    [76]赵欣.基于网络演算的延迟计算方法与应用[硕士学位论文].武汉:武汉大学,2002.
    [77]武姗姗,于戈,吕雁飞等.数据流处理中确定性QoS的保证方法[J].软件学报,2008,19(8):2066-2079.
    [78]唐宇波,段金蓉,刘玉嘉.基于网络演算的测控局域网时延性能分析方法研究[J],飞行测控学报,2006,25(6):74-80.
    [79]谭献海,孙慧丽,黎燕敏等.自相似业务网络性能分析,计算机工程与设计[J],2007,28(19):4642-4644,4718.
    [80]胡晓娅,朱德森,汪秉文.基于网络演算的交换式以太网实时特性分析,计算机工程与应用[J],2008,44(1):21-24.
    [81]张信明.基于网络演算的Internet QoS控制模型[博士学位论文].合肥:中国科学技术大学,2002.
    [82]张信明,陈国良,顾钧.基于网络演算计算保证服务端到端延迟上界[J].软件 学报,2001,12(6):889-893.
    [83]JENS S., UTZ R. Worst Case Dimensioning of Wire-less Sensor Networks under Uncertain Topologies. In:Proceedings of the 3rd IEEE International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, (WiOpt'05) workshop on Resource Allocation in Wireless Networks, Riva del Garda, Italy,2005.
    [84]JENS S., UTZ R. Sensor Network Calculus-A Framework for Worst Case Analysis. In:Proceeding of the International Conference on Distributed Computing in Sensor Systems, Marina del Rey, USA,2005:141-154.
    [85]Barta P., Nemeth F., Szabo R., et al. End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks. In:IEEE Symposium on Computers and Communications. Hammamet, Tunisia,2001.282-287.
    [86]Florin C., Almut B.d, Jorg L. A Network Service Curve Approach for the Stochastic Analysis of Networks. In:Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems, Banff, Alberta, Canada.2005.279-290.
    [87]Mao S., Shivendra S.P., Hou Y.T. On Minimizing End-to-End Delay with Optimal Traffic Partitioning [J]. IEEE Transctions on Vehicular Technology, 2006,55(2):681-690.
    [88]Agharebparast F., Victor C.M. LINK-LAYEMR MODELING OF A WIRELESS CHANNEL USING STOCHASTIC NETWORK CALCULUS. In:Canadian Conference on Electrical and Computer Engineering, Niagara Falls,Ontario,Canada,2004.1923-1926.
    [89]Agharebparast F, Victor C.M. Modeling Wireless Link Layer by Network Calculus for Efficient Evaluations of Multimedia QoS. In:IEEE International Conference on Communications(ICC). Seoul, Korea (South),2005(2).1256-1260.
    [90]Lelarge M., Liu Z., Xia C.H. Asymptotic Tail Distribution of End-to-End Delay in Networks of Queues with Self-Similar Cross Traffic[A]. In:Proceedings of IEEE INFOCOM'04[C], Hong Kong,2004,4:2352-2363.
    [91]张连明.基于网络演算的自相似网络性能上界模型研究:[博士学位论文].长沙:中南大学,2006.
    [92]CRUZ R.L. A calculus for network delay-part I:Network element in isolation [J], IEEE Transactions Information Theory,1991,37(1):114-131.
    [93]YARON O., SIDI M. Performance and stability of communication networks via robust exponential bounds[J]. IEEE/ACM Transactions Networking,1993, 1(1):372-385.
    [94]STAROBINSKI D., SIDI M. stochastically bounded burstiness for communication networks[J]. IEEE Transactions Information Theory,2000,46(1):206-212.
    [95]YIN Q.H., JIANG Y.M., JIANG S.M., et al. Analysis on generalized stochastically bounded bursty traffic for communication networks [A]. In:Proceedings of 27th Annual IEEE International Conference on Local Computer Networks(LCN'02)[C], Tampa, Florida,2002.141-149.
    [96]Muscatiello L., Mellia M., Meo M., et al. A Simple Markovian Approach to Model Internet Traffic at Edge Routers, COST279, Technical Document, TD(03)032,May 2003.
    [97]David L.J., Benjamin M. The Transition and Autocorrelation Structure of TES Processes Part Ⅱ:Special Cases, Stochastic Models,1992,8(3):499-527.
    [98]BRUNO R., CONTI M., GREGORI E. Mesh networks:commodity multihop ad hoc networks[J]. IEEE Communications Magazine,2005,43(3):123-131.
    [99]LIU Y, THAM C.K., JIANG Y.M. A Stochastic Network Calculus (revised)[R]. ECE-CCN-0301, National University of Singapore, November 2004.
    [100]Turner J.S. New directions in communications (or which way to the information age?) [J]. IEEE Communications Magazine,1986,24(10):8-15.
    [101]Fonseca N.L., Mayor G.S., Neto C.A. On the equivalent bandwidth of self-similar sources[J]. ACM Transactions on Modeling and Computer Simulation,2000, 10(2):104-124.
    [102]Procissi G., Garg A., Gerla M., et al. Token Bucket Characterization of Long-Range Dependent Traffic[J]. Computer Communication,2002, 25(11):1009-1017.
    [103]Laskin N., Lambadaris I., Harmantzis F.C., et al. Fractional Levy Motion and its Application to Network Traffic Modeling[J]. Computer Networks,2002,40(3): 363-375.
    [104]Rainer B., Simon H., Vincent L., et al. Routing Packets into Wireless Mesh Networks. In:Wireless and Mobile Computing, Networking and Communications. New York:2007.38-38.
    [105]张信明,陈国良,顾钧.基于网络演算的流量整形模型[J].软件学报,2002,13(12):2225-2230.
    [106]Cruz R.L., Chang C.S., Le Boudec J.Y., et al. A min,+ system theory for constrained traffic regulation and dynamic service guarantees [J]. IEEE/ACM Transactions on Networking,2002,10(6):805-817.
    [107]张连明,陈志刚,赵明,等.基于分形整形器的GPS系统性能确定上界研究[J].通信学报,2007,28(2):51-57.
    [108]Prasant M., Jian L., Chao G. QoS in Mobile Ad Hoc Networks[J]. IEEE Wireless Communications.2003,10(3):44-52.
    [109]薛小平,李欣,张思东.基于路由生存时间的Ad Hoc QoS路由[J].北京交通大学学报:自然科学版,2007,31(2):23-28.
    [110]岳然,吴伟强,张钦宇,等.UWB-ad hoc网络中MAC协议性能的研究[J].通信学报2007,28(7):111-117.
    [111]Lee K.Y., Hwang J.B., Ryoo J.D. End-to-end QoS routing in physically hierarchical wireless ad-hoc networks. In:IEEE Vehicular Technology Conference. Stockholm, Sweden.2005.2488-2492.
    [112]Zhang B., Mouftah H.T. QoS routing for wireless ad hoc networks:problems, algorithms, and protocols[J]. Communications Magazine, IEEE,2005,43(10):110-117.
    [113]张连明,黄大足,陈志刚.基于分形漏桶的长程相关业务端到端延迟上界模型[J],通信学报,2008,29(7):32-38.
    [114]高岭,李增智,王峥等.缓冲区有限流量整形器性能参数的最小加代数表示[J].西安交通大学学报,2005,39(10):1068-1071.
    [115]Zhu C.H., Pei C.X., Li J.D. Functional Networks Based Internet End-to-End Delay Dynamics[A]. In:Proceedings of the 18th International Conference on Advanced Information Networking and Application (AINA'04)[C], Fukuoka, Japan:IEEE Computer Society,2004,2:540-544.
    [116]Goyal P., Lam S.S, Vin H.M. Determining End-to-End Delay Bounds in Heterogeneous Networks[J]. Multimedia System,1997,5(3):157-163.
    [117]Sariowan H., Cruz R.L., Polyzos G.C. SCED:A generalized scheduling policy for guaranteed quality-of-service[J]. IEEE/ACM Transactions on Networking,1999, 7(5):669-684.
    [118]Lombardo A., Morabito G, Schembra G. Statistical traffic modeling and guaranteed service disciplines:a performance evaluation paradigm[J]. Computer Networks,2001,36(5/6):579-595.
    [119]Cruz R.L. SCED+:Efficient management of quality of service guarantees [A]. In: Akyildiz I, ed. Proceedings of the IEEE INFOCOM'98[C]. New York:IEEE Communications Society,1998,2:625-634.
    [120]Boorstyn R.R, Burchard A., Liebeherr J., et al. Statistical service assurances for traffic scheduling algorithms[J]. IEEE Journal on Selected Areas in Communications Special Issue on Internet QoS,2000,18(12):2651-2664.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700