Experimental evaluation of solution approaches for the K-route maximum flow problem

We describe the implementation and testing of approaches for the solution of the maximum K-route flow problem. More specifically, we focus on Kishimoto's algorithm, the binary search algorithm and the K-route flow algorithm. With the aim to compare the performances of the aforementioned methods, we report results of computational experiments carried out on a large set of randomly generated problems with varying topology and arc capacities. The numerical results show that Kishimoto's algorithm is generally the fastest for solving fully random networks and 3-D grid random networks. The binary search algorithm provides the best performance in solving grid random networks. The K-route flow algorithm is generally the fastest for solving fully random networks and 3-D grid random networks with capacity range of [1,1000] and certain values of K.     

End-to-end delay estimation for multi-hop wireless networks with random access policy

End-to-end delay analysis is an important element of network performance analysis in multi-hop wireless networks.In this paper,we propose an analytical model for estimating the end-to-end delay performance of wireless networks employing a random access policy for managing node’transmissions on shared channels with time-varying capacity.To obtain the closed form expression,a new concept of residual effective capacity is presented using the definitions of effective bandwidth theory and effective capacity theory.This allows us to calculate the cumulative distribution function of the queuing delay.Based on this concept,we derive a formula to calculate the average end-to-end delay for multi-hop wireless networks,with the result including the effect of a random access protocol,which has not previously been considered.Finally,we validate our analysis through simulations and provide an example application for our results.     

Design and evaluation of flow handoff signalling for multihomed mobile nodes in wireless overlay networks

With the increasing deployment of wireless overlay networks, a mobile node with a range of network interfaces can be connected to multiple heterogeneous or homogeneous access networks simultaneously. Such host multihoming technology can be exploited to distribute (or hand off) application flows among the most appropriate interfaces and access networks dynamically to achieve end-to-end seamless, robust and even quality-of-service-aware communications for mobile users. It is essential that an efficient and effective flow handoff signalling scheme be in place. Nevertheless, little prior work has addressed this problem sufficiently in a systematic way and little performance evaluation is readily available. We propose a set of signalling procedures for a comprehensive, flexible yet standard-oriented flow handoff solution. Two candidate schemes are designed by extending and optimising related IETF work based on Mobile IPv6 or Network Mobility (NEMO). Theoretical analyses are performed and numerical results are then presented with a focus on signalling loads to compare the two proposals and to demonstrate that the designs can largely meet the requirements on desired signalling performance. Preliminary implementations and experimental results are also reported to validate the concepts of the designs, investigate the flow handoff signalling delays and verify the effectiveness of the policy-based flow handoff support for typical real-time and non-real-time applications.     

计算机网络的建模与分析

计算机网络具有既随机又相关的特点，因此选择计算机网络性能评价的数学工具要考虑到网络数据流的特性，排队模型是一种确定性的数学模型，用确定性的模型描述网络既随机又相关的动态行为是不够的。Ｐｅ＃簦颍? Ｎｅｔｓ（ＰＮ）能够比较方便地刻画网络的相关录枋鐾绲木赫⑴鲎埠妥枞樱校谓肜┏浞⒄苟吹乃婊校危梢员冉戏奖愕目袒缡录乃婊裕呓岷掀鹄创酉嗟背潭壬匣汉土思扑慊缃Ｓ敕治鲋涞     

On self-organizing algorithms and networks for class-separability features.

We describe self-organizing learning algorithms and associated neural networks to extract features that are effective for preserving class separability. As a first step, an adaptive algorithm for the computation of Q(-1/2) (where Q is the correlation or covariance matrix of a random vector sequence) is described. Convergence of this algorithm with probability one is proven by using stochastic approximation theory, and a single-layer linear network architecture for this algorithm is described, which we call the Q(-1/2) network. Using this network, we describe feature extraction architectures for: 1) unimodal and multicluster Gaussian data in the multiclass case; 2) multivariate linear discriminant analysis (LDA) in the multiclass case; and 3) Bhattacharyya distance measure for the two-class case. The LDA and Bhattacharyya distance features are extracted by concatenating the Q (-1/2) network with a principal component analysis network, and the two-layer network is proven to converge with probability one. Every network discussed in the study considers a flow or sequence of inputs for training. Numerical studies on the performance of the networks for multiclass random data are presented.     

Interconnection of Local Computer Networks: Modeling and Optimization Problems

We study problems of optimization of the topology of interconnected local computer networks using random access to a single channel. An approach to modeling of the system by a queueing network is proposed: the analytical solution of the model allows us to obtain global performance measures, which may be used as evaluation criteria in network topology optimization problems. A heuristic is proposed for the latter aspect for one class of problems. We also derive from the model the time needed, for a new user which joins the network, to transmit its number of messages.     

一种基于硬件的大规模哈希流表设计与实现

基于流的报文处理是防火墙、入侵检测等网络安全应用的重要组成功能,其中流表是流处理技术的关键数据结构,流表的规模及访问性能直接影响到流处理的能力和速度。着眼于高速网络下大规模流表的硬件实现,设计了一种基于硬件的千万级哈希流表查找架构,并在FPGA平台上进行了实现和测试。该方案在保证访存效率的同时很好地解决了冲突的难题,利用有限的存储资源,满足了高达4 900万项的流表查找需求,测试能够实现92Mdesc/s的表查找速度,支持约220Gbps高速以太网的处理能力。     

A network flow based approach for network selection in dynamic spectrum access networks

In this paper, we present a network flow based approach for dynamic network and channel selection for secondary users in dynamic spectrum access networks. Most approaches in the current literature on dynamic spectrum access networks do not consider dynamic network and channel selection. We present a network flow framework for network selection. We show that our approach can enable re-assignment of networks to secondary users and also re-assignment of channels to secondary users within the same network. The assignments and re-assignments take into account, the interference caused to primary users, the price each secondary user is willing to pay and the quality of service (QoS) obtained by each secondary user. We obtain a bound for the maximum number of re-assignments.     

Adaptive load balancing algorithm for multiple homing mobile nodes

In places where mobile users can access multiple wireless networks simultaneously, a multipath scheduling algorithm can benefit the performance of wireless networks and improve the experience of mobile users. However, existing literature shows that it may not be the case, especially for TCP flows. According to early investigations, there are mainly two reasons that result in bad performance of TCP flows in wireless networks. One is the occurrence of out-of-order packets due to different delays in multiple paths. The other is the packet loss which is resulted from the limited bandwidth of wireless networks. To better exploit multipath scheduling for TCP flows, this paper presents a new scheduling algorithm named Adaptive Load Balancing Algorithm (ALBAM) to split traffic across multiple wireless links within the ISP infrastructure. Targeting at solving the two adverse impacts on TCP flows, ALBAM develops two techniques. Firstly, ALBAM takes advantage of the bursty nature of TCP flows and performs scheduling at the flowlet granularity where the packet interval is large enough to compensate for the different path delays. Secondly, ALBAM develops a Packet Number Estimation Algorithm (PNEA) to predict the buffer usage in each path. With PNEA, ALBAM can prevent buffer overflow and schedule the TCP flow to a less congested path before it suffers packet loss. Simulations show that ALBAM can provide better performance to TCP connections than its other counterparts.     

Double sense multiple access for wireless ad hoc networks

In wireless ad hoc networks, the major quality of service (QoS) concern and challenge in the design and analysis of contention-based medium access control (MAC) protocols is to achieve good throughput and access delay performance in the presence of hidden terminals, which are defined as the terminals out of the radio coverage area of an intended transmitter but within that of the receiver. We propose and analyze in this paper a new dual-channel random access protocol, called “Double Sense Multiple Access” (DSMA), for improving QoS support in wireless ad hoc networks. By separating the transmissions of ready-to-send (RTS) and data packets into two time-slotted channels and by introducing a novel double sense mechanism, DSMA completely solves the hidden terminal problem and can guarantee the success transmission of data packets. By taking into account the most complex network scenario in which all transmitters are hidden terminals with respect to each other, key QoS metrics such as throughput, blocking probability and access delay are derived mathematically for the proposed DSMA protocol. These analytical results are verified by extensive computer simulations.     

高速IDS系统中读写缓冲区的互斥机制

在网络入侵检测系统中,通常需要在内存中开辟缓冲区对网络报文进行采集和分析,但是传统的读写缓冲区的互斥机制在高速网络环境中的效率都不甚理想,无法满足对高速IDS系统的性能需求。该文提出的一种基于并发锁机制的双缓冲区互斥机制可以改善传统锁机制的资源利用率,很好地解决了报文到达流和报文处理能力之间的性能瓶颈问题,显著地提高了IDS系统的性能。     

Toward Quasiregular Sensor Networks: Topology Control Algorithms for Improved Energy Efficiency

Uniformly random or Poisson distributions are widely accepted models for the location of the nodes in wireless sensor networks if nodes are deployed in large quantities and there is little control over where they are dropped. On the other hand, by placing nodes in regular topologies, we expect benefits both in coverage and efficiency of communication. We describe and analyze a basic localized algorithm and three modifications for topology control that provide a tradeoff between performance and deployment cost. The objective is to regularize the topology for improved energy efficiency. The basic algorithm produces quasiregular networks, which only use nodes as sentries and relays that are approximately evenly spaced, thereby emulating a regular grid topology. It is shown that quasiregular networks have a significant energy and lifetime advantage compared with purely random networks. We consider two specific types of quasiregular networks: the ones that are based on a Gaussian deviation about an ideal grid point (type A), and the ones that consist of a subset of nodes taken from a Poisson point process (type B). We show that the two types are equivalent for a certain density of the Poisson point process and, in particular, that in both cases the deviation from the ideal regular grid follows a Rayleigh distribution, whereas the distance between nearest neighbors is Ricean.     

Extra back-off flow control in multi-hop wireless networks

CSMA is the predominant distributed access protocol for wireless mesh networks. Originally designed for single-hop settings, CSMA can exhibit severe performance problems in multi-hop networks in terms of stability and end-to-end throughput. To ensure a smoother flow of packets, we examine an enhancement referred to as Extra Back-off (EB) flow control. In this enhanced scheme a node remains silent for a certain extra back-off time (imposed on top of the usual back-off time that is part of CSMA) after it has transmitted a packet, to give both the downstream and upstream neighbors the opportunity to transmit. EB flow control entails only a small modification to CSMA, preserving its distributed character. In order to examine the performance of EB flow control, we analyze a novel class of Markov models at the interface between classical tandem queues and interacting particle systems. The results demonstrate that EB flow control provides an effective mechanism for improving the end-to-end throughput performance.     

Biased random walks on resource network graphs for load balancing

The currently emerging large-scale complex networks and networks of networks are becoming apparent in the pervasive supply of seamless and transparent access to heterogeneous resources and services such as network domains, applications, services and storage owned by multiple organizations. The dynamics and heterogeneous environments involved, however, pose many challenges for controlling and balancing resource access, composition and deployment across complex grid and network infrastructures. In this paper, a scheme is proposed that gives a distributed load-balancing scheme by generating almost regular resource allocation networks. This network system is self-organized and depends only on local information for load distribution and resource discovery. The in-degree of each node refers to its free resources, and the job assignment and resource discovery processes required for load-balancing are accomplished by using fitted random sampling. Simulation results show that the generated network system provides an effective, scalable, and reliable load-balancing scheme for the distributed resources in grids and networks. The proposed solution is tested with real world data and the performance is tested against a recently reported distributed algorithm for load balancing.     

Probabilistic-time characteristics of bistable random access networks

Bistable random access networks, probability distribution of the normed number of messages in the retrial buffer and main probabilistic characteristics of the network are investigated. Conditions for a random access network to be bistable are formulated. Formulas for estimating the time of sojourn of the network in the neighborhood of a stable state are derived. The time of stable operation of bistable networks is shown to lie in a wide range of vales and may be quite large, almost unbounded.     

面向流管理的哈希算法研究

网络流的识别与管理在网络应用中有着重要作用。但是,随着网络链路速度的迅速提高,流管理变得越来越困难。哈希算法由于其常量查找时间和存储开销小的特点而具有很好的实用价值。本文首先提出了衡量流管理哈希算法性能的标准,然后提出了一个CRC20的哈希算法,并从理论与模拟实验两方面将它与其它几种哈希算法进行了对比,证明了所提出的CRC20算法具有较好的计算性能和很好的访存性能,适合高速网络链路中的流管理应用。     

Modelling and performance analysis of multi-hop ad hoc networks

Mobile ad hoc networks are becoming very attractive and useful in many kinds of communication and networking applications. Due to the advantage of numerical analysis, analytical modelling formalisms, such as stochastic Petri nets, queuing networks and stochastic process algebra have been widely used for performance analysis of communication systems. To the best of our knowledge, there is no previous analytical study that analyses the performance of multi-hop ad hoc networks, where mobile nodes move according to a random mobility model in terms of the end-to-end delay and throughput. This work presents a novel analytical framework developed using stochastic reward nets for modelling and analysis of multi-hop ad hoc networks, based on the IEEE 802.11 DCF MAC protocol, where mobile nodes move according to the random waypoint mobility model. The proposed framework is used to analyse the performance of multi-hop ad hoc networks as a function of network parameters such as the transmission range, carrier sensing range, interference range, number of nodes, network area size, packet size, and packet generation rate. The proposed framework is organized into several models to break up the complexity of modelling the complete network, and make it easier to analyse each model as required. The framework is based on the idea of decomposition and fixed point iteration of stochastic reward nets. The proposed models are validated using extensive simulations.     

Sensor selection for parameterized random field estimation in wireless sensor networks

We consider the random field estimation problem with parametric trend in wireless sensor networks where the field can be described by unknown parameters to be estimated. Due to the limited resources, the network selects only a subset of the sensors to perform the estimation task with a desired performance under the D-optimal criterion. We propose a greedy sampling scheme to select the sensor nodes according to the information gain of the sensors. A distributed algorithm is also developed by consensus-based ...     

基于无线自组网络分时发送协议的路由汇聚容量

对于无线自组网而言,由于网络拓扑与路由选择的随机性,容量的分析显得尤为复杂。研究了能量约束对无线自组网容量性能的影响。该网络具有路由汇聚功能,且节点的发送过程基于分时竞争发送协议。在假设能量缓存中的能量值足够大时,节点就能发送数据的前提下,提出了一种基于闭合排队网络的容量分析模型。该模型同时考虑了数据细节、能量缓存以及随机接入协议。然后研究了能量约束对随机接入协议设计参数的影响,以优化网络性能。最后分析了能量约束对最大稳定容量、稳定域以及分组丢弃率的影响。仿真结果验证了所提分析模型的准确性。     

Optimal network locality in distributed virtualized data-centers

Cost efficiency is a key aspect in deploying distributed service in networks within decentralized service delivery architectures. In this paper, we address this aspect from an optimization and algorithmic standpoint. The research deals with the placement of service components to network sites, where the performance metric is the cost for acquiring components between the sites. The resulting optimization problem, which we refer to as the k-Component Multi-site Placement Problem, is applicable to service distribution in a wide range of communication networking scenarios. We provide a theoretical analysis of the problem’s computational complexity, and develop an integer programming model for providing reference results for performance benchmarking. On the algorithmic side, we present four approaches: an algorithm with approximation guarantee and three heuristics algorithms. The first heuristic is derived from graph theory on domatic partition. The second heuristic, built on intuition, admits distributed computation. The third heuristic emphasizes on fairness in cost distribution among the sites. We report simulation results for sets of networks where cost is represented by round-trip time (RTT) originating from real measurements. For small networks, the integer model is used to study algorithm performance in terms of optimality. Large networks are used to compare the algorithms relatively to each other. Among the algorithms, the heuristic based on intuition has close-to-optimal performance, and the fairness heuristic achieves a good balance between single-site cost and the overall one. In addition, the experiments demonstrate the significance of optimization for cost reduction in comparison to a the random allocation strategy.