Dynamic presentation of tensor model for multipath QoS-routing

The investigation of the multipath QoS-routing dynamic tensor model with quality of service guarantees over the multiple metrics is presented. The expression for modeling state of the network router interface is used for representing the average packet delay as time-varying function. The conditions of ensuring QoS for the set of metrics as the packet rate and average delay are expressed. The novelty of the model is that the network metric is a function of time, and it takes into account that the average queue length and average packet delay take their limit values after convergence time. The results of the research demonstrated that the use of the dynamic tensor model allows ensuring QoS requirements more precisely.

A Forward Resource Reservation (FRR) scheme for Optical Burst Switching (OBS) systems which can reduce the average packet delay during burst assembly is proposed. Mathematical analysis and the simulated performance are in line and validates that average packet delay can be significantly reduced by using the proposed algorithm. The main idea of FRR is to send Burst Header Packet (BHP) before the data burst is assembled. The FRR has been applied to time based, size based and mixed time and size threshold based approaches. The average packet delay and burst sizes have been studied in the three cases.

In modern, competitive, and dynamic access networks the underlying bandwidth distribution mechanism has to be capable of understanding user requirements, meeting stringent quality of service (QoS) demands, and satisfying a broad spectrum of user traffic dynamics. Undoubtedly, optical fiber is the dominant transmission medium enabling practical and cost-effective optical infrastructures in the last mile. Passive optical networks (PONs) represent one of the most promising player towards the fiber to the home (FTTH) vision allowing users to experience high quality, demanding multimedia services and applications. The 10-gigabit-capable passive optical network (XG-PON), one of the latest PON standard, incorporates a set of profound conditions a contemporary PON should ensure. Fairness provisioning constitutes one of the most critical features a PON should provide. However, ensuring fairness in an access network with numerous different users, requesting multiple traffic flows in any time, is not a straightforward task. In this work, we focus on the fairness issue by devising an adaptive, efficient, and fair dynamic bandwidth allocation (DBA) scheme called Insistent FAIr STrategy prOcesS (IFAISTOS). IFAISTOS investigates and maintains user traffic profiles. Overloaded users are carefully treated by gaining greater granting windows than other users; however bandwidth monopolization is prevented. Fairness is ensured for all users in terms of traffic load and average delay. A steering, adaptive mechanism records user traffic profiles by changing and defining bandwidth weights proportional to individual traffic needs. Extensive simulation results reveal the efficacy of the proposed DBA in terms of fairness and average packet delay.

This paper presents an analytical model for studying the average packet delay in optical access network based on GEPON (Gigabit Ethernet Passive Optical Network) technology. Packet delay is calculated by the use of queuing theory. At the stage of network planning, mathematical modeling techniques based on analytical models and methods of queuing theory may be used to predict the quality of service of the designed network. The indicators of quality of service are the average network packet delay and its variation (jitter). This paper proposes bounded Pareto distribution for traffic flow modeling, and a method for delay analysis based on the Kramer and Langenbach-Belz approximation. The results show that the propagation delay exceeds the queuing delay and it is the main component of the delay.

Due to the ever-expanding applications of the Internet-of-Things (IoT), designing energy- and spectrally-efficient transmission schemes to support massive connections and devices is inevitable and still challenging. Thus, energy-harvesting (EH) and cognitive-radio (CR) systems are becoming more inseparable for future IoT networks. This paper analyzes the performance of EH-CR-IoT networks, where closed-form expressions for network metrics, such as GoodPut, collision probability and average packet delay are derived. In addition to the interference caused by spectrum sensing errors, our analysis also incorporates the primary user (PU) return interference into the different network metrics. Furthermore, the effect of primary network traffic behavior and IoT network parameters are investigated. To account for delay-sensitive packets, the average end-to-end delay of packets as well as delay violation probability in the IoT network are mathematically formulated and analyzed as quality-of-service (QoS) measures for network stability. Moreover, the derived metrics can be utilized to optimize the Goodput, subject to various practical constraints. Simulations are also performed to verify the theoretical results. Above all, the effect of energy-harvesting rate on GoodPut and IoT network stability is explored, which provides insights into determining the physical structure of the energy-harvesting system.

In Network-on-chip design two of the most important performance indices are the average delay of packets and power dissipation. The first depends on the level of congestion of the communication system, the second is strongly influenced by the power dissipated by the links of a network-on-chip (NoC) which accounts for a significant fraction of the overall power dissipated by the on-chip communication fabric. Such fraction becomes more and more relevant as technology shrinks. The selection policy of the output port in the NOC router with adaptive routing function affects both the performance and power dissipation. In fact, generally a NOC with a lower average delay has a lower power dissipation on the links for transmission. The selection policies proposed in the literature have the object or the minimization of the average delay or in some cases the reduction of power dissipation. In this paper we propose a selection policy aimed at minimizing both the average delay and power consumption of the communication system of NoC based architectures. The proposed policy uses a cost function obtained using a Fuzzy Rule Base System (FRBS) with two inputs an one output. Inputs are the level of use of the buffers of the downstream routers, and the link power dissipation of the selected output. The output of FRBS is the cost function. The experimental results, obtained using a cycle accurate NoC simulator for different traffic scenarios, shows that the proposed selection policy outperforms other selection approaches both in terms of average delay and in terms on power dissipation and energy consumption.

The first widely used communication infrastructure was the telephone network, often known as a connection-oriented or circuit-switched network. While making a phone call, these networks will first set up a connection, and then tear it down after the call has ended. The connection made during the call would not be used again. Thus, connectionless or packet-switched networks have been introduced, with an aim to send voice signals as data packets. When compared to conventional network architecture, SDN's separation of the data plane and control plane of networking devices makes the management of these devices directly programmable via a centralised controller. It uses a MAS-based distributed architecture to categorise network flows, and it's called the Traffic Classification Module. Each host or server's high-priority application traffic is isolated via Deep Packet Inspection (DPI). The time consumed for a packet to travel from one endpoint to another is referred to as the average packet delay, whereas the controller's reaction time is twice the average packet delay. Few works existed that utilised routing strategies to decrease the typical packet delay in SDN. To reduce the controller's response time, Software-Defined Networks (SDNs) need a routing algorithm that reduces the average packet delay. Each of the proposed modules and the whole combined SDN-MASTE framework were put through their paces in a series of experiments and emulation-based tests to see how well they performed.

A MAC layer power management scheme for efficient energy delay tradeoff in a WLAN

Adaptive global coordination of local routing policies for communication networks

In this paper, we consider medium access control (MAC) protocol design for random-access cognitive radio (CR) networks. A two-level opportunistic spectrum access strategy is proposed to optimize the system performance of the secondary network and to adequately protect the operation of the primary network. At the first level, secondary users (SUs) maintain a sufficient detection probability to avoid interference with primary users (PUs), and the spectrum sensing time is optimized to control the total traffic rate of the secondary network allowed for random access when the channel is detected to be available. At the second level, two MAC protocols called the slotted cognitive radio ALOHA (CR-ALOHA) and cognitive-radio-based carrier-sensing multiple access (CR-CSMA) are developed to deal with the packet scheduling of the secondary network. We employ normalized throughput and average packet delay as the network metrics and derive closed-form expressions to evaluate the performance of the secondary network for our proposed protocols. Moreover, we use the interference and agility factors as the performance parameters to measure the protection effects on the primary network. For various frame lengths and numbers of SUs, the optimal performance of throughput and delay can be achieved at the same spectrum sensing time, and there also exists a tradeoff between the achievable performance of the secondary network and the effects of protection on the primary network. Simulation results show that the CR-CSMA protocol outperforms the slotted CR-ALOHA protocol and that the PUs' activities have an influence on the performance of SUs for both the slotted CR-ALOHA and CR-CSMA.

Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. Wireless mesh network which engages broadcasting and contains multiple hops become increasingly vulnerable to problems such as routing problem and rapid increasing of overhead packets. During this progress, the delay on account of multi hop characteristics and redundant packets caused by communication nature potentially existed during communication. Typically, delay will increase in linearity with number of hops. There is a certain minimum level of delay that will be experienced due to the time it takes to transmit a packet through a link. Topology development holds a significant point prior to the data transmission. Without improved topology development protocol, this problem can decrease network’s performance in overall data transmission. We analyze the delay performance of a multi-hop wireless network with a dynamic route between each source and final destination pair. There are fluctuate interference constraints on the set of links that impose a fundamental delay performance of any instant network topology. At first, we present a similar Link State Routing network simulation to derive such referential lower bounds. We conduct extensive simulation studies to suggest that the average delay of multi-hop transmission policy can be made lower compared to the referential bound by using appropriate functions of network metrics. This paper provides a broadcast framework that engages various network metrics and at the same time maintaining connectivity of nodes (mobile terminals). The framework captures the essential features of the wireless network metrics, i.e. bandwidth, throughput, network buffer, direction, and round trip time. This research is useful since, in many cases, it find that the throughput is the most important parameter in reduction of delay transmission. This result is confirmed with another composite simulation result. Most of network hop delay is impacted with this composite metric, particularly in delay minimization on the longer hops. The reduction achievement on average delay by this algorithm is 0.577% and the total average delay reduction for this simulated network is 0.683%. This research will be further designed primarily for achieving maximum throughput in the multiple wireless network area.

To solve the problem of multi-priority and multi-business tasks in wireless sensor networks, a two-level polling control system is proposed based on the basic polling system. The system divides the sites into ordinary sites and high-priority site according to business priorities. The ordinary sites use gated services, and the high-priority sites use exhaustive services. The mathematical model of the system is established by using the method of Markov chain and probability generating function, and the important parameters such as query period, throughput, average queue length and average delay are obtained. The simulation results are approximately equal to the theoretical calculation results, which shows that the theoretical analysis method is correct and effective. While distinguishing priority services, the system ensures the delay of users and improves the quality of service of the polling system.

In this paper, we evaluate the performance of multicasting in a single-hop local lightwave network based on a broadcast-and-select system. We use an approximate analytical solution and Markov model to show the effect of tuning time on the average packet delay and offered load. We also show the trade-off between the average packet delay and the number of wavelengths for the network.

The development of protocol standards and the low cost of wireless equipment increased the number of wireless network installations in public (airports, universities campuses) and private (enterprises, homes) areas all over the world. This research effort examines the IEEE 802.11 protocol that dominates wireless local area networks (WLANs). Specifically, it investigates the performance of the Distributed Coordination Function (DCF) of ΙEEE 802.11 Medium Access Control (MAC) protocol. The objective of this thesis is to contribute in the research for the development of a simple and effective MAC sub-layer for WLANs that utilize the IEEE 802.11 protocol. Mathematical models are developed to calculate the following metrics in order to examine the performance of DCF that use Binary Exponential Backoff (BEB) algorithm: a) average packet delay per backoff stage and probability per backoff stage b) average packet delay, c) packet jitter, d) packet drop probability, e) average packet drop time, f) packet delay distribution, and g) cumulative packet delay distribution. An admission control algorithm is also presented. The proposed mathematical models are a) simple, as expressed with relatively simple mathematical relations, b) accurate, since they are validated by comparing analytical against simulation results and show that the proposed models are fairly accurate, and c) provide results in short period of time. Different scenarios of WLANs are examined to investigate the effect of DCF parameters in performance and to define the system parameters values that improve the performance of the IEEE 802.11 protocol. The analysis of metrics and the application of their outcomes to WLANs contribute in the design and development of more efficient access methods to wireless medium. The main contribution of this thesis is that packet delay is investigated thoroughly as a measure of WLAN performance.%%%%Η ανάπτυξη προτύπων για τα ασύρματα τοπικά δίκτυα σe συνδυασμό μe το χαμηλό κόστος της ασύρματης τeχνολογίας eπέτρeψe την ραγδαία eξαπλωση των ασυρμάτων δικτύων σe κοινόχρηστους και σe ιδιωτικούς χώρους όπως πανeπιστήμια, πλατeίeς, αeροδρόμια, γραφeία eπιχeιρήσeων, οικίeς, κλπ. Η παρούσα διατριβή μeλeτά το πρωτόκολλο ΙEEE 802.11 το οποίο κυριαρχeί στα ασύρματα τοπικά δίκτυα. Eιδικότeρα eρeυνά την απόδοση της κατανeμημένης διαδικασίας πρόσβασης DCF του υποeπιπέδου MAC του ΙEEE 802.11. Σκοπός της παρούσας eρeυνητικής προσπάθeιας eίναι η συμβολή στην έρeυνα για την ανάπτυξη eνός απλού και αποτeλeσματικού υποeπιπέδου πρόσβασης μέσου MAC στα ασύρματα δίκτυα που βασίζονται στο πρωτόκολλο ΙEEE 802.11. Αναπτύσσονται μαθηματικά μοντέλα για τον υπολογισμό των ακόλουθων μeτρικών για την απόδοση της διαδικασίας DCF που χρησιμοποιeί τον αλγόριθμο eκθeτικής οπισθοχώρησης ΒEΒ: α) την μέση καθυστέρηση των πακέτων ανά βαθμίδα οπισθοχώρησης και την πιθανότητα ανά βαθμίδα οπισθοχώρησης, β) την μέση καθυστέρηση των πακέτων, γ) την κατανομή των καθυστeρήσeων των πακέτων, δ) την αθροιστική κατανομή των καθυστeρήσeων, e) την διακύμανση των καθυστeρήσeων των…

The dynamic frame sizing algorithm is a throughput-optimal algorithm that can achieve maximum network throughput without the knowledge of arrival rates. Motivated by the need for energy-efficient communication in wireless networks, in this paper, we propose a new dynamic frame sizing algorithm, called the Greenput algorithm, that takes power allocation into account. In our Greenput algorithm, time is partitioned into frames, and the frame size of each frame is determined based on the backlogs presented at the beginning of a frame. To obtain a good delay-energy efficiency tradeoff, the key insight of our Greenput algorithm is to reduce transmit power to save energy when the backlogs are low so as not to incur too much packet delay. For this, we define a threshold parameter $T_{\max }$ (for the minimum time to empty the backlogs with maximum power allocation), and the Greenput algorithm enters the (mixed) power-saving mode when the backlogs are below the threshold. Using a large deviation bound, we prove that our Greenput algorithm is still throughput optimal. In addition to the stability result, we also perform a fluid approximation analysis for energy efficiency and average packet delay when $T_{\max }$ is very large. To show the delay-energy efficiency tradeoff, we conduct extensive computer simulations by using the Shannon formula as the channel model in a wireless network. Our simulation results show that both energy efficiency and average packet delay are quite close to their fluid approximations even when $T_{\max }$ is moderately large.