基于网络编码的无线数据流保护

网络编码是一种能显著提升网络传输性能的通信机制。而当前将网络编码应用于无线数据流保护以提高网络生存能力方面的研究还没达到如此完备的程度。本论文旨在建立基于网络编码的无线数据流保护模型,验证并实现建立进行网络编码的网络拓扑的算法。验证网络编码应用于无线数据流保护可以提高网络生存能力、减少网络资源消耗并具有远胜于传统保护的时效优势。在网络中部署和实施网络编码,必须建立适用于网络编码的传输节点拓扑并选择合适的编码模式。对于后者,许多学者出了有效的解决方法,而对于网络拓扑规划问题的研究则相对较少。鉴于此,本文论证了一种编码树拓扑结构算法,该算法与现有的编码模式一起,能够构成完整的网络编码无线数据流保护方案。通过理论论证可以证明应用网络编码方法可以在保护时节约网络资源。仿真实验表明,与传统的链路保护模式相比,使用网络编码的无线数据流保护方法具有更小的时延,也即具有传统保护方法没有的时间优势。     

一种基于故障的ATM over SDH网的生存性机制

本文在充分分析了ATM over SDH网在生存性方面所面临的各种问题的基础上，结合ATM over SDH网特有的网络结构，在这种多层网的恢复方案中，针对网状网结构提出了一种基于故障的生成性机制，即在不同的故障情况下采取不同的恢复／保护措施，从而满足网络对生存性的要求。     

Bi-directional self-healing ring network planning

In this paper we study the network planning problem of bi-directional self-healing ring (BSHR), which is a network structure providing higher survivability when there is a failure on link or node. Given a network with nodes, links, and demand pairs, our target is to design an optimal network comprising rings, which use only the existing links to satisfy all demands. The objective is to minimize the total amount of equipment (add/drop multiplexer) on nodes, thus reducing the major cost of SHR structure. We propose two integer programming models. For larger networks, we have developed an efficient solution procedure based on its hierarchical network structure. Computational results are given to show that the solution procedure is effective in obtaining an optimal or near-optimal solution.Scope and purposeThe merging of information networking and telecommunication services has created an increasing demand for telecommunication networks of high bandwidth, aiming to exchange ever larger volumes of data in a very short time interval. The self-healing ring (SHR) is a ring network that provides redundant bandwidth in which disrupted services can be automatically restored following network failures. In this paper, we study the network planning problem of bi-directional SHR aiming to minimize the amount of equipment.     

Optimal Routing Designs in Self-healing Communications Networks

Self-healing communication networks that allow re-routing of demands through switching processes at designated nodes are studied. It is shown how network utilization, demand throughput and reliability of such networks can be studied simultaneously to achieve an optimal design for all three. This is done through a max–min–max multi-commodity network flow formulation of the routing problem in which it is ensured that maximum network throughput is achieved with minimum loss of demands that are blocked due to single switching node failures. It is shown that a node-path linear programming approximation to the multi-commodity network flow formulation solves the problem for medium and large network sizes in moderate computational times.     

Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet

In order to lessen the greenhouse effects and diminish environmental pollution, reducing energy usage is important in designing next generation networks. Shutting down the network devices that carry light load and redirecting their traffic flows to other routes is the most common way to reduce network energy consumption. Since traffic demands among node pairs vary in different time periods, an energy efficient network has to dynamically determine the optimal active links to adapt itself to network traffic changes. However, in current IP networks, shutting down and/or turning on links would trigger link state routing protocols to reconverge to a new topology. Since the convergence time would take tens of seconds, routing table inconsistencies among routers would result in network disconnection and even worse, generating traffic loops during the convergence interval. Removing routing images inconsistent among routers to prevent loops is a critical issue in energy efficient network and this issue is still not considered in the green network design yet. The contribution of the paper is presented in two parts. First, we propose a comprehensive approach to determine a network topology and a link metric for each time period. Traffic engineering is considered in our design such that flows going on the energy-aware network are within a predetermined percentage of the link capacity such that no congestion occurs in a statistical manner. Second, to avoid transient loops during time period changes, we propose a Distributed Loop-free Routing Update (DLRU) scheme to determine the correct sequence for updating the routing table. A scrupulous proof was also presented to ensure the loop-free property of the DLRU. In this paper, we formulate an integer linear programming to determine this multi-topology and link weight assignment problem. Due to its NP-hard property, we propose an efficient algorithm, termed Lagrangian Relaxation and Harmonic Series (LR&HS) heuristic. Numerical results demonstrate that the proposed LRHS approach outperforms the other approaches on several benchmark networks and random networks by providing up to 35%-50% additional energy saving in our experimental cases.     

An efficient link allocation algorithm for survivable ATM-based personal communication networks

The integration of the issue of survivability of wireless networks in the design process of the backbone network is addressed in this paper. The effectiveness of this integration plays a critical role in the success of the wireless network and the satisfaction of its mobile users. In this paper, we consider the design problem of allocating the backbone links in ATM-based personal communication networks (PCNs) that are survivable under single backbone link failures. Survivability is achieved by selecting two link-disjoint routes in the backbone network between every pair of ATM switches. We also take the novel approach of not only minimizing the diameter of the network as a primary objective but also minimizing the total length of the network as a secondary objective. We propose a new heuristic algorithm to optimize the design of the network based on both objectives. We report the results of an extensive simulation study that show that our algorithm generates backbone networks that can withstand single link failures, have shorter average diameters and smaller total lengths and achieve a higher percentage of admitted calls under a mobile environment.     

Topological network design: A survey

We consider the problem of topological optimization of communication networks subject to a number of design constraints, such as maximum network diameter, maximum node degree, k-node (link) survivability, and network fault tolerance. The primary design problem can be described as follows: Given a set of network nodes, it is required to find a topology Ψ, selected from all possible topologies, so that the cost of Ψ (measured possibly in terms of the maximum diameter, maximum node degree, etc.) is less than that of any other network topology and such that Ψ satisfies some given design constraints. Fault tolerance is concerned with the ability of the network nodes to communicate in the presence of a set of faulty links and/or nodes. The network design problem considering reliability constraints is NP-hard. We classify the research efforts presented in the literature for solving the topological optimization design problem as hierarchical, enumerative, or iterative techniques. In this paper, we provide a survey of the topological network design techniques under different design constraints. Experimental results obtained by applying a number of algorithms to a set of randomly generated networks are presented and compared.     

Survivable and delay-guaranteed backbone wireless mesh network design

Backbone wireless mesh networks (BWMNs) consisting of wireless mesh routers are emerging alternatives to implementations of metropolitan area networks (MANs). In a BWMN, gateways connect to the Internet via wireline links and provide Internet access services for users. Due to the limited wireless channel bit rate, multiple gateways are usually required in a BWMN, which costs budget and takes time to set up. In this paper, we study the network topology design and the gateway arrangement so that the construction cost of a BWMN is minimal. Two algorithms, namely, the Predefined Gateway Set Algorithm (PGSA) and the Self-Constituted Gateway Algorithm (SCGA), are proposed for the BWMN design. A genetic algorithm and a proposed enhanced Djikstra's algorithm are employed to search for the low-cost network configuration with constraints such as survivability, link capacity, degree limitation and maximum tolerable delay. Computational results show that the PGSA can give an acceptable network configuration rapidly. In case the gateway cost is high, using the SCGA can lower the network construction cost at the expense of more computational time.     

Survivable ATM mesh networks: Techniques and performance evaluation

The Capacity and Flow Assignment problem in self-healing ATM networks is an interesting one from a Generalized Multi-Protocol Label Switching (GMPLS) prospective since IP and ATM protocols are destined to co-exist together in this unified platform. This paper continues the investigation of the path-based design approach of the network survivability problem in existing ATM mesh networks. Our contribution consists in quantifying (1) the effects the selection of candidate paths per node pair has on the restoration ratio, (2) the effect of restoration schemes on the restoration ratio, (3) the effect of failure scenarios on the restoration ratio, and finally (4) the effect of network connectivity on the restoration ratio. Numerical results are presented under representative network topologies, various traffic demands and spare capacity distribution schemes. They provide additional guidelines for the design of survivable ATM mesh-type networks, from a network reliability viewpoint.     

Algebraic connectivity metric for spare capacity allocation problem in survivable networks

For studying survivability of telecommunication networks, one should be able to differentiate topologies of networks by means of a robust numerical measure that can characterize the degree of immunity of a given network to possible failures of its elements. An ideal metric should be also sensitive to such topological features as the existence of nodes or links whose failures are catastrophic in that they lead to disintegration of a given network structure. In this paper, we show that the algebraic connectivity, adopted from spectral graph theory, namely the second smallest eigenvalue of the Laplacian matrix of the network topology, is a numerical index that characterizes a network’s survivability better than the average node degree that has been traditionally used for this purpose. This proposition is validated by extensive studies involving solutions of the spare capacity allocation problem for a variety of networks.     

社会语义网分析技术研究

为满足在线社会网络语义分析的需要,提出社会语义网络分析框架。该框架由两部分构成:一是在线社会网络的语义表示,利用RDF模型和已建立的本体描述在线社会网络,赋予社会网络丰富的语义信息;二是在线社会网络的语义分析,利用SPARQL对在线社会网络语义图进行检索过滤,获取满足语义要求的数据,在分析过程中利用属性的层次结构实现分析粒度的控制,通过属性路径检索实现整体网分析。通过应用案例,说明了所提框架的有效性。     

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.     

Design of efficient hybrid neural networks for flexible flow shop scheduling

Abstract: Although neural networks have been successfully used in performing pattern recognition, their application for solving optimization problems has been limited. In this paper we design a neural network to solve a well‐known combinatorial problem, namely the flexible flow shop problem. A key feature of our neural network design is the integration of problem structure and heuristic information in the network structure and solution. We compare the performance of our neural network with well‐known current heuristics with respect to solution quality. The results indicate that our approach outperforms the heuristics.     

Smoothing locational measures in spatial interaction networks

Spatial interactions such as migration and airline transportation naturally form a location-to-location network (graph) in which a node represents a location (or an area) and a link represents an interaction (flow) between two locations. Locational measures, such as net-flow, centrality, and entropy, are often derived to understand the structural characteristics and the roles of locations in spatial interaction networks. However, due to the small-area problem and the dramatic difference in location sizes (such as population), derived locational measures often exhibit spurious variations, which may conceal the underlying spatial and network structures. This paper introduces a new approach to smoothing locational measures in spatial interaction networks. Different from conventional spatial kernel methods, the new method first smoothes the flows to/from each neighborhood and then calculates its network measure with the smoothed flows. We use county-to-county migration data in the US to demonstrate and evaluate the new smoothing approach. With smoothed net migration rate and entropy measure for each county, we can discover natural regions of attraction (or depletion) and other structural characteristics that the original (unsmoothed) measures fail to reveal. Furthermore, with the new approach, one can also smooth spatial interactions within sub-populations (e.g., different age groups), which are often sparse and impossible to derive meaningful measures if not properly smoothed.     

IP网络生存性研究综述

随着交互式应用和各种实时业务的增长对网络生存性要求的提高，IP网络的生存性研究受到了越来越多的关注。本文首先对IP网络生存性面临的问题以及影响因素作了概括，并且对目前有关纯IP网络生存性、MPLS网络生存性、IP网络与底层的生存性协调研究作了归纳总结，尤其对纯IP网络的生存性研究现状从多方面进行了比较详细的介绍，最后指出IP网络的快速重路由机制具有很好的实际应用潜力，保护恢复能力和服务质量在MPLS网络中的结合、动态多层保护则是未来IP骨干网生存性维护的发展方向。     

Multi-period design of survivable wireless access networks under capacity constraints

Design of survivable wireless access networks plays a key role in the overall design of a wireless network. In this research, the multi-period design of a wireless access network under capacity and survivability constraints is considered. Given the location of the cells and hubs, the cost of interconnection, and the demands generated by the cells, the goal of the designer is to find the best interconnection between cells and hubs so that the overall connection cost is minimized and the capacity and the survivability constraints are met. Integer programming formulations for this problem are proposed and the problems are solved using heuristic methods. Using different combination of network sizes, demand patterns and various time periods, a number of numerical experiments are conducted and all of them are found to yield high quality solutions.     

Policy-Based Grooming in Optical Networks

This work presents a discussion about policies and architecture to aggregate Internet Protocol/Multiprotocol Label Switching (IP/MPLS) traffics within lightpaths. The scenario is that of IP/MPLS client networks over an optical network. It is well known that aggregating lower traffic flows (e.g., packet-based LSPs—Label Switched Path) within higher traffic flows (e.g., lambda-based LSPs) is considered an effective way to maximize the use of the optical network resources. In this work, the policies are divided into two groups. The first one, which solely considers the class of the flow (High Priority—HP or Low Priority—LP), consists of simple policies meant to aggregate packet-based LSPs within lightpaths. In this group, the policies we have defined intend to reduce the optical network overhead to remove and reroute LP LSPs. The second group presents more sophisticated policies taking into account the possibility of having to deal with further transport faults. In this case, the grooming is better planned and the defined policies tend to reduce the negative impact when a failure is detected in the optical transport network. Our approach has been implemented to validate the policies and the results for each group are showed and discussed.     

On resilient control of dynamical flow networks

Resilience has become a key aspect in the design of contemporary infrastructure networks. This comes as a result of ever-increasing loads, limited physical capacity, and fast-growing levels of interconnectedness and complexity due to the recent technological advancements. The problem has motivated a considerable amount of research within the last few years, particularly focused on the dynamical aspects of network flows, complementing more classical static network flow optimization approaches.In this tutorial paper, a class of single-commodity first-order models of dynamical flow networks is considered. A few results recently appeared in the literature and dealing with stability and robustness of dynamical flow networks are gathered and originally presented in a unified framework. In particular, (differential) stability properties of monotone dynamical flow networks are treated in some detail, and the notion of margin of resilience is introduced as a quantitative measure of their robustness. While emphasizing methodological aspects —including structural properties, such as monotonicity, that enable tractability and scalability— over the specific applications, connections to well-established road traffic flow models are made.     

Survivability Evaluation in Large-Scale Mobile Ad-Hoc Networks

Survivability refers to the ability of a network system to fulfill critical services in a timely manner to end users in the presence of failures and/or attacks.In order to establish a highly survivable system,it is necessary to measure its survivability to evaluate the performance of the system's services under adverse conditions.According to survivability requirements of large-scale mobile ad-hoc networks(MANETs),we propose a novel model for quantitative evaluation on survivability.The proposed model co...     

FlowTrace: measuring round-trip time and tracing path in software-defined networking with low communication overhead

In today’s networks, load balancing and priority queues in switches are used to support various quality-of-service (QoS) features and provide preferential treatment to certain types of traffic. Traditionally, network operators use ‘traceroute’ and ‘ping’ to troubleshoot load balancing and QoS problems. However, these tools are not supported by the common OpenFlow-based switches in software-defined networking (SDN). In addition, traceroute and ping have potential problems. Because load balancing mechanisms balance flows to different paths, it is impossible for these tools to send a single type of probe packet to find the forwarding paths of flows and measure latencies. Therefore, tracing flows’ real forwarding paths is needed before measuring their latencies, and path tracing and latency measurement should be jointly considered. To this end, FlowTrace is proposed to find arbitrary flow paths and measure flow latencies in OpenFlow networks. FlowTrace collects all flow entries and calculates flow paths according to the collected flow entries. However, polling flow entries from switches will induce high overhead in the control plane of SDN. Therefore, a passive flow table collecting method with zero control plane overhead is proposed to address this problem. After finding flows’ real forwarding paths, FlowTrace uses a new measurement method to measure the latencies of different flows. Results of experiments conducted in Mininet indicate that FlowTrace can correctly find flow paths and accurately measure the latencies of flows in different priority classes.