In recent years, Internet and IP technologies have made inroads into almost every commu- nication market ranging from best-effort services such as email and Web, to soft real-time applications such as VoIP, IPTV, and video. However, providing a transport service over IP that meets the timeliness and availability requirements of soft real-time applications has turned out to be a complex task. Although network solutions such as IntServ, DiffServ, MPLS, and VRRP have been suggested, these solutions many times fail to provide a trans- port service for soft real-time applications end to end. Additionally, they have so far only been modestly deployed. In light of this, this thesis considers transport protocols for soft real-time applications. Part I of the thesis focuses on the design and analysis of transport protocols for soft real- time multimedia applications with lax deadlines such as image-intensive Web applications. Many of these applications do not need a completely reliable transport service, and to this end Part I studies so-called partially reliable transport protocols, i.e., transport protocols that enable applications to explicitly trade reliability for improved timeliness. Specifically, Part I investigates the feasibility of designing retransmission-based, partially reliable transport protocols that are congestion aware and fair to competing traffic. Two transport protocols are presented in Part I, PRTP and PRTP-ECN, which are both extensions to TCP for partial reliability. Simulations and theoretical analysis suggest that these transport protocols could give a substantial improvement in throughput and jitter as compared to TCP. Additionally, the simulations indicate that PRTP-ECN is TCP friendly and fair against competing congestion- aware traffic such as TCP flows. Part I also presents a taxonomy for retransmission-based, partially reliable transport protocols. Part II of the thesis considers the Stream Control Transmission Protocol (SCTP), which was developed by the IETF to transfer telephony signaling traffic over IP. The main focus of Part II is on evaluating the SCTP failover mechanism. Through extensive experiments, it is suggested that in order to meet the availability requirements of telephony signaling, SCTP has to be configured much more aggressively than is currently recommended by IETF. Fur- thermore, ways to improve the transport service provided by SCTP, especially with regards to the failover mechanism, are suggested. Part II also studies the effects of Head-of-Line Blocking (HoLB) on SCTP transmission delays. HoLB occurs when packets in one flow block packets in another, independent, flow. The study suggests that the short-term effects of HoLB could be substantial, but that the long-term effects are marginal.

Priority based scheduling disciplines are widely used by existing computer operating systems. However, the mathematical analysis and modelling of these systems present great difficulties since priority schedulling is not compatible with exact product form solutions of queueing network models (QNM's). It is therefore, necessary to employ credible approximate techniques for solving QNM's with priority classes. The principle of maximum entropy (ME) is a method of inference for estimating a probability distribution given prior information in the form of expected values. This principle is applied, based on marginal utilisation, mean queue length and idle state probability constraints, to characterise new product-form approximations for general open and closed QNM's with priority (preemptive-resume, non-preemtive head-of-line) and non-priority (first-come-first-served, processor-sharing, last-come-first-served with, or without preemtion) servers. The ME solutions are interpreted in terms of a decomposition of the original network into individual stable GIG11 queueing stations with assumed renewal arrival processes. These solutions are implemented by making use of the generalised exponential (GE) distributional model to approximate the interarrival-time and service-time distributions in the network. As a consequence the ME queue length distribution of the stable GE/GEzl priority queue, subject to mean value constraints obtained via classical queueing theory on bulk queues, is used as a 'building block' together with corresponding universal approximate flow formulae for the analysis of general QNM's with priorities. The credibility of the ME method is demonstrated with illustrative numerical examples and favourable comparisons against exact, simulation and other approximate methods are made.

Priority based scheduling disciplines are widely used by existing computer operating systems. However, the mathematical analysis and modelling of these systems present great difficulties since priority schedulling is not compatible with exact product form solutions of queueing network models (QNM's). It is therefore, necessary to employ credible approximate techniques for solving QNM's with priority classes. The principle of maximum entropy (ME) is a method of inference for estimating a probability distribution given prior information in the form of expected values. This principle is applied, based on marginal utilisation, mean queue length and idle state probability constraints, to characterise new product-form approximations for general open and closed QNM's with priority (preemptive-resume, non-preemtive head-of-line) and non-priority (first-come-first-served, processor-sharing, last-come-first-served with, or without preemtion) servers. The ME solutions are interpreted in terms of a decomposition of the original network into individual stable GIG11 queueing stations with assumed renewal arrival processes. These solutions are implemented by making use of the generalised exponential (GE) distributional model to approximate the interarrival-time and service-time distributions in the network. As a consequence the ME queue length distribution of the stable GE/GEzl priority queue, subject to mean value constraints obtained via classical queueing theory on bulk queues, is used as a 'building block' together with corresponding universal approximate flow formulae for the analysis of general QNM's with priorities. The credibility of the ME method is demonstrated with illustrative numerical examples and favourable comparisons against exact, simulation and other approximate methods are made. / Algerian government

In recent years, Internet and IP technologies have made inroads into almost every communication market ranging from best-effort services such as email and Web, to soft real-time applications such as VoIP, IPTV, and video. However, providing a transport service over IP that meets the timeliness and availability requirements of soft real-time applications has turned out to be a complex task. Although network solutions such as IntServ, DiffServ, MPLS, and VRRP have been suggested, these solutions many times fail to provide a transport service for soft real-time applications end to end. Additionally, they have so far only been modestly deployed. In light of this, this thesis considers transport protocols for soft real-time applications. Part I of the thesis focuses on the design and analysis of transport protocols for soft real-time multimedia applications with lax deadlines such as image-intensive Web applications. Many of these applications do not need a completely reliable transport service, and to this end Part I studies so-called partially reliable transport protocols, i.e., transport protocols that enable applications to explicitly trade reliability for improved timeliness. Specifically, Part I investigates the feasibility of designing retransmission-based, partially reliable transport protocols that are congestion aware and fair to competing traffic. Two transport protocols are presented in Part I, PRTP and PRTP-ECN, which are both extensions to TCP for partial reliability. Simulations and theoretical analysis suggest that these transport protocols could give a substantial improvement in throughput and jitter as compared to TCP. Additionally, the simulations indicate that PRTP-ECN is TCP friendly and fair against competing congestion-aware traffic such as TCP flows. Part I also presents a taxonomy for retransmission-based, partially reliable transport protocols. Part II of the thesis considers the Stream Control Transmission Protocol (SCTP), which was developed by the IETF to transfer telephony signaling traffic over IP. The main focus of Part II is on evaluating the SCTP failover mechanism. Through extensive experiments, it is suggested that in order to meet the availability requirements of telephony signaling, SCTP has to be configured much more aggressively than is currently recommended by IETF. Furthermore, ways to improve the transport service provided by SCTP, especially with regards to the failover mechanism, are suggested. Part II also studies the effects of Head-of-Line Blocking (HoLB) on SCTP transmission delays. HoLB occurs when packets in one flow block packets in another, independent, flow. The study suggests that the short-term effects of HoLB could be substantial, but that the long-term effects are marginal.

<p>  Modern datacenter network applications continue to demand ultra low latencies and very high throughputs. At the same time, network infrastructure keeps achieving higher speeds and larger bandwidths. We still need better network management solutions to keep these two demand and supply fronts go hand-in-hand. There are key metrics that define network performance such as flow completion time (the lower the better), throughput (the higher the better), and end-to-end latency (the lower the better) that are mainly governed by how effectively network application get their fair share of network resources. We observe that buffer utilization on network switches gives a very accurate indication of network performance. Therefore, network buffer management is important in modern datacenter networks, and other network management solutions can be efficiently built around buffer utilization. This dissertation presents three solutions based on buffer use on network switches.</p> <p>  This dissertation consists of three main sections. The first section is on a specification language for buffer management in modern programmable switches. The second section is on a congestion control solution for Remote Direct Memory Access (RDMA) networks. The third section is on a solution to head-of-the-line blocking in modern datacenter networks.</p>

Yes / One of the main features of the third generation (3G) mobile networks is their capability to provide different classes of services; especially multimedia and real-time services in addition to the traditional telephony and data services. These new services, however, will require higher Quality of Service (QoS) constraints on the network mainly regarding delay, delay variation and packet loss. Additionally, the overall traffic profile in both the air interface and inside the network will be rather different than used to be in today's mobile networks. Therefore, providing QoS for the new services will require more than what a call admission control algorithm can achieve at the border of the network, but also continuous buffer control in both the wireless and the fixed part of the network to ensure that higher priority traffic is treated in the proper way. This paper proposes and analytically evaluates a buffer management scheme that is based on multi-level priority and Complete Buffer Sharing (CBS) policy for all buffers at the border and inside the wireless network. The analytical model is based on the G/G/1/N censored queue with single server and R (R¿2) priority classes under the Head of Line (HoL) service rule for the CBS scheme. The traffic is modelled using the Generalised Exponential distribution. The paper presents an analytical solution based on the approximation using the Maximum Entropy (ME) principle. The numerical results show the capability of the buffer management scheme to provide higher QoS for the higher priority service classes.

IEEE 802.11 wireless LANs operating in the infrastructure mode are extremely popular and have seen widespread deployment because of their convenience and cost efficiency. A large number of research studies have investigated the performance of DCF, the default MAC protocol in 802.11 WLANs. Previous studies have pointed out several performance problems caused by the interaction of DCF in infrastructure-based WLANs. This thesis addresses a few of these issues. In the first part of the thesis, we address the issue of head-of-line (HOL) blocking at the Access Point (AP) in infrastructure WLANs. We use a cooperative ARQ scheme to resolve the obstruction at the AP queue. We analytically study the performance of our scheme in a single cell IEEE 802.11 infrastructure WLAN under a TCP controlled file download scenario and validate our analysis by extensive simulations. Both analysis and simulation results show considerable increase in system throughput with the cooperative ARQ scheme. We further examine the delay performance of the ARQ scheme in the presence of both elastic TCP traffic and delay sensitive VoIP traffic. Simulations results show that our scheme decreases the delay in the downlink for VoIP packets significantly while simultaneously providing considerable gains in the TCP download throughput. Next, we propose a joint uplink/downlink opportunistic scheduling scheme for maximising system throughput in infrastructure WLANs. We first solve the uplink/downlink unfairness that exists in infrastructure WLANs by maintaining a separate queue and a backoff timer at the AP for each mobile station (STA). We also increase the system throughput by making the backoff timer a function of the channel gains. We analyse the I performance of our scheme under symmetric UDP traffic with i. i. d. channel conditions. Finally, we discuss several opportunistic scheduling policies which aim to increase the system throughput while satisfying certain Quality of Service (QoS) objectives. The standard IEEE 802.11 DCF protocol only offers best-effort services and does not provide any QoS guarantees. Providing QoS in 802.11 networks with time varying channel conditions has proven to be a challenge. We show by simulations that by an appropriate choice of the scheduling metric in our opportunistic scheduling scheme, different QOS objectives like maximizing weighted system sum throughput, minimum rate guarantees and throughput optimality can be attained.

No / A review is carried out on the characterisation and algorithmic implementation of an extended product-form approximation, based on the principle of maximum entropy (ME), for a wide class of arbitrary finite capacity open queueing network models (QNMs) with service and space priorities. A single server finite capacity GE/GE/1/N queue with R (R>1) distinct priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed batches and generalised exponential (GE) service times is analysed via entropy maximisation, subject to suitable GE-type queueing theoretic constraints, under preemptive resume (PR) and head-of-line (HOL) scheduling rules combined with complete buffer sharing (CBS) and partial buffer sharing (PBS) management schemes stipulating a sequence of buffer thresholds {N=(N1,¿,NR),0<Ni¿Ni¿1,i=2,¿,R}. The GE/GE/1/N queue is utilised, in conjunction with GE-type first two moment flow approximation formulae, as a cost-effective building block towards the establishment of a generic ME queue-by-queue decomposition algorithm for arbitrary open QNMs with space and service priorities under repetitive service blocking with random destination (RS-RD). Typical numerical results are included to illustrate the credibility of the ME algorithm against simulation for various network topologies and define experimentally pessimistic GE-type performance bounds. Remarks on the extensions of the ME algorithm to other types of blocking mechanisms, such as repetitive service blocking with fixed destination (RS-FD) and blocking-after-service (BAS), are included.