Investigation on static routing and resource assignment of elastic all-optical switched intra-datacenter networks基于弹性全光交换技术的数据中心内网的静态路由和资源分配(RSIA)

In this paper, we explore the issue of static routing and spectrum/IT resource assignment (RSIA) of elastic all-optical switched intra-datacenter networks (intra-DCNs) by proposing anycast- and manycast-based integer linear programming (ILP) models. The objective is to jointly optimize the DCN resources, i.e., network transmission bandwidth and IT resources, under different situations. First, for given service-request matrices with unknown network transmission bandwidth and IT resources, we propose anycast and manycast ILP models to minimize the maximum numbers of required network and IT resources to accommodate all the service requests. For anycast RSIA issue, we proposed two different ILP models that are based on node-arc and link-path methods, respectively. Node-arc based manycast ILP model is also proposed for the first time to our knowledge. Second, for given network transmission bandwidth and IT resources and known service-request matrices, we propose node-arc based anycast ILP models to maximize the total number of successfully served service requests. To evaluate the efficiency of anycast and manycast models, all proposed ILP models are evaluated and compared with unicast ILP models. Simulation results show that anycast and manycast ILP models perform much better in efficiently using DCN resources and successfully accommodating more service requests when compared to unicast ILP models under the same network conditions.     

基于IP的联播服务及其应用

基于IP的联播服务是一种新的网络服务提供方式。介绍了当前研究的主要方面，包括联播地址空间的分配、联播与组播的关系、联播服务对现有网络协议的关系、为联播提供路由服务等。提出了联播服务可能的体系结构基础，讨论了联播服务在未来网络中的广阔的应用空间，指出联播服务研究方面亟待解决的一些问题，提出可能的应用方式。     

一种带时延约束的选播路由算法

选播是一种新型的网络服务，它使用户通过一个选播地址就能访问到该地址所表示的一组服务器中对用户来说“最近”的一个。在实时性要求较高的业务传输过程中，保证信息传榆时延尽可能小是非常重要的。本文研究时延受限的选播路由问题，提出一种时延受限的选播路由（DCAR）算法，生成一棵以时延为度量且代价最小的选播生成树。仿真实验结果表明了该算法的正确性和高效性。 [     

Anycast通信机制及其研究现状

Anycast是一种新的标准通信模式,用户通过一个Anycast地址就可以访问该地址所表示的一组服务器中离用户最近的一台服务器。Anycast在镜像服务器选择、移动Adhoc网络,以及支持主机自动配置方面有着广泛的应用前景。针对Anycast服务所进行的工作可分为两类:第一,在应用层(Application Layer)上通过管理手段实现Anycast的相关服务;第二,在网络层(Network Layer)上采用路由选择算法完成Anycast的路由和选址。关于Anycast的一些协议和标准正在讨论之中,不确定性传输、组管理和Anycast路由表规模压缩等问题是当前研究的热点。     

Distributed admission control for anycast flows

Anycasting has recently become an important research topic, especially for replicated servers. With anycasting, applications can request the "nearest" server for provision of desired (multimedia) service. In this paper, we study efficient distributed admission control (DAC) for anycast flows. We focus on algorithms that perform destination selection and efficient path establishment. Taking advantage of anycasting, our distributed algorithms differ from each other in their dependence on system status information. Performance data obtained through mathematical analysis and simulations show that, in terms of admission probabilities, DAC systems that are based on local status information have performance levels close to those that utilize global and dynamic status information. This renders our DAC algorithms useful not only for the network layer, but also for the application layer admission control for anycast flows.     

一种基于遗传算法有时延约束的选播路由算法

选播是一种新型的网络服务，是IPv6的一个新特性。与单播、组播一样，都是IP的一种通信模式。本文在分析选播通信服务的基础上，提出了一种改进的遗传算法以求解有时延约束的选播路由问题。仿真实验结果表明，该算法是有效且切实可行的。     

基于调度集合的多播单播数据联合调度算法

首先定义和分析了IEEE802.16e无线城域网中的一个新问题,即如何在保证移动终端服务质量的前提下,通过合理地调度终端的单播业务和多播业务来降低终端能耗.针对该问题,提出一种基于调度集合的联合调度算法(scheduling set based integrated scheduling,简称SSBIS).SSBIS算法将所有移动终端划分到多播调度集合或单播调度集合中,并利用多播数据的传输特点,在多播数据传输的相邻时隙内发送多播调度集合中所有终端的单播数据,而对于单播调度集合中的终端,则通过凸优化方法求得使终端休眠时间最长的单播业务调度方案,以达到降低终端能耗的目的.仿真实验显示,SSBIS算法在满足移动终端的最小数据速率要求的同时,可以明显地降低终端能耗.     

吸收协议-一个选播路由协议

选播是一种很有用的通信模式．由于在复制服务器、移动IP等多个应用领域的需求．使越来越多的人关注怎样更好的实现选播．提出了一个选播路由协议一吸收协议．协议在提供最小端到端延迟路由前提下支持多路路由．以平衡网络流量．改善网络链路利用率．协议通过从选播成员开始的吸收过程．使网络中每个节点都有一条或者多条到选播地址的路由指向到该节点端到端延迟最小的选播成员．吸收协议原理简单，开销小．易于实现．不依赖其他路由协议．修改、升级不会影响其他路由协议．     

容迟与容断网络中的路由协议

作为一种新型的端到端存储转发网络体系结构,容迟与容断网络(delay and disruption tolerant network)具有间歇连接、频繁割裂、时延极高、非对称的数据速率、较高的误码率、异构互连等特点,传统的Internet、移动Ad Hoc网络和传感网的路由协议难以有效应用在容迟与容断网络中,容迟与容断网络路由面临新的挑战.在简要介绍了容迟与容断网络的基本特性和路由协议设计挑战之后,提出了路由协议评估指标.然后从单播路由、组播路由和选播路由3个方面介绍了容迟与容断网络路由协议的研究进展,最后对主要路由协议进行了综合比较,并指出了未来的研究方向.     

IP anycast point-to-(any) point communication

The Internet supports three communication paradigms. The first, unicast, is the point-to-point flow of packets between a single source (client) and destination (server) host. Web browsing and file Me transfer are unicast applications. The next, multicast, is the point-to-multipoint flow of packets between a single source host and one or more destination hosts. Broadcast-style videoconferencing, for example, employs IP multicast. Anycast is the point-to-point flow of packets between a single client and the "nearest" destination server identified by an anycast address. The idea behind anycast is that a client wants to send packets to any one of several possible servers offering a particular service or application but does not really care which one. Any number of servers can be assigned a single anycast address within an anycast group. A client sends packets to an anycast server by placing the anycast address in the packet header. Routers then attempt to deliver the packet to a server with the matching anycast address     

基于链路质量的无线传感器网络任播路由协议

无线传感器网络(WSN)中,由于无线链路的链路质量问题,经常有传递失败导致重传耗费能量的现象出现。传统任播路由协议只以路由距离作为路由判据,而没有讨论链路质量问题,将其应用在WSN中会造成路由权重设置不合理。提出了基于链路质量的WSN任播路由协议,该协议在讨论链路质量的计算之上,以能耗均衡和系统能耗最小这两个因素决定任播路径的路由权重,并以参数α来权衡两者之间的关系。实验证明,在WSN中,相比传统任播路由协议,该协议能更有效地均衡能耗,减少系统能耗,从而优化网络生存期。     

基于进化算法的无线传感器网络任播路由算法

在无线传感器网络WSN(Wireless Sensor Networks)中存在无线链路容易失效的现象,但大多数学者在设计路由算法时较多地关注网络生存期问题,而忽略路由健壮性问题.提出一种基于进化算法的WSN任播路由算法.该算法以网络生存期和路由健壮性为优化目标,并通过多目标进化算法寻找到两者的最佳适应值.实验验证了该算法的有效性,实验数据表明:相比较基于单目标优化(网络生存期)的任播路由算法,所提算法的网络生存期及路由健壮性两个性能的综合优化值优于前者;相比较传统单路径任播路由算法,所提算法的网络生存期、路由健壮性和可扩展性优于前者.     

移动自组网络中基于启发式环索算法的Anycasting路由的研究

移动无线自组网络（Mobile Ad Hoc Networks）是一种新型的无线网络,网络中不需要固定通信设施的支持,具有很高的灵活性．任播路由（Anycasting Routing）在移动无线自组网络中有着十分重要的潜在应用．该文提出的基于启发式环索算法的Anycasting路由在路由请求过程中能够根据以前搜索中获得的“先验”知识动态地调整搜索的参数,使搜索总是向着“最可能”的方向进行．模拟实验表明,采用启发式环索算法的混合式Anycasting路由在不影响路由正确性的情况下能极大地减少网络中无用的路由请求消息,从而提高网络的整体性能．     

延时受限的选播QoS路由算法的设计与仿真

选播是一种新型的网络服务,它使用户通过一个选播地址就能访问到该地址所表示的一组服务器中对用户来说“最近”的一个。在实时性要求较高的业务传输过程中,保证信息传输延时尽可能小是非常重要的。该文研究延时受限的选播路由问题,提出了一种改进的遗传算法以求解该问题。仿真实验结果表明,该算法是有效和切实可行的。     

Distributed power adjustment based on control theory for cognitive radio networks

In this paper, we propose two power adjustment methods for cognitive radio networks. In the first algorithm, the transmitter derives the transmission power with PID control in order to satisfy the QoS constraints in secondary networks. The derived transmission power is compared with a constraint condition in order to avoid the interference with primary networks, and then the actual transmission power is decided. Because the constraint condition affects the performance of our proposed method significantly, we propose an effective update algorithm. On the other hand, the second algorithm is based on model predictive control (MPC). In this method, the decision of transmission power is formulated as quadratic programming (QP) problem and the transmission power is derived directly with the constraint condition. We evaluate the performances of our proposed methods with simulation and compare the proposed methods with the distributed power control (DPC) method. In numerical examples, we show that our proposed methods are more effective than the existing method in some situations. We also prove analytically that the interference with primary networks can be avoided with probability one by using our proposed method if each transmitter has the information about every channel gain.     

Multi-period traffic on elastic optical networks planning: alleviating the capacity crunch

Advances in optical data transmission technology have allowed the current expansion of bandwidth-demanding services over the Internet. Also, the emergence of orthogonal frequency-division multiplexing (OFDM) has opened the possibility of increasing the network spectral efficiency by solving the routing, modulation and spectrum assignment (RMSA) problem. Recently, investigators have examined the effects of multiple demands or multiple virtual topologies when they are requested at different time periods over a single physical substrate. That makes the RMSA harder and with many more instances. Such analysis is required because network traffic does not remain static along time, and the demand can increase considerably as new user services arise. Therefore, planning the network considering a multi-period study becomes essential, since it can prevent a case where demands may exceed the bandwidth capacity and cause request blocking in future periods. In this work, we provide a novel mixed integer linear programming (MILP) formulation to solve the RMSA problem for several t periods of demands. This model can be used not only to find the solutions to minimize the used capacity, but also as an efficient method of network planning, since it can estimate with a single formulation and a single iteration the point of resource exhaustion in each period t. The results are found for a small network, and they show the efficiency of the proposed MILP formulation. We also propose an alternative version of this formulation with predefined paths, which is less computationally demanding. The results of this study are compared to a step-by-step planning, where the strategy is a decomposition method that breaks the previous formulation into t steps. Comparing the results of the two strategies, it can be seen that the single multi-period formulation is a good strategy to solve the problem. By contrast, the step-by-step strategy may require reconfigurations and eventual interruptions in the network, from a step to another one.

     

AODV协议的选播QoS扩展研究与仿真

针对移动自组网(Ad hoc)的特点和AODV协议的可扩展性,提出了一种适合Ad hoc的选播QoS路由协议AQAODV,该协议在考虑选播路由特点的基础上,扩展AODV以支持QoS需求,并采用局部路由恢复技术,在动态变化的Ad hoc网中实现了一种高效的选播QoS路由.仿真结果表明,AQAODV协议在带宽、时延和平均路由开销等方面较AODV协议具有明显的性能优势.     

基于磷虾群算法的无线传感器网络QoS任播路由算法

无线传感器网络多约束QoS任播路由问题是一个NP难题,提出一种基于磷虾群算法的优化策略来解决该路由问题.该算法采用适应度函数和全局最优个体位置更新方法来寻找无线传感器网络中满足多QoS约束的最优任播路由,并加入遗传繁殖机制中的交叉与变异操作以加快优化速度.实验验证了该算法的有效性,实验数据表明相比较粒子群优化算法,该算法在算法效率和可扩展性性能上具有较好的性能;具有较快的收敛速度,从而适用于对路由选择有时延敏感的网络.     

Multicast-Unicast Data Delivery Method in Wireless IPv6 Networks

Multicast IPv6 is an efficient way of transmitting data simultaneously to a group of IPv6 users. It has the advantage of reducing the required bandwidth of IPv6 data delivery compared to unicast transmission. The data rate of multicast transmission over WLAN is confined by the user with the lowest rate in the multicast group, which is called the fixed base rate problem. This paper proposes a delivery method that incorporates both multicast and unicast transmissions to solve the fixed base rate problem. The proposed method divides the IPv6 network into two levels: multicast mode for the upper level of the network [IPv6 server to Access Point (AP)], and unicast mode for the lower level (AP to mobile nodes). To maintain the end-to-end multicast transmission, the AP is responsible for converting multicast packets to unicast packets. Such a combination enables the proposed method to inherit the advantages of both multicast and unicast transmissions. The performance of our proposed method is evaluated in a test-bed environment that considers the transmission of real-time video application. The proposed multicast-unicast is able to improve the throughput and video quality experienced by the end user, with low packet loss and transmission delay.     

Opaque virtual network mapping algorithms based on available spectrum adjacency for elastic optical networks

Optical network virtualization enables multiple virtual optical networks constructed for different infrastructure users(renters) or applications to coexist over a physical infrastructure. Virtual optical network(VON) mapping algorithm is used to allocate necessary resources in the physical infrastructure to the VON requests(VRs). In this paper, we investigate the opaque VON mapping problems in elastic optical networks(EONs). Based on the concept of available spectrum adjacency(AvS A) on links or paths, we consider both node resource and AvS A on links for node mapping, and present a link mapping method which chooses the routing and spectrum plan whose AvS A on paths is the largest among all the candidates. Finally, the overall VON mapping algorithm(i.e., AvS A-opaque VON mapping, AvS A-OVONM) coordinated node and link mapping is proposed. Extensive simulations are conducted and the results show that AvS A-OVONM has better performance of blocking probability and revenue-to-cost ratio than current algorithms.