Application of Network Calculus To Guaranteed Service Networks

We use recent network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of results that apply min-plus algebra to packet networks. We provide a simple proof that shaping a traffic stream to conform with a burstiness constraint preserves the original constraints satisfied by the traffic stream We show how all rate based packet schedulers can be modeled with a simple rate latency service curve. Then we define a general form of deterministic effective bandwidth and equivalent capacity. We find that call acceptance regions based on deterministic criteria (loss or delay) are convex, in contrast to statistical cases where it the complement of the region which is convex. We thus find that, in general, the limit of the call acceptance region based on statistical multiplexing when the loss probability target tends to 0 may be strictly larger than the call acceptance region based on lossless multiplexing. Lastly, we consider the problem of determining the optimal parameters of a variable bit rate (VBR) connection when it is used as a trunk, or tunnel, given that the input traffic is known. We find that there is an optimal peak rate for the VBR trunk, essentially insensitive to the optimization criteria. For a linear cost function, we find an explicit algorithm for the optimal remaining parameters of the VBR trunk

Quality of service over ATM networks

PhDAbstract not availabl

Sub-Nyquist Field Trial Using Time Frequency Packed DP-QPSK Super-Channel Within Fixed ITU-T Grid

Sub-Nyquist time frequency packing technique was demonstrated for the first time in a super channel field trial transmission over long-haul distances. The technique allows a limited spectral occupancy even with low order modulation formats. The transmission was successfully performed on a deployed Australian link between Sydney and Melbourne which included 995 km of uncompensated SMF with coexistent traffic. 40 and 100 Gb/s co-propagating channels were transmitted together with the super-channel in a 50 GHz ITU-T grid without additional penalty. The super-channel consisted of eight sub-channels with low-level modulation format, i.e. DP-QPSK, guaranteeing better OSNR robustness and reduced complexity with respect to higher order formats. At the receiver side, coherent detection was used together with iterative maximum-a-posteriori (MAP) detection and decoding. A 975 Gb/s DP-QPSK super-channel was successfully transmitted between Sydney and Melbourne within four 50GHz WSS channels (200 GHz). A maximum potential SE of 5.58 bit/s/Hz was achieved with an OSNR=15.8 dB, comparable to the OSNR of the installed 100 Gb/s channels. The system reliability was proven through long term measurements. In addition, by closing the link in a loop back configuration, a potential SE*d product of 9254 bit/s/Hz*km was achieved

Multiplexing regulated traffic streams: design and performance

The main network solutions for supporting QoS rely on traf- fic policing (conditioning, shaping). In particular, for IP networks the IETF has developed Intserv (individual flows regulated) and Diffserv (only ag- gregates regulated). The regulator proposed could be based on the (dual) leaky-bucket mechanism. This explains the interest in network element per- formance (loss, delay) for leaky-bucket regulated traffic. This paper describes a novel approach to the above problem. Explicitly using the correlation structure of the sources’ traffic, we derive approxi- mations for both small and large buffers. Importantly, for small (large) buffers the short-term (long-term) correlations are dominant. The large buffer result decomposes the traffic stream in a stream of constant rate and a periodic impulse stream, allowing direct application of the Brownian bridge approximation. Combining the small and large buffer results by a concave majorization, we propose a simple, fast and accurate technique to statistically multiplex homogeneous regulated sources. To address heterogeneous inputs, we present similarly efficient tech- niques to evaluate the performance of multiple classes of traffic, each with distinct characteristics and QoS requirements. These techniques, applica- ble under more general conditions, are based on optimal resource (band- width and buffer) partitioning. They can also be directly applied to set GPS (Generalized Processor Sharing) weights and buffer thresholds in a shared resource system

Reconfigurable Intelligent Surfaces for Wireless Communications: Principles, Challenges, and Opportunities

Recently there has been a flurry of research on the use of reconfigurable intelligent surfaces (RIS) in wireless networks to create smart radio environments. In a smart radio environment, surfaces are capable of manipulating the propagation of incident electromagnetic waves in a programmable manner to actively alter the channel realization, which turns the wireless channel into a controllable system block that can be optimized to improve overall system performance. In this article, we provide a tutorial overview of reconfigurable intelligent surfaces (RIS) for wireless communications. We describe the working principles of reconfigurable intelligent surfaces (RIS) and elaborate on different candidate implementations using metasurfaces and reflectarrays. We discuss the channel models suitable for both implementations and examine the feasibility of obtaining accurate channel estimates. Furthermore, we discuss the aspects that differentiate RIS optimization from precoding for traditional MIMO arrays highlighting both the arising challenges and the potential opportunities associated with this emerging technology. Finally, we present numerical results to illustrate the power of an RIS in shaping the key properties of a MIMO channel.Comment: to appear in the IEEE Transactions on Cognitive Communications and Networking (TCCN

Comparaison de strategies de calcul de bornes sur NoC

The Kalray MPPA2-256 processor integrates 256 processing cores and 32 management cores on a chip. Theses cores are grouped into clusters, and clusters are connected by a high-performance network on chip (NoC). This NoC provides some hardware mechanisms (egress traffic limiters) that can be configured to offer bounded latencies. This paper presents how network calculus can be used to bound these latencies while computing the routes of data flows, using linear programming. Then, its shows how other approaches can also be used and adapted to analyze this NoC. Their performances are then compared on three case studies: two small coming from previous studies, and one realistic with 128 or 256 flows. On theses cases studies, it shows that modeling the shaping introduced by links is of major importance to get accurate bounds. And when packets are of constant size, the Total Flow Analysis gives, on average, bounds 20%-25% smaller than all other methods

Optical Time-Frequency Packing: Principles, Design, Implementation, and Experimental Demonstration

Time-frequency packing (TFP) transmission provides the highest achievable spectral efficiency with a constrained symbol alphabet and detector complexity. In this work, the application of the TFP technique to fiber-optic systems is investigated and experimentally demonstrated. The main theoretical aspects, design guidelines, and implementation issues are discussed, focusing on those aspects which are peculiar to TFP systems. In particular, adaptive compensation of propagation impairments, matched filtering, and maximum a posteriori probability detection are obtained by a combination of a butterfly equalizer and four 8-state parallel Bahl-Cocke-Jelinek-Raviv (BCJR) detectors. A novel algorithm that ensures adaptive equalization, channel estimation, and a proper distribution of tasks between the equalizer and BCJR detectors is proposed. A set of irregular low-density parity-check codes with different rates is designed to operate at low error rates and approach the spectral efficiency limit achievable by TFP at different signal-to-noise ratios. An experimental demonstration of the designed system is finally provided with five dual-polarization QPSK-modulated optical carriers, densely packed in a 100 GHz bandwidth, employing a recirculating loop to test the performance of the system at different transmission distances.Comment: This paper has been accepted for publication in the IEEE/OSA Journal of Lightwave Technolog