Performance analysis of networks on chips

Modules on a chip (such as processors and memories) are traditionally connected through a single link, called a bus. As chips become more complex and the number of modules on a chip increases, this connection method becomes inefficient because the bus can only be used by one module at a time. Networks on chips are an emerging technology for the connection of on-chip modules. In networks on chips, switches are used to transmit data from one module to another, which entails that multiple links can be used simultaneously so that communication is more efficient. Switches consist of a number of input ports to which data arrives and output ports from which data leaves. If data at multiple input ports has to be transmitted to the same output port, only one input port may actually transmit its data, which may lead to congestion. Queueing theory deals with the analysis of congestion phenomena caused by competition for service facilities with scarce resources. Such phenomena occur, for example, in traffic intersections, manufacturing systems, and communication networks like networks on chips. These congestion phenomena are typically analysed using stochastic models, which capture the uncertain and unpredictable nature of processes leading to congestion (such as irregular car arrivals to a traffic intersection). Stochastic models are useful tools for the analysis of networks on chips as well, due to the complexity of data traffic on these networks. In this thesis, we therefore study queueing models aimed at networks on chips. The thesis is centred around two key models: A model of a switch in isolation, the so-called single-switch model, and a model of a network of switches where all traffic has the same destination, the so-called network of polling stations. For both models we are interested in the throughput (the amount of data transmitted per time unit) and the mean delay (the time it takes data to travel across the network). Single-switch models are often studied under the assumption that the number of ports tends to infinity and that traffic is uniform (i.e., on average equally many packets arrive to all buffers, and all possible destinations are equally likely). In networks on chips, however, the number of buffers is typically small. We introduce a new approximation specifically aimed at small switches with (memoryless) Bernoulli arrivals. We show that, for such switches, this approximation is more accurate than currently known approximations. As traffic in networks on chips is usually non-uniform, we also extend our approximation to non-uniform switches. The key difference between uniform and nonuniform switches is that in non-uniform switches, all queues have a different maximum throughput. We obtain a very accurate approximation of this throughput, which allows us to extend the mean delay approximation. The extended approximation is derived for Bernoulli arrivals and correlated arrival processes. Its accuracy is verified through a comparison with simulation results. The second key model is that of concentrating tree networks of polling stations (polling stations are essentially switches where all traffic has the same output port as destination). Single polling stations have been studied extensively in literature, but only few attempts have been made to analyse networks of polling stations. We establish a reduction theorem that states that networks of polling stations can be reduced to single polling stations while preserving some information on mean waiting times. This reduction theorem holds under the assumption that the last node of the network uses a so-called HoL-based service discipline, which means that the choice to transmit data from a certain buffer may only depend on which buffers are empty, but not on the amount of data in the buffers. The reduction theorem is a key tool for the analysis of networks of polling stations. In addition to this, mean waiting times in single polling stations have to be calculated, either exactly or approximately. To this end, known results can be used, but we also devise a new single-station approximation that can be used for a large subclass of HoL-based service disciplines. Finally, networks on chips typically implement flow control, which is a mechanism that limits the amount of data in the network from one source. We analyse the division of throughput over several sources in a network of polling stations with flow control. Our results indicate that the throughput in such a network is determined by an interaction between buffer sizes, flow control limits, and service disciplines. This interaction is studied in more detail by means of a numerical analysis

Capacity modeling for admission control in WiMAX networks

WiMAX networks support QoS reservation of resources by allowing a new flow to apply for admittance in the system. Thus, there is a need for an accurate estimation of the available capacity to be shared by incoming connections. Admission control algorithm must ensure that, when a new QoS resource reservation is accepted, reservations already present in the system continue having their QoS guarantees honored. Its efficiency is then expressed in terms of accuracy and computational complexity which is the focus of the work in this thesis. Different approaches are presented to compute the aggregated allocated capacity in WiMAX networks and, based on their limitations, the E-Diophantine solution has been proposed. The mathematical foundations for the designed approach are provided along with the performance improvements to be expected, both in accuracy and computational terms, as compared to three alternatives of increasing complexity. The different solutions considered are validated and evaluated with OPNET’s WiMAX simulator in a realistic scenario. Finally, the multi-hop relay case is analyzed: a capacity model description is provided together with a conjectured reuse of the admission control algorithm designed

Wireless Communication Networks for Gas Turbine Engine Testing

A new trend in the field of Aeronautical Engine Health Monitoring is the implementation of wireless sensor networks (WSNs) for data acquisition and condition monitoring to partially replace heavy and complex wiring harnesses, which limit the versatility of the monitoring process as well as creating practical deployment issues. Using wireless technologies instead of fixed wiring will fuel opportunities for reduced cabling, faster sensor and network deployment, increased data acquisition flexibility and reduced cable maintenance costs. However, embedding wireless technology into an aero engine (even in the ground testing application considered here) presents some very significant challenges, e.g. a harsh environment with a complex RF transmission environment, high sensor density and high data-rate. In this paper we discuss the results of the Wireless Data Acquisition in Gas Turbine Engine Testing (WIDAGATE) project, which aimed to design and simulate such a network to estimate network performance and de-risk the wireless techniques before the deployment

Supporting Real-Time Communication in CSMA-Based Networks : the VTP-CSMA Virtual Token Passing Approach

Tese de doutoramento. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 200

Random Access Career Sense Protocol: A Comparative Analysis of Non Persistent and 1 Persistent CSMA

In this paper we discussed the simulation based comparative analysis of two random access carrier sense protocol ie. Non persistent CSMA and 1 persistent CSMA in wireless network taking considering of random back off algorithm. The feedback comparison of both protocols compared with respect to load on medium utilization and average waiting time. Both results are demonstrated in different load conditions

An Integrated Routing and Distributed Scheduling Approach for Hybrid IEEE 802.16E Mesh Networks For Vehicular Broadband Communications

An integrated routing and distributed scheduling approach for fast deployable IEEE 802.16e networks is presented where distributed base stations with dual radios form a mesh backhaul and subscriber stations communicate through these base stations. The mesh backhaul is formed via an IEEE 802.16e mesh mode radio on each base station, while the subscriber stations communicate with base stations via PMP mode radios. The proposed routing scheme divides the deployed network into several routing zones. Each routing zone contains several base stations that form the mesh backhaul with one base station equipped with either a fiber, satellite or any other point-to-point backhaul link to reach a gateway on the core network (for example, Internet or Enterprise Network). Traffic from the subscriber stations is routed by the serving base station through the mesh to the gateway-connected base station using min-hop routing metric. Mobile IP scheme is used to assign a care-of address to a subscriber station that moves from one routing zone to the other, thereby avoiding a change in IP address for network layer applications. The scheduling approach consists of two phases. In the first phase, a centralized mesh scheduling algorithm is applied with collected information on network topology, radio parameters, and initial QoS provisioning requirements. At the same time, each base station derives a PMP schedule for actual demands from associated subscriber stations constrained by the initial mesh schedule. In the second phase, each base station monitors its carried PMP traffic load statistics; to accommodate traffic load changes in a distributed fashion, each base station lends or borrows time slots from neighboring base stations to adjust its mesh and PMP radio schedules. The distributed schedule adaptation method not only allows individual base stations to accommodate short-term increases in bandwidth demands, it also provides the means for optimizing the mesh and PMP schedules with respect to actual bandwidth demands. Several deployment strategies are considered and an analytical model is developed to identify the achievable increase in overall network throughput using the proposed scheduling approach. Simulations are run in network simulator ns-2 to verify results obtained using the analytical model

Spacelab system analysis: A study of communications systems for advanced launch systems

An analysis of the required performance of internal avionics data bases for future launch vehicles is presented. Suitable local area networks that can service these requirements are determined

A Performance Analysis Framework for WiFi/WiMAX Heterogeneous Metropolitan Networks Based on Cross-Layer Design

The communication between network nodes within different protocol domains is often regarded simply as a black box with unknown configuration conditions in the path. We address network heterogeneity using a white box approach and focus on its interconnection processes. To achieve this purpose, a Performance Analysis Framework (PAF) is proposed which is composed of the formalization of the latter using process algebra (PA) and the corresponding teletraffic performance models. In this contribution, we target the IEEE 802.16 and IEEE 802.11 protocols. For the teletraffic models, we extend previous models for such scenario with the inclusion of the following protocol operational parameters (metrics): bit error rate (BER), packet error ratio (PER), and packet length (pl). From the framework teletraffic models, the optimal packet length (OPL), end to end throughput, delay, and packet loss are obtained. The PAF outperforms previous modeling solutions in terms of delay and throughput relative to NS3 simulation results. </jats:p

Spectrum Sharing Methods in Coexisting Wireless Networks

Radio spectrum, the fundamental basis for wireless communication, is a finite resource. The development of the expanding range of radio based devices and services in recent years makes the spectrum scarce and hence more costly under the paradigm of extensive regulation for licensing. However, with mature technologies and with their continuous improvements it becomes apparent that tight licensing might no longer be required for all wireless services. This is from where the concept of utilizing the unlicensed bands for wireless communication originates. As a promising step to reduce the substantial cost for radio spectrum, different wireless technology based networks are being deployed to operate in the same spectrum bands, particularly in the unlicensed bands, resulting in coexistence. However, uncoordinated coexistence often leads to cases where collocated wireless systems experience heavy mutual interference. Hence, the development of spectrum sharing rules to mitigate the interference among wireless systems is a significant challenge considering the uncoordinated, heterogeneous systems. The requirement of spectrum sharing rules is tremendously increasing on the one hand to fulfill the current and future demand for wireless communication by the users, and on the other hand, to utilize the spectrum efficiently. In this thesis, contributions are provided towards dynamic and cognitive spectrum sharing with focus on the medium access control (MAC) layer, for uncoordinated scenarios of homogeneous and heterogeneous wireless networks, in a micro scale level, highlighting the QoS support for the applications. This thesis proposes a generic and novel spectrum sharing method based on a hypothesis: The regular channel occupation by one system can support other systems to predict the spectrum opportunities reliably. These opportunities then can be utilized efficiently, resulting in a fair spectrum sharing as well as an improving aggregated performance compared to the case without having special treatment. The developed method, denoted as Regular Channel Access (RCA), is modeled for systems specified by the wireless local resp. metropolitan area network standards IEEE 802.11 resp. 802.16. In the modeling, both systems are explored according to their respective centrally controlled channel access mechanisms and the adapted models are evaluated through simulation and results analysis. The conceptual model of spectrum sharing based on the distributed channel access mechanism of the IEEE 802.11 system is provided as well. To make the RCA method adaptive, the following enabling techniques are developed and integrated in the design: a RSS-based (Received Signal Strength based) detection method for measuring the channel occupation, a pattern recognition based algorithm for system identification, statistical knowledge based estimation for traffic demand estimation and an inference engine for reconfiguration of resource allocation as a response to traffic dynamics. The advantage of the RCA method is demonstrated, in which each competing collocated system is configured to have a resource allocation based on the estimated traffic demand of the systems. The simulation and the analysis of the results show a significant improvement in aggregated throughput, mean delay and packet loss ratio, compared to the case where legacy wireless systems coexists. The results from adaptive RCA show its resilience characteristics in case of dynamic traffic. The maximum achievable throughput between collocated IEEE 802.11 systems applying RCA is provided by means of mathematical calculation. The results of this thesis provide the basis for the development of resource allocation methods for future wireless networks particularly emphasized to operate in current unlicensed bands and in future models of the Open Spectrum Alliance