【作者】 刘聪；

【导师】 王兴伟；

【作者基本信息】 东北大学 ， 计算机软件与理论， 2006， 硕士

【摘要】 在下一代互联网NGI(Next Generation Internet)中随时随地高质量地享受网络服务已经成为人们迫切的要求，客观上要求在通信开始和进行期间支持用户总最佳连接ABC(Always Best Connected)，允许用户以最优方式连接并使用NGI提供的服务，支持在通信期间随时间、地点等的变化以用户透明方式自适应动态调整端到端路由，支持服务质量QoS(Quality of Service)无缝漫游。 本文着重研究了NGI中支持ABC的初始路由算法，包括单播和组播路由。为了更好地支持ABC，路由综合考虑用户QoS需求与满意程度、用户偏爱、用户愿意为应用支付的费用、网络提供商总收益、各个网络提供商收益、网络资源合理分配以及网络负载均衡等问题。为了能够真正实现“全赢”，引入了基于Nash均衡、Pareto最优的微观经济学理论与方法，模糊数学与非合作纯策略二人博弈等相结合的机制。为了体现用户与网络提供商之间的公平性，提出一个简单的资源管理与分配及动态定价策略。另外，还考虑了组播组成员之间费用分摊的公平性和网络提供商之间利润分配的公平性等问题。由于所研究问题是NP完全问题，因此提出了两种群集智能算法，分别基于蚂蚁网络算法和蜂群算法来寻找满足QoS约束的路径或组播树。算法的研究希望能为最终实现NGI提供支持。 为了验证所提出两种算法的可行性以及对算法性能进行评估，基于NS2仿真平台，建立了相应的仿真模型，并对仿真结果进行了分析。通过仿真实验，得到了比较满意的结果，提出的算法能够有效地解决NGI中支持ABC的公平智能QoS路由问题。更多还原

【Abstract】 It has been the urgent demand to enjoy the high quality network service any time and any place in NGI (Next Generation Internet). Obviously, ABC (Always Best Connected)-supported at the beginning of and during the communication is the Internet development trend. That is, allow users both to connect and use services provided by NGI with the best way, support users to adjust end-to-end routing transparently and adaptively any time and any place among communication, and support QoS (Quality of Service) seamless roaming.In this thesis, the research mainly focuses on the ABC-supported initial routing algorithms in NGI, including unicast and multicast routing. To better support ABC, there are many aspects concerned in routing, such as user QoS requirements and satisfaction degree, user preference, user desire charge to pay for applications, profit sum of ISPs (Internet Service Provider), profit of each ISP, reasonable assignment of network resource, and network load balance, etc. To implement "all-win" in deed, a combinative mechanism should be proposed, including Nash-based and Pareto optimum-based microeconomic theory and method, fuzzy mathematics and non-cooperative pure-strategy-based two-player game. To show the fairness between user and ISP, a simple resource management and assignment is proposed, plusing a dynamic pricing strategy. Furthermore, we consider charges apportion fairness among multicast members, and profits apportion fairness among ISPs, etc. On the NP-complete problem, two swarm intelligent algorithms are proposed based on AntNet algorithm and BeeHive algorithm to find QoS-constrainted paths or multicast trees, respectively. We hope that our research can speed up the realization of NGI.To verify the feasibility and evaluate the performance of the proposed two algorithms, a simulated model is created and encoded in NS2 simulating platform. And then, the results of the simulation are analyzed. By simulation research, satisfactory results are obtained. It is shown that the proposed two algorithms can solve the problem of ABC-supported fair intelligent QoS routing in NGI efficiently.更多还原