Analytical modelling of networks in multicomputer systems under bursty and batch arrival traffic

The hypercube and torus are two important message-passing network architectures of high-performance multicomputers. Analytical models of multicomputer networks under the non-bursty Poisson traffic have been widely reported. Motivated by the convincing evidence of bursty and batch arrival nature of traffic generated by many real-world parallel applications in high-performance computing environments, we develop a new and concise analytical model in this paper for hypercube and torus networks in the presence of batch message arrivals modelled by the compound Poisson process with geometrically distributed batch sizes. The average degree of virtual channel multiplexing is derived by employing a Markov chain which can capture the batch arrival nature. An attractive advantage of the model is its constant computation complexity independent of the network size. The accuracy of the analytical performance results is validated against those obtained from simulation experiments of an actual system.     

MLMIN: A multicore processor and parallel computer network topology for multicast

In future, multicore processors with hundreds of cores will collaborate on a single chip. Then, more advanced network-on-chip (NoC) topologies will be needed than today's shared busses for dual core processors. Multistage interconnection networks, which are already used in parallel computers, seem to be a promising alternative. In this paper, a new network topology is introduced that particularly applies to multicast traffic in multicore systems and parallel computers. Those multilayer multistage interconnection networks are described by defining the main parameters of such a topology. Performance and costs of the new architecture are determined and compared to other network topologies. Network traffic consisting of constant size packets and of varying size packets is investigated. It is shown that all kinds of multicast traffic particularly benefit from the new topology.     

Measurement and modeling of paging channel overloads on a cellular network

IP and cellular networks used to be isolated from each other. In recent decade however, the two networks have started to overlap with the emergence of devices that access the Internet using cellular infrastructures. One important question then is whether actions or threats on the Internet side can impact the telecom or cellular side. We address this problem in the paper and specifically consider the paging channel, which is a key conduit shared by both Internet and cellular traffic. Our contributions are as follows: we illustrate through experiments on a CDMA2000 cellular network that attacks launched from the Internet can significantly increase the paging load and increase the delay of paging messages including cellular call setup requests; we derive a simple but accurate queuing model for the paging system in a CDMA2000 network and use this model to demonstrate that the paging channel exhibits sharp rather than graceful degradation under load; and through this model, we identify critical parameters that impact paging performance. Although our study is focused on CDMA2000 networks, similar problems exist in other types of cellular networks that employ a single control channel with limited bandwidth for both synchronous and asynchronous control messages.     

Multimedia and firewalls: a performance perspective

Firewalls are a well-established security mechanism to restrict the traffic exchanged between networks to a certain subset of users and applications. In order to cope with new application types like multimedia, new firewall architectures are necessary. The performance of these new architectures is a critical factor because Quality of Service (QoS) demands of multimedia applications have to be taken into account. We show how the performance of firewall architectures for multimedia applications can be determined. We present a model to describe the performance of multimedia firewall architectures. This model can be used to dimension firewalls for usage with multimedia applications. In addition, we present the results of a lab experiment, used to evaluate the performance of a distributed firewall architecture and to validate the model.     

Channel switching control policy for wireless mesh networks

Dynamic channel assignment algorithms allow wireless nodes to switch channels when their traffic loads exceed certain thresholds. These thresholds represent estimations of their throughput capacities. Unfortunately, the threshold estimation may not be accurate due to co-channel interference (CCI) and adjacent-channel interference (ACI), especially with high traffic loads in dense networks. When the link capacity is over-estimated, these channel assignment algorithms are not effective. This is because the channel switch is not triggered even with overloaded data traffic and the link quality decreases significantly as the channel is overloaded. When the link capacity is under-estimated, the link is under-utilized. Moreover, when link traffic load increases from time to time, channel switch occurs frequently. Such frequent channel switches increase latency and degrade throughput, and can even cause network wide channel oscillations. In this paper, we propose a novel threshold-based control system, called balanced control system (BCS). The proposed threshold-based control policy consists of deciding, according to the real time traffic load and interference, whether to switch to another channel, which channel should be switched to and how to perform the switch. Our control model is based on a fuzzy logic control. The threshold which assists to make the channel switch decisions, could be deduced dynamically according to the real-time traffic of each node. We also design a novel dynamic channel assignment scheme, which is used for the selection of the new channel. The channel switch scheduler is provided to perform channel-switch processing for sender and receiver over enhanced routing protocols. We implement our system in NS2, and the simulation results show that with our proposed system, the performance improves by 12.3%–72.8% in throughput and reduces 23.2%–52.3% in latency.     

Development and research of improved model of multipath adaptive routing in computer networks with load balancing

In modern computer networks, loading and bandwidth of communication links are optimized for providing high-quality service of network traffic, new services and technologies. As a rule, for this task the protocols of dynamic routing based on Dijkstra’s algorithm are used. Protocols of multipath routing for ensuring reliability and accuracy of the provided information allow to divide critical traffic and to execute load balancing along several routes at the same time. The purpose of the work is development and research of the improved multipath adaptive routing model in computer networks with load balancing. In this work, we focused on indicator of jitter optimization between the paved paths and a deviation value of reserve routes from an optimal route. Comparison and estimation of the offered algorithm with some existing approaches, and also modeling and analysis on various topologies of computer networks have been carried out.     

A new congestion control algorithm for improving the performance of a broadcast-based multiprocessor architecture

Congestion occurring in the input queues of broadcast-based multiprocessor architectures can severely limit their overall performance. The existing congestion control algorithms estimate congestion based on a node’s output channel parameters such as the number of free virtual channels or the number of packets waiting at the channel queue. In this paper, we have proposed a new congestion control algorithm to prevent congestion on broadcast-based multiprocessor architectures with multiple input queues. Our algorithm performs congestion control at the packet level and takes into account the next input queue number which will be accessed by the processor, which form the fundamental differences between our algorithm and the algorithms based on the idea of virtual channel congestion control. The performance of the algorithm is evaluated by OPNET Modeler with various synthetic traffic patterns on a 64-node Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus) architecture employing the message passing protocol. Performance measures such as average input waiting time, average network response time and average processor utilization have been collected before and after applying the algorithm. The results show that the proposed algorithm is able to decrease the average input waiting time by 13.99% to 20.39%, average network response time by 8.76% to 20.36% and increase average processor utilization by 1.92% to 6.63%. The performance of the algorithm is compared with that of the other congestion control algorithms and it is observed that our algorithm performs better under all traffic patterns. Also, theoretical analysis of the proposed method is carried out by using queuing networks.     

A survey of recent advances in fuzzy logic in telecommunicationsnetworks and new challenges

The use of fuzzy logic in telecommunication systems and networks is recent and limited. Fundamentally, Zadeh's fuzzy set theory provides a robust mathematical framework for dealing with “real-world” imprecision and nonstatistical uncertainty. Given that the present day complex networks are dynamic, that there is great uncertainty associated with the input traffic and other environmental parameters, that they are subject to unexpected overloads, failures and perturbations, and that they defy accurate analytical modeling, fuzzy logic appears to be a promising approach to address many important aspects of networks. This paper reviews the current research efforts in fuzzy logic-based approaches to queuing, buffer management, distributed access control, load management, routing, call acceptance, policing, congestion mitigation, bandwidth allocation, channel assignment, network management, and quantitative performance evaluation in networks. The review underscores the future potential and promise of fuzzy logic in networks. The paper then presents a list of key research efforts in the areas of fuzzy logic-based algorithms and new hardware and software architectures that are necessary both to address new challenges in networking and to help realize the full potential of fuzzy logic in networks     

The message flow model for routing in wormhole-routed networks

In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. This method may be used to develop deterministic, partially-adaptive, and fully-adaptive routing algorithms for wormhole-routed networks with arbitrary topologies. We first establish the necessary and sufficient condition for deadlock free routing, based on the analysis of the message flow on each channel. We then use the model to develop new adaptive routing algorithms for 2D meshes     

pp-mess-sim: a flexible and extensible simulator for evaluatingmulticomputer networks

The paper presents pp-mess-sim, an object-oriented discrete-event simulation environment for evaluating interconnection networks in message-passing systems. The simulator provides a toolbox of various network topologies, communication workloads, routing-switching algorithms, and router models. By carefully defining the boundaries between these modules, pp-mess-sim creates a flexible and extensible environment for evaluating different aspects of network design. The simulator models emerging multicomputer networks that can support multiple routing and switching schemes simultaneously; pp-mess-sim achieves this flexibility by associating routing-switching policies, traffic patterns, and performance metrics with collections of packets, instead of the underlying router model. Besides providing a general framework for evaluating router architectures, pp-mess-sim includes a cycle-level model of the PRC, a programmable router for point-to-point distributed systems. The PRC model captures low-level implementation details, while another high-level model facilitates experimentation with general router design issues. Sample simulation experiments capitalize on this flexibility to compare network architectures under various application workloads     

Layered routing in irregular networks

Freedom from deadlock is a key issue in cut-through, wormhole, and store and forward networks, and such freedom is usually obtained through careful design of the routing algorithm. Most existing deadlock-free routing methods for irregular topologies do, however, impose severe limitations on the available routing paths. We present a method called layered routing, which gives rise to a series of routing algorithms, some of which perform considerably better than previous ones. Our method groups virtual channels into network layers and to each layer it assigns a limited set of source/destination address pairs. This separation of traffic yields a significant increase in routing efficiency. We show how the method can be used to improve the performance of irregular networks, both through load balancing and by guaranteeing shortest-path routing. The method is simple to implement, and its application does not require any features in the switches other than the existence of a modest number of virtual channels. The performance of the approach is evaluated through extensive experiments within three classes of technologies. These experiments reveal a need for virtual channels as well as an improvement in throughput for each technology class.     

Multi-level graph layout on the GPU

This paper presents a new algorithm for force directed graph layout on the GPU. The algorithm, whose goal is to compute layouts accurately and quickly, has two contributions. The first contribution is proposing a general multi-level scheme, which is based on spectral partitioning. The second contribution is computing the layout on the GPU. Since the GPU requires a data parallel programming model, the challenge is devising a mapping of a naturally unstructured graph into a well-partitioned structured one. This is done by computing a balanced partitioning of a general graph. This algorithm provides a general multi-level scheme, which has the potential to be used not only for computation on the GPU, but also on emerging multi-core architectures. The algorithm manages to compute high quality layouts of large graphs in a fraction of the time required by existing algorithms of similar quality. An application for visualization of the topologies of ISP (Internet Service Provider) networks is presented.     

SALA: A Self-Adaptive Learning Algorithm—Towards Efficient Dynamic Route Guidance in Urban Traffic Networks

In order to alleviate traffic congestion for vehicles in urban networks, most of current researches mainly focused on signal optimization models and traffic assignment models, or tried to recognize the interaction between signal control and traffic assignment. However, these methods may not be able to provide fast and accurate route guidance due to the lack of individual traffic demands, real-time traffic data and dynamic cooperation between vehicles. To solve these problems, this paper proposes a dynamic and real-time route selection model in urban traffic networks (DR2SM), which can supply a more accurate and personalized strategy for vehicles in urban traffic networks. Combining the preference for alternative routes with real-time traffic conditions, each vehicle in urban traffic networks updates its route selection before going through each intersection. Based on its historical experiences and estimation about route choices of the other vehicles, each vehicle uses a self-adaptive learning algorithm to play congestion game with each other to reach Nash equilibrium. In the route selection process, each vehicle selects the user-optimal route, which can maximize the utility of each driving vehicle. The results of the experiments on both synthetic and real-world road networks show that compared with non-cooperative route selection algorithms and three state-of-the-art equilibrium algorithms, DR2SM can effectively reduce the average traveling time in the dynamic and uncertain urban traffic networks.     

Adaptive-trail routing and performance evaluation in irregularnetworks using cut-through switches

Cut-through switching promises low latency delivery and has been used in new generation switches, especially in high speed networks demanding low communication latency. The interconnection of cut-through switches provides an excellent network platform for high speed local area networks (LANs). For cost and performance reasons. Irregular topologies should be supported in such a switch-based network. Switched irregular networks are truly incrementally scalable and have potential to be reconfigured to adapt to the dynamics of network traffic conditions. Due to the arbitrary topologies of networks, it is critical to develop an efficient deadlock-free routing algorithm. A novel deadlock-free adaptive routing algorithm called adaptive-trail routing is proposed to allow irregular interconnection of cut-through switches. The adaptive routing algorithm is based on two unidirectional adaptive trails constructed from two opposite unidirectional Eulerian trails. Some heuristics are suggested in terms of the selection of Eulerian trails, the avoidance of long routing paths, and the degree of adaptivity. Extensive simulation experiments are conducted to evaluate the performance of the proposed and two other routing algorithms under different topologies and traffic workloads     

The Data Vortex, an All Optical Path Multicomputer Interconnection Network

All optical path interconnection networks employing dense wavelength division multiplexing can provide vast improvements in supercomputer performance. However, the lack of efficient optical buffering requires investigation of new topologies and routing techniques. This paper introduces and evaluates the data vortex optical switching architecture which uses cylindrical routing paths as a packet buffering alternative. In addition, the impact of the number of angles on the overall network performance is studied through simulation. Using optimal topology configurations, the data vortex is compared to two existing switching architectures-butterfly and omega networks. The three networks are compared in terms of throughput, accepted traffic ratio, and average packet latency. The data vortex is shown to exhibit comparable latency and a higher acceptance rate (2times at 50 percent load) than the butterfly and omega topologies     

Performance modeling of Cartesian product networks

This paper presents a comprehensive performance model for fully adaptive routing in wormhole-switched Cartesian product networks. Besides the generality of the model which makes it suitable to be used for any product graph, experimental (simulation) results show that the proposed model exhibits high accuracy even in heavy traffic and saturation region, where other models have severe problems to predict the performance of the network. Most popular interconnection network can be defined as a Cartesian product of two or more networks including the mesh, hypercube, and torus networks. Torus and mesh networks are the most popular topologies used in recent supercomputing parallel machines. They have been widely used for realizing on-chip network in recent on-chip multicore and multiprocessors system.     

Performance evaluation of deterministic wormhole routing in k-ary n-cubes

We present a new analytical approach for the performance evaluation of deterministic wormhole routing in k-ary n-cubes. Our methodology achieves closed formulas for average time values through the analysis of network flows. The comparison with simulation models demonstrates that our methodology gives accurate results for both low and high traffic conditions. Another important quality is the flexibility of our approach. We demonstrate that it can be used to model dimension-ordered-routing in several k-ary n-cubes such as hypercubes, 3D symmetric and asymmetric tori, architectures with uni- and bi-directional channels.     

Fuzzy Polynomial Neuron-Based Self-Organizing Neural Networks

We propose a new category of neurofuzzy networks—self-organizing neural networks (SONN) with fuzzy polynomial neurons (FPNs) and discuss a comprehensive design methodology supporting their development. Two kinds of SONN architectures, namely a basic SONN and a modified SONN architecture are discussed. Each of them comes with two topologies such as a generic and advanced type. Especially in the advanced type, the number of nodes in each layer of the SONN architecture can be modified with new nodes added, if necessary. SONN dwells on the ideas of fuzzy rule-based computing and neural networks. The architecture of the SONN is not fixed in advance as it usually takes place in the case of conventional neural networks, but becomes organized dynamically through a growth process. Simulation involves a series of synthetic as well as real-world data used across various neurofuzzy systems. A comparative analysis shows that the proposed SONN are models exhibiting higher accuracy than some other fuzzy models.     

基于自适应门控图神经网络的交通流预测

交通流预测是智能交通系统中的重要组成部分,由于交通数据的复杂性,长期而又准确的交通流预测一直是时间序列预测中最具挑战性的任务之一。近年来,研究人员将基于图神经网络的时空图建模方法应用于交通流预测任务,并取得了良好的预测性能。然而,现有的图建模方法仅通过预定义的邻接结构反映道路网络中的空间依赖关系,忽略了各节点之间的序列关联关系对预测的重要性。针对这一局限性,提出了一种自适应门控图神经网络（Ada-GGNN）,其核心为通过空间传递模块同时捕获道路网络的空间结构及自适应的时序相关性,并通过门控机制学习节点上的时间序列特征。在两个真实交通网络数据集PeMSD7和Los-loop上的实验结果证明了该模型具有更优越的性能。     

Applying link stability estimation mechanism to multicast routing in MANETs

Mobile ad hoc networks are self-organizing network architectures of mobile nodes. Node mobility causes network topologies to change dynamically over time, which complicated important tasks such as routing. In this paper, a novel link stability estimation model based on received signal strength indication is proposed. We have integrated this model into MAODV and present a stability-based multicast routing protocol termed as SMR. SMR can discover more available stable routes and better adapt to network topology changes. Simulation results show the superiority of SMR over the existing methods in terms of packet delivery ratio, average end-to-end delay and routing packet overhead.