基于Photonic Slot Routing的波分复用网络的协议与结构

本文介绍了波分复用技术与全光网络的概念,提出了基于光槽路由的波分复用网络体系结构,讨论了实现光槽与分组传送的方法以及有关的网络存取协议,并给出了全光学网络中网桥与节点的示意性结构。本文的目的是提供一个这种方法的基本描述。     

全光双向网络中的波长转换

在许多光学路由中,对于给定一组通讯路的集合,必须对有公共边的路安排相同的波长.为了充分利用光学的带宽,目的是安排尽量少的波长数.但有时候也考虑使用波长转换器. 如果一个顶点安装转换器,任何经过这个顶点的路都可以改变其波长.因此在某些顶点安装波长转换器后可以将波长的数目减少到一个拥塞界,因此,Wilfong和Winkler定义了一个顶点集 S,在S上安装转换器后,任何路集都可以分配数目等于拥塞界的波长,这样的集合S被称为充分集.研究在双向网络中的最小充分集问题,并把他转化为最小顶点覆盖问题.对此问题给出几个算法.     

Service category-to-wavelength selection technique for QoS support in connection-oriented optical packet switching

This paper considers an optical packet-switched node subject to asynchronous, variable-length packets and connection-oriented operation. We firstly address the problem of setting up the optical virtual connections and properly configuring the forwarding table at the node. We do not deal with routing aspects, but with the efficient mapping of the virtual connections to the wavelengths of the output ports. In this context, we suggest a wavelength assignment procedure that improves the node performance in comparison with simple random or balanced schemes. We then address the QoS provisioning problem. While existing solutions focus on applying some forms of resource reservation on top of the contention resolution algorithm, here we propose a method based on the well-known ATM scheme of defining different service categories. In particular, we define a case study with three OPS service categories, and for each category a specific contention resolution algorithm is applied. With such a strategy the algorithms present the problem of a different performance alignment; we solve it by designing an ad hoc optical buffer architecture based on non-degenerate delays. The performance of the final node architecture is evaluated by simulation. The results obtained indicate the merits of this method, which opens up interesting future developments for a whole optical network scenario.     

Optical packet switching with multiple path routing

The performance of packet-switching wavelength routed optical networks critically depends on packet contentions at the intermediate routers. This paper shows through simulations that deflection routing is an effective technique for packet-switching wavelength routed optical networks with irregular meshed topologies. It is shown that multiple path routing (MPR) as the deflection rule mitigates the blocking of packets substantially in cross-connected all-optical networks leading to a significant reduction in hardware volume and cost of all-optical IP routers. The effectiveness of the blocking reduction critically depends on the network topology, and meshed topologies with a high number of interconnections benefit of the largest gain from deflection routing.     

基于AWGR的光电混合数据中心网络架构设计

随着云计算需求与服务器数量的不断增长,数据中心网络（data center network,DCN）面临可扩展性、低成本、低能耗、高带宽等一系列挑战。提出了一种基于阵列波导光栅路由器（arrayed waveguide grating router,AWGR）的光电混合数据中心网络架构。该混合架构由AWGR提供大容量光波长路由,由电分组交换机提供突发分组交换,同时满足大象流量和老鼠流量的需求。AWGR是无源光器件,将有效降低网络能耗,提高网络可靠性,与光电路交换机相比,可降低配置时间延迟。分析了在架顶交换机上分别采用全固定波长激光器（方案1）、混合固定波长激光器和波长可调谐激光器（方案2）、全波长可调谐激光器作为光源（方案3）的3种架构方案。对3种架构方案的成本和能耗进行了数值分析和计算,同时对网络性能进行了理论分析与仿真。成本和能耗数值分析结果显示：3种架构方案的成本与能耗随着服务器数量的增加不断增长,方案3增长的速度最快,方案1增长的速度最慢,方案2介于两者之间。网络性能仿真结果显示：在不同网络负载情况下,方案2架构的网络吞吐量和波长请求阻塞率与方案3接近,远高于方案1,因此混合固定波长激光器与波长可调谐激光器的方案2具备较好的性价比。     

A direction-based geographic routing scheme for intermittently connected mobile networks

In an intermittently connected mobile network, a complete routing path from a source to a destination cannot be guaranteed most of the time. Therefore, traditional routing methods for mobile ad hoc networks are not applicable in such a network. Current approaches for intermittently connected mobile networks are primarily based on redundant transmission and single-copy opportunistic routing. However, they incur either high overhead due to excessive transmissions, or long delay due to incorrect path choices during forwarding. In this paper, we propose a direction-based geographic (DIG) routing scheme for intermittently connected mobile networks. Relying on geographic location information, the packets are routed in a path approximately to the shortest path from the source node to the destination, which significantly reduces the overhead in redundant transmission and decreases the transmission delay in the single-copy opportunistic routing. Theoretical analysis and trace-driven experimental results show that DIG provides low transmission delay with low overhead in comparison with the schemes in the redundant transmission and single-copy opportunistic routing.     

Design and Analysis of a Backbone Architecture with TDMA Mechanism for IP Optical Networking

This paper presents a new technique for constructing IP over photonic systems. The use of lable switching is assumed in the IP routers, while a new routing architecture is introduced to transport IP packets across an optical backbone network. The architecture is based on a two-level TDMA structure with wavelength division multiplexing (WDM). Many IP-based network applications such as high-resolution image, distributed database, and real-time video/audio service generally require high-speed transmissions in WAN/LAN. The network traffic in these applications usually exhibits traffic locality. As a result, traditional TDMA is not efficient for such traffic. Consequently, based on the traffic parameters such as locality and loading, an architecture named a PG (Partition-Group) Network is proposed. Furthermore, the interleaved control slot (ICS) with cross-group section (CGS) or non-cross-group section (NCGS) for reducing collisions is also presented. The slot reuse can be easily achieved by using the ICS scheme, and the slot utilization of the network can be improved within the high traffic locality.     

基于部分专用波长的OBS网络冲突规避机制

提出一种适用于光突发交换网络(OBS)的新型冲突预先规避机制.相应于OBS网络中的每个入口边缘节点,本文根据流量情况为其分配一个或一个以上的专用波长,突发包将沿着专用波长通道传送至不同的目的节点,中间节点处的冲突能够被部分消除.通过构建流量负载平衡扩张树、波长重用以及统计复用波长信道的使用,网络资源利用率仍然保持在一个合理的水平.与光纤延迟线和突发包分段的方案相比,本方案能够实现更低的丢包率.     

基于最近社交圈的社交时延容忍网络路由策略

无稳定拓扑使时延容忍网络(delay tolerant networks, DTN)路由协议主要通过增加冗余数据包副本提高路由性能.社交网络是DTN的一种典型应用场景,但由于其网络规模相对较大,当网络负载高时,通常的DTN路由不能有效控制数据包副本的数量,从而产生大量丢包导致性能下降.借鉴MANET网络中利用分簇结构控制网络冗余路由数据包的思想,通过分析社交网络中节点的移动模型,定义了在社交关系的约束下,聚合移动规律相近的节点构成最近社交圈的节点簇组成策略.提出了一种基于该分簇结构的分为簇外喷射、簇间转发和簇内传染3个阶段的社交时延网络路由协议.实验证明,这种基于最近社交圈分簇结构的路由能有效地控制冗余数据包副本的产生,并在高网络负载的情况下仍然能够达到较好的性能.     

Designing tributary networks with multiple ring families

Advances in telecommunication technology result in improved service, but can also lead to difficult and challenging network design problems. For example, networks in which nodes are connected by rings of optical fiber can now be used to provide rapid service restoration in the event of a failure. However, as a result, network designers are faced with the new problem of designing networks based on topological ring structures. In this paper, we consider the particular case of tributary network design. In a tributary network, a group of nodes are connected to a hub node, which is used as a point of interconnection with other parts of the network. For a particular network architecture, we describe an algorithm to determine how many topological ring structures are required, and which nodes should be included on each. We highlight connections between this problem and problems in vehicle routing.A common architecture for a telecommunications network consists of several tributary (often called access) networks, which connect locations to hubs, and a backbone network, which interconnects the hubs. This paper describes a heuristic approach for designing tributary networks based on self-healing rings (SHRs). The tributary network consists of multiple ring families, and each of those is comprised of one or more SHRs, called “stacked” rings. The SHRs in a given ring family are routed over the same cycle of optical fiber cables, but each SHR serves only a subset of the locations along the cycle. Each demand location is assigned to a single SHR on one of the ring families, whereas the hub is assigned to all SHRs on all ring families. A link that is used by some ring family incurs a fixed cost plus a variable cost per SHR associated with that family. Each SHR is constrained by the demand volume it can handle and by the number of locations it can serve. This tributary ring network design problem can be viewed as a complex version of a vehicle routing problem with a single-depot andmultiple vehicles. Our algorithm is initiated with numerous ring families. It then attempts to merge these families, while ensuring that savings are realized in terms of the sum of fixed and variable costs.     

A global approach for designing reliable WDM networks and grooming the traffic

In this paper, we address the global problem of designing reliable wavelength division multiplexing (WDM) networks including the traffic grooming. This global problem consists in finding the number of optical fibers between each pair of optical nodes, finding the configuration of each node with respect to transponders, finding the virtual topology (i.e., the set of lightpaths), routing the lightpaths, grooming the traffic (i.e, grouping the connections and routing them over the lightpaths) and, finally, assigning wavelengths to the lightpaths. Instead of partitioning the problem into subproblems and solving them successively, we propose a mathematical programming model that addresses it as a whole. Numerical results are presented and analyzed.     

命名数据网络中的邻居缓存路由策略

命名数据网络(named data network,NDN)是一种以数据为中心的新型网络体系结构。现有NDN网络路由策略未能充分利用路由结点缓存导致转发效率不高。为了在路由决策中充分利用NDN网络中的缓存,提出了一种邻居缓存路由(neighbor cache explore routing,NCE)策略,将路由结点缓存因素引入到路由决策中,并设计了相应的报文格式及路由选择算法。模拟实验结果表明,邻居缓存路由策略在减少网络冗余流量的同时提高了整体网络的性能,验证了NCE策略在NDN网络中的有效性。     

Optimal bandwidth utilization of all-optical ring with a converter of degree 4

In many models of all-optical routing,a set of communication paths in a network is given,and a wavelength is to be assigned to each path so that paths sharing an edge receive different wavelengths .The goal is to assign as few wavelengths as possible,in order to use the optical bandwidth efficiently.If a node of a network contains a wavelength converter,any path that passes through this node may change its wavelength .Having converters at some of the nodes can reduce the mumber of wavelengths required for routing,This paper presents a wavelength converter with degree 4and gives a routing algorithm which shows that any routing with load L can be realized with L wavelengths when a node of an all-optical ring hosts such a wavelength converter.It is also proved that 4 is the minimum degree of the converter to reach the full utilization of the available wavelengths if only one mode of an all-optical ring hosts a converter.     

Multi-layer network architecture in support of end-to-end transparent optical connectivities

In order to effectively accommodate a wide variety of emerging and future applications with diverse requirements, an intelligent optical network capable of the rapid and resilient delivery of on-demand transparent transmission capacity is required. This paper investigates a multi-layer network architecture where a generalized multiple protocol label switching (GMPLS) controlled transparent wavelength switched optical network (WSON), as the transport core, collaborates with multiple client optical burst swit...     

通过器件共享实现的双向无阻塞光互连片上网络

在片上网络NoC( Network-on-Chip)中,通过光通信取代传统的电信号传精来获得低延时、低功耗成为一种新兴的研究方向—光五连片上网络ONoC(Optical Network-on-Chip)本文提出一种全新的双向传输的波长路由片上网络,这种新的结构对调制好的光信号的波长进行判断来实现在网络节点之间的路由,同时还能够通过器件和传输通道的共享实现数据的双向传输.和传统的电信号传输网络相比,本文提出的双向传输结构减少了50％的硬件开销和70％的芯片面积开销,提高了器件利用率,降低了网络传输延时,极大地提高了网络传精性能,对于光互连片上网络具有重要意义.     

基于IPv6网络的Anycast路由协议

IPv6定义了一种新型的地址——Anycast地址．它允许一个数据包被路由到具有相同Anycast地址的一组网络结点中的任一个结点,具有广泛的应用前景．但由于地址选取和地址的非层次聚合等问题,目前还没有标准的支持Anycast服务的网络层路由协议．基于IPv6网络的支持Anycast服务的系统构架和路由协议(HHA)能够有效地克服这些问题,提供网络层的Anycast服务,在网络中平衡,广泛地分布路由负载,并且可以部署在即使不支持它的网络中．     

构建网络的新方法：基于环路的混合交换光网络*

为了能够更好地支持突发性数据业务,提出了一种新型网络交换结构——基于环路的混合交换光网络（cyclebased hybrid switching optical networks,CHSON）。该网络结合了光电路交换（OCS）和光突发交换（OBS）两种交换技术,不仅可以有效地降低网络节点的分组转发压力,而且能够较好地承载突发性数据业务。首先介绍了CHSON的网络结构和虚拓扑设计,然后阐述了节点设计及其执行流程。仿真表明,CHSON具有比OCS网络更低的丢包率,而且在丢包率和平均分组延时方面,CHSON较     

基于遗传算法的动态RWA问题的研究

针对WDM光传送网中的动态路由选择和波长分配(RWA)问题,提出了一种基于遗传算法的动态RWA方法。将遗传算法与相对容量影响(RCI)波长分配算法相结合,以实现对RWA算法的改进。仿真结果表明,与现有最短路径算法[1]相比,该算法能有效提高网络资源利用率,促进波长资源的合理分配。     

光交换网络中的路由算法

对于一类对称的可重排的多级光交换网络,提出一种有效的路由算法,将输入输出信号终端数映射到光交换网络的中央级,得到2个交换组,通过交换组内对应终端数的交换,完成中央级输入输出端所映射终端数的排列,从而确定中央级节点开关状态。再同时向2个方向进行类似操作,可依次确定各级节点开关状态。该路由算法操作时间短,通过O(N)步即可完成路由确定,可以有效处理对称光交换网络的路由问题,对于利用光交换网络实现全光交换和排序具有一定应用价值。     

Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM

In this paper, we address a hop-constrained node survivable network design problem that is defined in the context of multi-protocol label switching (MPLS) over wavelength division multiplexing (WDM) networks. At the lower WDM layer, we consider a maximum length constraint for optical connections between MPLS routers. At the upper MPLS layer, we consider survivability as well as maximum delay constraints. Survivability is guaranteed by routing each demand through D node-disjoint paths and maximum delay is guaranteed by constraining all paths to a maximum number of hops. An Integer Linear Programming model, based on the previous works by Gouveia et al. (Proc of IEEE INFOCOM, 2003, and Telecommunications network planning: innovations in pricing, network design and management, pp 167–180, 2006) is used to model the network design problem considering two different survivability mechanisms: path diversity (where each demand is equally split over the D paths) and path protection (where any D–1 out of the D paths have enough capacity to support the total demand). For both mechanisms, we use the NSFNet and EON real world networks to make a cost analysis of the design solutions for different values of D. In the path diversity mechanism, the results consistently show that greater values of D impose a cost penalty that is greater than the gain in the percentage of demand that is protected. In the path protection mechanism, where all traffic is totally protected, the results show that the network solutions obtained with D=3 node-disjoint paths have consistently lower costs than the network solutions obtained with D=2 node-disjoint paths. However, using values of D that are greater than 3 led to network solutions with larger costs. Supported by FCT project POCTI - ISFL - 1- 152.