Modeling and stability analysis of hybrid dynamical systems based on extended differential Petri nets

In this paper, extended differential Petri nets (EDPNs), a new extension of differential Petri nets (DPNs), is proposed. Compared with the existing extension of DPNs, EDPNs has two improvements: (1) the restriction on the enabling condition that depends on the weight of arc is relaxed, i.e., allow the enabling condition has more general form; (2) the definition is extended for the weight of arc. By these two improvements, EDPNs presents larger flexibility and modeling power than the existing extension of DPNs. Using this model, the stability of hybrid dynamical systems (HDS) is studied. A new Lyapunov’s stability theorem of HDS is given. Furthermore, by using the information of index matrix and a new composite energy function, the stability theorem of linear HDS is obtained.     

The evolution of a distributed processing network

Current trends in information systems technology increase the advantages of developing an increasingly complex distributed processing capacity. Distributed processing networks (DPNs) are expected to evolve gradually from centralized systems into more complex configurations. The introduction of major changes in organizational Structure, such as those precipitated by mergers or acquisitions, also require rapid changes to the DPN. This paper describes four distributed processing configurations. It then presents a case: the evolution of the DPN in a large corporate bank and holding company. This case illustrates configuration changes over the life cycle of the DPN of the bank and provides insight into the process of planning for DPN change. A tendency to return toward centralization is noted in this case; this may cause practitioners to rethink their own DPN growth plans.     

The Relative Mobility of Vehicles Improves the Performance of Information Flow in Vehicle Ad Hoc Networks

Vehicular ad hoc networks (VANET) are receiving significant attention due to their potential to provide a wide range of benefits. One key distinguishing feature of VANET from other ad hoc networks is their relative vehicular mobility. Therefore, to fully understand the significant benefits of these systems, it is necessary to understand the interaction between traffic flow characteristics and information propagation in VANET. This research presents an analytical model to characterize information flow in VANET incorporating macroscopic traffic characteristics, such as traffic density, relative speed between adjacent lanes, and driver composition. The information flow in VANET is characterized using an information flow network (IFN). The analytical expressions for the expected degree of the individual nodes as well as the reachability of an IFN are provided. Moreover, a state of the art simulation model is developed to validate the analytical results. The proposed analytical results not only provide us significant insights to evaluate the performance of information propagation in VANET, but also provide theoretical basis for the design of algorithms for the efficient routing of information based on average end-to-end performance.     

Model checking dynamic pushdown networks

A dynamic pushdown network (DPN) is a set of pushdown systems (PDSs) where each process can dynamically create new instances of PDSs. DPNs are a natural model of multi-threaded programs with (possibly recursive) procedure calls and thread creation. Thus, it is important to have model checking algorithms for DPNs. We consider in this work model checking DPNs against single-indexed LTL and CTL properties of the form \({\bigwedge f_i}\) such that f _i is a LTL/CTL formula over the PDS i. We consider the model checking problems w.r.t. simple valuations (i.e., whether a configuration satisfies an atomic proposition depends only on its control location) and w.r.t. regular valuations (i.e., the set of the configurations satisfying an atomic proposition is a regular set of configurations). We show that these model checking problems are decidable. We propose automata-based approaches for computing the set of configurations of a DPN that satisfy the corresponding single-indexed LTL/CTL formula.     

Cluster Size Optimization in Sensor Networks with Decentralized Cluster-Based Protocols

Network lifetime and energy-efficiency are viewed as the dominating considerations in designing cluster-based communication protocols for wireless sensor networks. This paper analytically provides the optimal cluster size that minimizes the total energy expenditure in such networks, where all sensors communicate data through their elected cluster heads to the base station in a decentralized fashion. LEACH, LEACH-Coverage, and DBS comprise three cluster-based protocols investigated in this paper that do not require any centralized support from a certain node. The analytical outcomes are given in the form of closed-form expressions for various widely-used network configurations. Extensive simulations on different networks are used to confirm the expectations based on the analytical results. To obtain a thorough understanding of the results, cluster number variability problem is identified and inspected from the energy consumption point of view.     

A comprehensive analytical model of interconnection networks in large‐scale cluster systems

The trends in parallel processing system design and deployment have been toward networked distributed systems such as cluster computing systems. Since the overall performance of such distributed systems often depends on the efficiency of their communication networks, performance analysis of the interconnection networks for such distributed systems is paramount. In this paper, we develop an analytical model, under non‐uniform traffic and in the presence of communication locality, for the m‐port n‐tree family interconnection networks commonly employed in large‐scale cluster computing systems. We use the proposed model to study two widely used interconnection networks flow control mechanism namely the wormhole and store&forward. The proposed analytical model is validated through comprehensive simulation. The results of the simulation demonstrated that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions. Copyright © 2007 John Wiley & Sons, Ltd.     

Modelling and analysis of pipelined circuit switching in interconnection networks with bursty traffic and hot-spot destinations

Pipelined circuit switching (PCS) that combines the advantages of both circuit switching and wormhole switching is an efficient method for passing messages in interconnection networks. Analytical modelling is a cost-effective tool and plays an important role in achieving a clear understanding of the network performance. However, most of the existing models for PCS are unable to capture the realistic nature of message behaviours generated by real-world applications, which have a significant impact on the design and performance of communication networks. This paper presents a new analytical model for PCS in interconnection networks in the presence of bursty and correlated message arrivals coupled with hot-spot destinations, which can capture the bursty message arrival process and non-uniform distribution of message destinations. Such a traffic pattern has been found in many practical communication environments. The accuracy of the proposed analytical model is validated through extensive simulation experiments. The model is then applied to investigate the effects of the bursty message arrivals and hot-spot destinations on the performance of interconnection networks with PCS.     

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     

工业短程无线网络通信节点的设计

为了提高工业在线分析仪器网络的可扩展性、灵活性,降低仪器系统的安装、维护成本,设计了一种适用于在线分析仪器的工业无线网络通信节点。通过这种节点,现场的多个分析仪器以自组织的方式可实现无线网络互连。详细介绍了节点的硬件实现细节和软件设计流程。经测试,该节点能满足实际工业对网络数据传输的需求,有效地提高了分析仪器网络的性能。     

Consensus problems in networks of agents with switching topology and time-delays

In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results.     

Stochastic Analysis of Deterministic Routing Algorithms in the Presence of Self-Similar Traffic

Many performance models for deterministic routing in multicomputer interconnection networks have been derived and analyzed under the assumption of the traditional Poisson stochastic arrival process, which is inherently unable to capture traffic self-similarity revealed by many real-world parallel applications. In an effort towards understanding the network performance under various traffic loads and different design alternatives, this paper presents an analytical model for dimension-ordered routing in k-ary n-cubes when subjected to self-similar traffic. As the service time, blocking probability and waiting time experienced by a message vary from a dimension to another, the design of such a model for dimension-ordered routing poses greater challenges. The developed analytical model is then used to investigate the efficiency of two different ways to organize virtual channels for deterministic routing and to evaluate the impact of self-similar traffic with various Hurst parameters on network performance.     

节点传输半径对无线自组织网络容量的影响分析*

在共享无线信道的多跳无线自组织网络中,节点传输半径的大小直接影响节点的一跳吞吐量和业务流传输的中继所需跳数,从而影响网络容量。在网络业务类型一致的条件下,通过数学模型分析和仿真实验,考察了网络容量与节点传输半径、业务流传输的路径长度以及网络节点数量之间的关系,其分析结果有助于优化无线网络的组网结构。     

An analytical model for torus networks in the presence of batch message arrivals with hot-spot destinations

Interconnection networks are hardware fabrics supporting communications between individual processors in multi- computers. The low-dimensional k-ary n-cubes （or torus） with adaptive wormhole switching have attracted significant research efforts to construct high-performance interconnection networks in contemporary multi-computers. The arrival process and destination distribution of messages have great effects on network performance. With the aim of capturing the characteristics of the realistic traffic pattern and obtaining a deep understanding of the performance behaviour of interconneetion networks, this paper presents an analytical model to investigate the message latency in adaptive-routed wormhole-switched torus networks where there exists hot-spot nodes and the message arrivals follow a batch arrival process. Each generated message has a given probability to be directed to the hot-spot node. The average degree of virtual channel multiplexing is computed by the GE/G/1/V queueing system with finite buffer capacity. We compare analytical results of message latency with those obtained through the simulation experiments in order to validate the accuracy of the derived model.     

Adaptive wormhole routing in tori with faults: A mathematical approach

Fault-tolerance in a communication network is defined as the ability of the network to effectively utilize its redundancy in the presence of faulty components (i.e., nodes or links). New technologies of integration now enable the design of computing systems with hundreds and even thousands of independent processing elements which can cooperate on the solution of the same problem for a corresponding improvement in the execution time. However, as the number of processing units increases, concerns for reliability and continued operation of the system in the presence of failures must be addressed. Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in large-scale massively parallel computers, Multiprocessors System-on-Chip (MP-SoCs), and peer-to-peer communication networks. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors which affect their performance potential. This paper proposes a novel analytical model to investigate the performance of five prominent adaptive routings in wormhole-switched 2-D tori fortified with an effective scheme suggested by Chalasani and Boppana [S. Chalasani, R.V. Boppana, Adaptive wormhole routing in tori with faults, IEE Proc. Comput. Digit. Tech. 42(6) (1995) 386–394], as an instance of a fault-tolerant method widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computers. Analytical approximations of the model are confirmed by comparing them with those obtained through simulation experiments.     

Analysis of TTL-Based Consistency in Unstructured Peer-to-Peer Networks

Consistency maintenance is important to the sharing of dynamic contents in peer-to-peer (P2P) networks. The TTL-based mechanism is a natural choice for maintaining freshness in P2P content sharing. This paper investigates TTL-based consistency maintenance in unstructured P2P networks. In this approach, each replica is assigned an expiration time beyond which the replica stops serving new requests unless it is validated. While TTL-based consistency is widely explored in many client-server applications, there has been no study on TTL-based consistency in P2P networks. Our main contribution is an analytical model that studies the search performance and the freshness of P2P content sharing under TTL-based consistency. Due to the random nature of request routing, P2P networks are fundamentally different from most existing TTL-based systems in that every node with a valid replica has the potential to serve any other node. We identify and discuss the factors that affect the performance of P2P content sharing under TTL-based consistency. Our results indicate a tradeoff between search performance and freshness: the search cost decreases sublinearly with decreasing freshness of P2P content sharing. We also compare two types of unstructured P2P networks and find that clustered P2P networks improve the freshness of content sharing over flat P2P networks under TTL-based consistency.     

Structures of systems 1. Cohomology of manufacturing and supply network-like systems

Understanding the relation between large-scale and small-scale functionality is an acute problem in large systems. This paper presents possible structures that capture those relations. Here “structure” means a functor on a category, in this case the category of “combinatorial systems” that model manufacturing systems and supply networks. The details of the dynamics of these systems are frequently the domain of specialists and are ill understood outside such areas. Clustering activities in subsystems introduces covers as scales of analysis. This allows the development of sheaves of schedules and their properties which are analyzed by an adaptation of ?ech cohomology. These are applied in supply networks to characterize the fragmentation of these networks and to characterize the conditions for local changes in schedules to extend to the whole system. The intent of this paper is to see sheaves and their cohomology as analytical probes that can enhance our understanding of large-scale systems.     

Performance analysis of mesh interconnection networks withdeterministic routing

This paper develops detailed analytical performance models for k-ary n-cube networks with single-hit or infinite buffers, wormhole routing, and the nonadaptive deadlock-free routing scheme proposed by Dally and Seitz (1987). In contrast to previous performance studies of such networks, the system is modeled as a closed queueing network that: includes the effects of blocking and pipelining of messages in the network; allows for arbitrary source-destination probability distributions; and explicitly models the virtual channels used in the deadlock-free routing algorithm. The models are used to examine several performance issues for 2-D networks with shared-memory traffic. These results should prove useful for engineering high-performance systems based on low-dimensional k-ary n-cube networks     

Comparative performance evaluation of hot spot contention betweenMIN-based and ring-based shared-memory architectures

Hot spot contention on a network-based shared-memory architecture occurs when a large number of processors try to access a globally shared variable across the network. While multistage interconnection network (MIN) and hierarchical ring (HR) structures are two important bases on which to build large scale shared-memory multiprocessors, the different interconnection networks and cache/memory systems of the two architectures respond very differently to network bottleneck situations. In this paper, we present a comparative performance evaluation of hot spot effects on the MIN-based and HR-based shared-memory architectures. Both nonblocking MIN-based and HR-based architectures are classified, and analytical models are described for understanding network differences and for evaluating hot spot performance on both architectures. The analytical comparisons indicate that HR-based architectures have the potential to handle various contentions caused by hot spots more efficiently than MIN-based architectures. Intensive performance measurements on hot spots have been conducted on the BBN TC2000 (MIN-based) and the KSR1 (HR-based) machines. Performance experiments were also conducted on the practical experience of hot spots with respect to synchronization lock algorithms. The experimental results are consistent with the analytical models, and present practical observations and an evaluation of hot spots on the two types of architectures     

A priori error estimates for wireless local area network positioning systems

Location determination based on wireless local area networks has received considerable attention as an accurate and inexpensive means of indoor positioning. Research on this topic has mainly focused on experimental systems while little has been done to model and analyse the problem. Yet, analytical models are essential for understanding the influence of system parameters and a system’s overall behaviour. This article introduces two analytical models that can provide pessimistic and optimistic estimates for the location error in a given environment. The findings are compared to measurements and simulations of a probabilistic Wireless LAN positioning system.     

Computer networks design using hybrid fuzzy expert systems

 Designing and configuring large computer networks to support a variety of applications and computational environments is difficult, as it not only requires highly specialized technical skills and knowledge, but also a deep understanding of a dynamic commercial market. Hybrid fuzzy expert systems integrate fuzzy expert systems and neural networks methods replacing classical hard decision methods and providing better performance than traditional techniques. In this paper, we present an integrated fuzzy expert system, machine learning, and neural networks approach to large structured computer networks design and evaluation. After presenting an overview of the system and the major research choices, we describe in detail the system's modules and present examples of its potential use.