Ipv6任播地址解析协议分析与应用

任播技术是一种新的网络应用。任播通信是支持导向服务地址的,但是目前IPv6中它的很多定义是模糊的,并且在控制路由方面没有达成一致的协议标准,因此节点间任播通信仍然无法实现。     

移动IPv6路由技术研究

详细介绍IPv6的基本工作机制以及关键的路由技术,并提出在支持IPv6的路由器中引入快表机制,保存漫游到该路由器所在子网中的移动节点的相关信息。针对当前移动IPv6技术的的不足提出改进方案。     

工信部制定IPV6技术标准计划

近日,工信部下发“关于印发2011年第二批行业标准制修订计划的通知”,其中明确IPV6技术标准相关项目计划2012年完成,具体包括IPv6技术要求多接口业务流切换管理、IPv6技术要求适用于低功耗有损网络的IPv6协议、IPv6测方法适用于低功耗有损网络的IPv6协议、支持IPv6访问的Web服务器的技术要求和测试方法、IPv6路由适用于低功耗有损网络的IPv6路由协议、IPv6路由测试方法适用于低功耗有损网络的IPv6路由协议、     

IP组播路由协议的研究与实现

概述了组播路由协议，分析了协议独立的组播路由－稀疏模式（PIM－SM）的缺陷，提出多个会聚点（RPs)的PIM－SM的改进机制，多个RPs机制有效地提高了原有单个RP的PIM－SM协议的健壮性，有利于实现负载均衡、分类业务及提高系统的容错性能，并讨论多个RPs机制的开销问题。分析了PIM－SM实现细节和组播技术的前景。     

基于分组差错控制的轨道交通ATS信号可靠组播技术研究

为解决轨道交通中ATS信号组播丢包问题,拟定一种基于分组差错控制的可靠组播传输协议。该协议不需要路由器的支持,在每个接收节点都定义一个申请重传权值列表,根据组播丢包情况,动态更新接收节点的权值列表,从而为接收节点选择最佳的重传请求处理节点,以提高数据重传效率。仿真实验表明：在多个分组中,将该文所提出的基于分组差错控制的可靠组播传输协议应用于轨道交通中ATS信号仿真系统中,与传统的可靠组播传输协议相比,能有效减少差错修复时延,并提高系统整体的吞吐率。     

网络通信中动态路由协议的应用和漏洞的防范措施

计算机网络通信系统作为一个复杂的系统,路由器在每个网络中起到关键的作用,如果一方路由被破坏或者一方路由被成功的欺骗,网络的完整性将受到严重的破坏,存在着man-in-the-middle攻击、拒绝服务攻击、数据丢失、网络整体性破坏和信息被嗅探等攻击,很多公司的路由器都有自主开发的动态路由协议,而这些协议在网络通信中也有重要的作用,基于对这种路由协议的关注,路由和路由协议的漏洞是亟待解决的问题,如RIP(路由信息协议)、IGP(内部网关协议)、SPF(最短路径优先协议)。     

浅析MIPv6

目前,基于IPv4的移动IPv4技术在实际应用中越来越暴露出其不足之处,因而IETF制定了下一代网络协议IPv6,而移动IPv6作为IPv6协议不可分割的一部分,解决移动IPv4的地址和"三角路由"等问题。     

在协议集成测试系统上开展路由协议测试

在分析路由协议的特性及其测试需求的基础上，提出利用窗口黑盒来描述被测协议，利用多通道测试方法扩展对被测实现的控制和观察，通过扩充参考实现增强系统的测试能力。将这些理论，技术应用于系统中，对路由协议开展了有效的测试活动，为国产高性能路由器的开发提供了有力的支持，也进一步增强了PITS系统的功能和适用性。     

基于IGMP协议的移动安全移动组播访问控制方案

结合现有的不同移动组播访问控制方案的优点,给出了一个基于IGMP协议的移动安全移动组播访问控制方案。该方案由边缘路由器（Edge Router,ER）和移动组播管理中心（Mobile Multieast Manager,MMM）组成。边缘路由器拦截用户申请加入移动组播组的IGMP请求报文,转发给移动组播管理中心;移动组播管理中心根据定义的访问策略处理请求,返回决策信息;边缘路由器根据移动组播管理中心的决策信息处理相应的请求,决定是否允许用户加入移动组播组,从而实现移动组播访问控制机制。     

浅析局域网路由协议的选择

如果网络中只有一个路由器,不需要使用路由协议;只有当网络中具有多个路由器时,才有必要配置路由协议让它们去共享信息。如果仅有小型网络,完全可以通过静态路由手动地更新路由表。要配置路由协议,首先设计的问题就是选择哪种路由协议,本文介绍常见几种路由协议的,尤其对最常用的OSPF协议进行分析,对其优点、使用注意及潜在问题进行总结,以便针对网络的具体情况选择合适的路由协议。     

NS-2的SSM协议仿真扩展研究

对SSM实现中的关键技术进行了研究,在此基础上分析了基于NS-2的IP组播模拟器的结构与原理.通过对NS-2中的IP组播路由仿真模块结构的修改,实现对SSM协议的仿真扩展.     

Bandwidth-Efficient Geographic Multicast Routing Protocol for Wireless Sensor Networks

We present geographic multicast routing (GMR), a new multicast routing protocol for wireless sensor networks. It is a fully localized algorithm that efficiently delivers multicast data messages to multiple destinations. It does not require any type of flooding throughout the network. Each node propagating a multicast data message needs to select a subset of its neighbors as relay nodes towards destinations. GMR optimizes the cost over progress ratio where the cost is equal to the number of neighbors selected for relaying and the progress is the overall reduction of the remaining distances to destinations. Such neighbor selection achieves a good tradeoff between the bandwidth of the multicast tree and the effectiveness of the data distribution. Our cost-aware neighbor selection is based on a greedy set merging scheme achieving a O(Dnmin(D,n)³) computation time, where n is the number of neighbors of current node and D is the number of destinations. As in traditional geographic routing algorithms, delivery to all destinations is guaranteed by applying face routing when necessary. Our simulation results show that GMR outperforms position based multicast in terms of cost of the trees and computation time over a variety of networking scenarios     

QoS Aware Multicast Routing Protocol for Video Transmission in Smart Cities

In recent years, Software Defined Networking (SDN) has become an important candidate for communication infrastructure in smart cities. It produces a drastic increase in the need for delivery of video services that are of high resolution, multiview, and large-scale in nature. However, this entity gets easily influenced by heterogeneous behaviour of the user's wireless link features that might reduce the quality of video stream for few or all clients. The development of SDN allows the emergence of new possibilities for complicated controlling of video conferences. Besides, multicast routing protocol with multiple constraints in terms of Quality of Service (QoS) is a Nondeterministic Polynomial time (NP) hard problem which can be solved only with the help of metaheuristic optimization algorithms. With this motivation, the current research paper presents a new Improved Black Widow Optimization with Levy Distribution model (IBWO-LD)-based multicast routing protocol for smart cities. The presented IBWO-LD model aims at minimizing the energy consumption and bandwidth utilization while at the same time accomplish improved quality of video streams that the clients receive. Besides, a priority-based scheduling and classifier model is designed to allocate multicast request based on the type of applications and deadline constraints. A detailed experimental analysis was carried out to ensure the outcomes improved under different aspects. The results from comprehensive comparative analysis highlighted the superiority of the proposed IBWO-LD model over other compared methods.     

Distributed multicast routing algorithm with dynamic performance in multimedia networks

The delay and delay variation-bounded multicast tree (DVBMT) problem is known to be NP-complete. In this paper, we propose an efficient distributed dynamic multicast routing algorithm to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed, and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms, and performs excellently in delay variation performance under lower time complexity, which ensures it to support the requirements of real-time multimedia communications more effectively.     

一种基于多播路由图的最小子树图搜索算法

提出了一种基于网络编码的新的多播路由算法,该算法在搜索信源节点到各接收者路径族的过程中,考虑了不同路径族之间链路的共享,以降低带宽资源消耗,提高网络性能.基于得到的多播路由图,提出了一种最小子树图搜索算法,并利用最小子树图的性质,对相应于多播路由图的子树图进行化简.最后,在最小子树图上进行有效的网络编码,所有的网络编码问题可以简化为搜索多播网络的最小子树图问题.     

Energy Efficient Ambience Awake Routing with OpenFlow Approach

A major problem in networking has always been energy consumption. Battery life is one parameter which could help improve Energy Efficiency. Existing research on wireless networking stresses on reducing signaling messages or time required for data transfer for addressing energy consumption issues. Routing or Forwarding packets in a network between the network elements like routers, switches, wireless access points, etc., is complex in conventional networks. With the advent of Software Defined Networking (SDN) for 5G network architectures, the distributed networking has embarked onto centralized networking, wherein the SDN Controller is responsible for decision making. The controller pushes its decision onto the network elements with the help of a control plane protocol termed OpenFlow. Decentralized networks have been largely in use because of their ease in physical and logically setting the administrative hierarchies. The centralized controller deals with the policy funding and the protocols used for routing procedures are designated by the decentralized controller. Ambience Awake is a location centered routing protocol deployed in the 5G network architecture with OpenFlow model. The Ambience Awake mechanism relies on the power consumption of the network elements during the packet transmission for unicast and multicast scenarios. The signalling load and the routing overhead witnessed an improvement of 30% during the routing procedure. The proposed routing mechanism run on the top of the decentralized SDN controller proves to be 19.59% more efficient than the existing routing solutions.     

Ant Colony Optimization for Multi-Objective Multicast Routing

In the distributed networks, many applications send information from a source node to multiple destination nodes. To support these applications requirements, the paper presents a multi-objective algorithm based on ant colonies to construct a multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes total weight (cost, delay and hop) of the multicast tree. Experimental results prove the proposed algorithm outperforms a recently published Multi-objective Multicast Algorithm specially designed for solving the multicast routing problem. Also, it is able to find a better solution with fast convergence speed and high reliability.     

延时受限启发式组播路由算法

给出了一种带延时约束的组播路由算法，旨在确定组播路由，不仅要使网络通信的费用达到最小，而且要保证源节点到每个目的节点的延时满足给定约束。此算法具有易于实现、计算量小且所需传递信息量小等优点。仿真结果表明此算法性能良好。     

基于代理的QoS组播路由算法

提出了一种基于代理（Agent)的QoS组播路由算法,它根据一个在网络中漫游的移动代理收集的网络状态来建立保证QoS的组播树,仿真实验表明,该算法是有效的和可行的。