一种适用于大规模网络的组通信模型

针对网络层组播的部署难题，该文提出了一种新的适用于大规模异构网络的组通信模型——Mixcast，该通信模型采用单播和组播混合通信的方式，在接入网闻使用单播，在接入网内使用组播，同时结合IEEE802．1X协议进行访问控制管理，从而在地址分配、组成员管理、协议可扩展性、协议复杂性方面，有了不同程度的改进。     

域内域间和自组网IP组播路由协议分析

系统地综述了IP组播的基本实现协议，分析组播域内、组播域间和无线移动网的组播路由协议的基本原理和工作性能，并比较不同协议设计实现的主要区别。     

IP组播的关键技术

IP组播技术是专门为一点到多点或多点到多点的数据传输业务而设计的。IP组播的实现主要包括三个部分：寻址，组播成员管理和组播路由协议。本主要就这三个部分以及组播存在的问题作了介绍。     

基于PIM-SM的域内组播设计

PIM-SM是一个不依赖于某一特定单播路由协议的组播路由协议,为组播数据转发提供路由信息。介绍了IP组播原理,分析了组播通信的优点,概述了组播路由协议。研究了基于PIM-SM的组播网络设计与实现方法,并给出了相关的网络配置方案。     

QoS-DRMR：Ad Hoc网络中有QoS约束的组播协议

近年来,Ad hoc网络的组播路由协议研究受到广泛关注,其中QoS保障问题是关键技术之一。目前已经提出了许多组播路由协议,其中动态广播环组播路由协议(DRMR),在降低控制开销的基础上,能够取得较好的分组递交率和扩展性。但DRMR没有考虑 QoS 保证要求的问题,本文时DRMR协议进行了QoS保证的扩充,根据多目标约束条件,优化组播路由的选择,提出了一种保证最小带宽要求情况下取得整体优化延时和包丢失率条件的路由方案。最后,利用NS2仿真软件对新的QoS-DRMR协议进行仿真,结果表明:QoS-DRMR协议较好地实现了在多目标约束条件下的组播服务。     

基于SSM的组播路由解决方案

传统组播基于host-group的工作模式，在访问控制、地址分配以及协议复杂性方面存在一定的问题。文章在分析传统组播的主要问题的基础上，给出了如何利用源特定组播SSM技术，来解决或改善这些问题。     

组播协议在OPNET中的建模与仿真

该文以IP组播技术为重点，结合网络仿真软件OPENT Modeler，分析该软件环境下IP组播网络的建模机制，包括参考标准、组的管理、支持的应用、组播路由协议的选择，节点加入组播组与发送源发送组播数据的流程。以校园网视频会议和FTP传输应用为例，构建网络仿真模型，一方面比较单播与组播方式下的网络性能，分析了视频流量的发送情况、视频会议分组的端到端延时，FTP传输的响应时间，骨干网络点到点链路吞吐量；另一方面比较了组播方式采用共享树机制和由共享树切换到最短路径树在网络性能上的改进，包括分组延迟的降低、汇合点路由器上拥塞发生的减少等。同时，也对无线移动通信网络环境下的组播技术提出更多需要考虑的因素。     

一种基于SSM的多源组播路由协议

为满足参与方同时为收发方的组播通信模式,该文提出了一种新的基于特定源组播的多源组播路由协议SSM-MSM,该协议利用特定源组播形成的单向组播转发树维护一个与之并行的用于多方通信的双向转发树,其路由状态、树建立和控制消息开销和组播包转发时延较小,可综合几种已有的基于SSM多方通信方案的优势。     

三种Ad Hoc网络组播协议的性能分析与比较

近年来，Ad hoc网络的组播路由协议研究受到广泛关注，但已经提出的各种组播协议中还没有一种在MANET定义的各种性能指标方面都处于领先，因此对不同协议的分析和比较能帮助人们在不同的应用环境下选择和设计更适合的组播协议。本文首先分别介绍了3种典型的组播路由协议：ODMRP、ADMR、DRMR，然后对其控制开销进行了计算分析，最后利用NS2仿真软件对3种协议进行仿真，分析与比较了它们在各种网络环境下的性能。     

基于外层空间的无线传感器网络组播路由协议研究*

研究航天器部署在火星表面的无线传感器节点,首次提出了外层空间无线传感器网络(outer space wireless sensor network,OSWSN)的概念,指出该网络的节点以自组织方式组网。基于已有的地面无线传感器网络经典组播路由协议,结合无线自组织网络组播协议建树思想,设计应用于外层空间无线传感器网络的OSWSNMP（OSWSN multicast protocol）。与已有的MAODV组播路由协议以及应用于地面无线传感器网络的EMRS组播路由协议进行比较,在NS2上搭建OSWSNMP仿真环     

IP QoS路由算法研究综述

传统上所采用的“尽力而为”转发机制,已经不能满足用户的要求。IP网络如何提供QoS(服务质量)支持这一问题现已成为业界关注的焦点。近几年的研究表明网络路由算法对实现QoS起到了非常关键的作用,同时网络路由算法也是平衡网络负载和充分利用网络资源的重要保证。该文对当前研究的主要路由算法进行了详细的分析与归纳,并对其发展前景进行了展望。     

基于遗传算法的多约束QoS组播路由优化算法

在计算机网络中,随着大量新兴多媒体实时业务的应用,组播路由问题成为越来越重要的课题。组播路由问题在计算机网络中是著名的Steiner树问题,同时也是NP完全问题。目前许多研究者在单约束(特别是延时约束)组播路由中取得了较好的成果,但对于多约束Qos组播路由方面的研究相对比较少。论文提出了一种基于遗传算法的多约束组播路由优化算法,该算法在满足带宽、延时、延时抖动和包丢失率约束条件下寻找代价最小的组播树,文中描述了一种适应于研究Qos组播路由的网络模型。最后通过仿真实验证明该算法操作简单、搜索速度快、效率高且具有较强的实用性和鲁棒性。     

Interference Aware-based Ad-Hoc On Demand Distance Vector (IA-AODV) ultra wideband system routing protocol

Ultra wideband (UWB) systems are communication systems based on a baseband impulsive transmission that has recently excited interest both in the commercial and academic fields. Physical layer aspects and MAC protocols have been intensively investigated in the recent years leading, in some cases, to important and definitive results. However, many questions relating to the UWB network layer are still open. The aim of this paper is to investigate the network layer of the UWB system: for this purpose a new routing protocol called Interference Aware-based Ad-Hoc On Demand Distance Vector (IA-AODV) and based on the interference concept has been proposed. In particular, two distinct metrics are explained in detail: the first one is based on the concept of global interference perceived by each node; the second one is based on the concept of link interference perceived by a node on a wireless path to a generic neighbor. Finally, a comparative analysis between our protocol and Ad-Hoc On Demand Distance Vector (AODV) protocol are carried out in order to show the soundness of our proposal.     

有类路由汇总的学习和探讨

随着计算机网络技术普及和发展,计算机网络已经基本普及到各行各业,我们越来越多人在刻苦钻也计算机网络技术,我就计算机网络技术中有类路由汇总进行探讨和研究,通过有类路由与无类别域间路由的区别以及有类路由在网络设备技术中路由发布情况的研究和探讨得出总结性结论。     

Ad hoc中基于分簇的多路径路由协议

在Ad hoc网络路由协议中,分簇路由具有扩展性强、数据融合简单、能量利用高效等特点,成为当前路由研究的重点。在研究了一些分簇算法和多路径路由算法基础上,提出基于簇指挥路径的多路径路由算法(CDPMR)。仿真表明基于簇指挥路径的多路径路由算法,与平面的多路径路由算法相比,扩展性好,控制负载低,与其它的基于分簇路由算法相比,网络拓扑稳定,减少网络重构开销带来的通信代价,有利于均衡网络能量消耗,延长网络生命周期。     

The production routing problem: A review of formulations and solution algorithms

The production routing problem (PRP) combines the lot-sizing problem and the vehicle routing problem, two classical problems that have been extensively studied for more than half a century. The PRP is solved in an attempt to jointly optimize production, inventory, distribution and routing decisions and is thus a generalization of the inventory routing problem (IRP). Although the PRP has a complicated structure, there has been a growing interest in this problem during the past decade in both academia and industry. This article provides a comprehensive review of various solution techniques that have been proposed to solve the PRP. We attempt to provide an in-depth summary and discussion of different formulation schemes and of algorithmic and computational issues. Finally, we point out interesting research directions for further developments in production routing.     

车载网中一种利用静态节点辅助的路由方法

车载自组织网络(Vehicular Ad Hoc Network,VANET)越来越引起人们的广泛关注,虽然该网络与传统的自组织网络有类似的地方,比如网络中的节点可以自组织和自管理。但是它有自己重要特征:网络中的节点具有很快的移动速度,由于这种高速的移动,造成车载网络拓扑结构频繁的变化,导致网络中多跳路由的频繁断开,进而对路由的可靠性和数据传输的质量带来很大的挑战。路由选择是实现VANET的关键。我们提出一种利用静态节点辅助的路由方法(Static-Node Assisted Routing,SNAR)来提高数据包的传输效率。模拟实验显示,SNAR在端到端延时等方面要优于其它的多跳路由方法。     

GENETIC ALGORITHM APPLICATION TO THE STANDARD ARABIC PHONEMES CLASSIFICATION

The goal of this article is the application of genetic algorithms (GAs) to the automatic speech recognition (ASR) domain at the acoustic sequences classification level. Speech recognition has been cast as a pattern classification problem where we would like to classify an input acoustic signal into one of all possible phonemes. Also, the supervised classification has been formulated as a function optimization problem. Thus, we have attempted to recognize Standard Arabic (SA) phonemes of continuous, naturally spoken speech by using GAs, which have several advantages in resolving complicated optimization problems. In SA, there are 40 sounds. We have analyzed a corpus that contains several sentences composed of the whole SA phoneme types in the initial, medium, and final positions, recorded by several male speakers. Furthermore, the acoustic segments classification and the GAs have been explored. Among a set of classifiers such as Bayesian, likelihood, and distance classifier, we have used the distance classifier. It is based on the classification measure criterion. Therefore, we have used the decision rule Manhattan distance as the fitness functions for our GA evaluations. The corpus phonemes were extracted and classified successfully with an overall accuracy of 90.20%.     

一种高效的多媒体无线传感器网络地理路由算法

针对多媒体无线传感器网络数据流巨大的特点,本文提出一种高效的地理路由算法AOGR。与现有的地理路由算法以路由单包时的性能最优化为目标相比,AOGR将一次会话中所有交互数据包作为整体,使得平均每包传输的路由跳数最少。它充分利用先行包在路由方面的参考作用以优化后续包的路由。随着路由数据包的增多,AOGR最终收敛于最短路径。最后,通过仿真实验验证该路由算法能够有效地减少GPSR协议在周边转发模式时产生的绕道跳数,路由平均跳数有明显减少。     

Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks

The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we present a multipath-based multicast routing model for wormholerouted star graph networks, propose two efficient multipath routing schemes, and contrast the performance of the proposed schemes with the performance of the scheme presented in our previous work. Both of the two proposed schemes have been proven to be deadlock-free. The first scheme, simple multipath routing, uses multiple independent paths for concurrent multicasting. The second scheme, two-phase multipath routing, includes two phases: source-to-relay and relay-to-destination. For each phase, multicasting is carried out using simple multipath routing. Experimental results show that, for short and medium messages with small message startup latencies, the proposed schemes reduce multicast latency more efficiently than other schemes.