Cross-layer modeling and optimization of next-generation internet networks

Scaling traditional telecommunication networks so that they are able to cope with the volume of future traffic demands and the stringent European Commission (EC) regulations on emissions would entail unaffordable investments. For this very reason, the design of an innovative ultra-high bandwidth power-efficient network architecture is nowadays a bold topic within the research community. So far, the independent evolution of network layers has resulted in isolated, and hence, far-from-optimal contributions, which have eventually led to the issues today's networks are facing such as inefficient energy strategy, limited network scalability and flexibility, reduced network manageability and increased overall network and customer services costs. Consequently, there is currently large consensus among network operators and the research community that cross-layer interaction and coordination is fundamental for the proper architectural design of next-generation Internet networks. This thesis actively contributes to the this goal by addressing the modeling, optimization and performance analysis of a set of potential technologies to be deployed in future cross-layer network architectures. By applying a transversal design approach (i.e., joint consideration of several network layers), we aim for achieving the maximization of the integration of the different network layers involved in each specific problem. To this end, Part I provides a comprehensive evaluation of optical transport networks (OTNs) based on layer 2 (L2) sub-wavelength switching (SWS) technologies, also taking into consideration the impact of physical layer impairments (PLIs) (L0 phenomena). Indeed, the recent and relevant advances in optical technologies have dramatically increased the impact that PLIs have on the optical signal quality, particularly in the context of SWS networks. Then, in Part II of the thesis, we present a set of case studies where it is shown that the application of operations research (OR) methodologies in the desing/planning stage of future cross-layer Internet network architectures leads to the successful joint optimization of key network performance indicators (KPIs) such as cost (i.e., CAPEX/OPEX), resources usage and energy consumption. OR can definitely play an important role by allowing network designers/architects to obtain good near-optimal solutions to real-sized problems within practical running times

Robust distributed resource allocation for cellular vehicle-to-vehicle communication

Mit Release 14 des LTE Standards unterstützt dieser die direkte Fahrzeug-zu-Fahrzeug-Kommunikation über den Sidelink. Diese Dissertation beschäftigt sich mit dem Scheduling Modus 4, einem verteilten MAC-Protokoll ohne Involvierung der Basisstation, das auf periodischer Wiederverwendung von Funkressourcen aufbaut. Der Stand der Technik und eine eigene Analyse des Protokolls decken verschiedene Probleme auf. So wiederholen sich Kollisionen von Paketen, wodurch manche Fahrzeuge für längere Zeit keine sicherheitskritischen Informationen verbreiten können. Kollisionen entstehen vermehrt auch dadurch, dass Hidden-Terminal-Probleme in Kauf genommen werden oder veränderliche Paketgrößen und -raten schlecht unterstützt werden. Deshalb wird ein Ansatz namens "Scheduling based on Acknowledgement Feedback Exchange" vorgeschlagen. Zunächst wird eine Funkreservierung in mehrere ineinander verschachtelte Unter-Reservierungen mit verschiedenen Funkressourcen unterteilt, was die Robustheit gegenüber wiederholenden Kollisionen erhöht. Dies ist die Grundlage für eine verteilte Staukontrolle, die die Periodizitätseigenschaft nicht verletzt. Außerdem können so veränderliche Paketgrößen oder -raten besser abgebildet werden. Durch die periodische Wiederverwendung können Acknowledgements für Funkressourcen statt für Pakete ausgesendet werden. Diese können in einer Bitmap in den Padding-Bits übertragen werden. Mittels der Einbeziehung dieser Informationen bei der Auswahl von Funkressourcen können Hidden-Terminal-Probleme effizient vermieden werden, da die Acknowledgements auch eine Verwendung dieser Funkressource ankündigen. Kollisionen können nun entdeckt und eine Wiederholung vermieden werden. Die Evaluierung des neuen MAC-Protokolls wurde zum großen Teil mittels diskreter-Event-Simulationen durchgeführt, wobei die Bewegung jedes einzelnen Fahrzeuges simuliert wurde. Der vorgeschlagene Ansatz führt zu einer deutlich erhöhten Paketzustellrate. Die Verwendung einer anwendungsbezogenen Awareness-Metrik zeigt, dass die Zuverlässigkeit der Kommunikation durch den Ansatz deutlich verbessert werden kann. Somit zeigt sich der präsentierte Ansatz als vielversprechende Lösung für die erheblichen Probleme, die der LTE Modus 4 mit sich bringt.The LTE Standard added support for a direct vehicle-to-vehicle communication via the Sidelink with Release 14. This dissertation focuses on the scheduling Mode 4, a distributed MAC protocol without involvement of the base station, which requires the periodic reuse of radio resources. The state of the art and a own analysis of this protocol unveil multiple problems. For example, packet collisions repeat in time, so that some vehicles are unable to distribute safety-critical information for extended periods of time. Collisions also arise due to the hidden-terminal problem, which is simply put up with in Mode 4. Additionally, varying packet sizes or rates can hardly be supported. Consequently, an approach called "Scheduling based on Acknowledgement Feedback Exchange" is proposed. Firstly, a reservation of radio resources is split into multiple, interleaved sub-reservations that use different radio resources. This increases the robustness against repeating collisions. It is also the basis for a distributed congestion control that does not violate the periodicity. Moreover, different packet rates or sizes can be supported. The periodic reuse of radio resources enables the transmission of acknowledgements for radio resources instead of packets. These can be transmitted in a bitmap inside the padding bits. Hidden-terminal problems can be mitigated by considering the acknowledgements when selecting radio resources as they announce the use of these radio resources. Collisions can also be detected and prevented from re-occurring. The evaluation of the MAC protocol is mostly performed using discrete-event simulations, which model the movement of every single vehicle. The presented approach leads to a clear improvement of the packet delivery rate. The use of an application-oriented metric shows that the communication robustness can be improved distinctly. The proposed approach hence presents itself as a promising solution for the considerable problems of LTE Mode 4

Signal Processing for Compressed Sensing Multiuser Detection

The era of human based communication was longly believed to be the main driver for the development of communication systems. Already nowadays we observe that other types of communication impact the discussions of how future communication system will look like. One emerging technology in this direction is machine to machine (M2M) communication. M2M addresses the communication between autonomous entities without human interaction in mind. A very challenging aspect is the fact that M2M strongly differ from what communication system were designed for. Compared to human based communication, M2M is often characterized by small and sporadic uplink transmissions with limited data-rate constraints. While current communication systems can cope with several 100 transmissions, M2M envisions a massive number of devices that simultaneously communicate to a central base-station. Therefore, future communication systems need to be equipped with novel technologies facilitating the aggregation of massive M2M. The key design challenge lies in the efficient design of medium access technologies that allows for efficient communication with small data packets. Further, novel physical layer aspects have to be considered in order to reliable detect the massive uplink communication. Within this thesis physical layer concepts are introduced for a novel medium access technology tailored to the demands of sporadic M2M. This concept combines advances from the field of sporadic signal processing and communications. The main idea is to exploit the sporadic structure of the M2M traffic to design physical layer algorithms utilizing this side information. This concept considers that the base-station has to jointly detect the activity and the data of the M2M nodes. The whole framework of joint activity and data detection in sporadic M2M is known as Compressed Sensing Multiuser Detection (CS-MUD). This thesis introduces new physical layer concepts for CS-MUD. One important aspect is the question of how the activity detection impacts the data detection. It is shown that activity errors have a fundamentally different impact on the underlying communication system than data errors have. To address this impact, this thesis introduces new algorithms that aim at controlling or even avoiding the activity errors in a system. It is shown that a separate activity and data detection is a possible approach to control activity errors in M2M. This becomes possible by considering the activity detection task in a Bayesian framework based on soft activity information. This concept allows maintaining a constant and predictable activity error rate in a system. Beyond separate activity and data detection, the joint activity and data detection problem is addressed. Here a novel detector based on message passing is introduced. The main driver for this concept is the extrinsic information exchange between different entities being part of a graphical representation of the whole estimation problem. It can be shown that this detector is superior to state-of-the-art concepts for CS-MUD. Besides analyzing the concepts introduced simulatively, this thesis also shows an implementation of CS-MUD on a hardware demonstrator platform using the algorithms developed within this thesis. This implementation validates that the advantages of CS-MUD via over-the-air transmissions and measurements under practical constraints

Design and analysis of a 3-dimensional cluster multicomputer architecture using optical interconnection for petaFLOP computing

In this dissertation, the design and analyses of an extremely scalable distributed multicomputer architecture, using optical interconnects, that has the potential to deliver in the order of petaFLOP performance is presented in detail. The design takes advantage of optical technologies, harnessing the features inherent in optics, to produce a 3D stack that implements efficiently a large, fully connected system of nodes forming a true 3D architecture. To adopt optics in large-scale multiprocessor cluster systems, efficient routing and scheduling techniques are needed. To this end, novel self-routing strategies for all-optical packet switched networks and on-line scheduling methods that can result in collision free communication and achieve real time operation in high-speed multiprocessor systems are proposed. The system is designed to allow failed/faulty nodes to stay in place without appreciable performance degradation. The approach is to develop a dynamic communication environment that will be able to effectively adapt and evolve with a high density of missing units or nodes. A joint CPU/bandwidth controller that maximizes the resource allocation in this dynamic computing environment is introduced with an objective to optimize the distributed cluster architecture, preventing performance/system degradation in the presence of failed/faulty nodes. A thorough analysis, feasibility study and description of the characteristics of a 3-Dimensional multicomputer system capable of achieving 100 teraFLOP performance is discussed in detail. Included in this dissertation is throughput analysis of the routing schemes, using methods from discrete-time queuing systems and computer simulation results for the different proposed algorithms. A prototype of the 3D architecture proposed is built and a test bed developed to obtain experimental results to further prove the feasibility of the design, validate initial assumptions, algorithms, simulations and the optimized distributed resource allocation scheme. Finally, as a prelude to further research, an efficient data routing strategy for highly scalable distributed mobile multiprocessor networks is introduced

Incentive-driven QoS in peer-to-peer overlays

A well known problem in peer-to-peer overlays is that no single entity has control over the software, hardware and configuration of peers. Thus, each peer can selfishly adapt its behaviour to maximise its benefit from the overlay. This thesis is concerned with the modelling and design of incentive mechanisms for QoS-overlays: resource allocation protocols that provide strategic peers with participation incentives, while at the same time optimising the performance of the peer-to-peer distribution overlay. The contributions of this thesis are as follows. First, we present PledgeRoute, a novel contribution accounting system that can be used, along with a set of reciprocity policies, as an incentive mechanism to encourage peers to contribute resources even when users are not actively consuming overlay services. This mechanism uses a decentralised credit network, is resilient to sybil attacks, and allows peers to achieve time and space deferred contribution reciprocity. Then, we present a novel, QoS-aware resource allocation model based on Vickrey auctions that uses PledgeRoute as a substrate. It acts as an incentive mechanism by providing efficient overlay construction, while at the same time allocating increasing service quality to those peers that contribute more to the network. The model is then applied to lagsensitive chunk swarming, and some of its properties are explored for different peer delay distributions. When considering QoS overlays deployed over the best-effort Internet, the quality received by a client cannot be adjudicated completely to either its serving peer or the intervening network between them. By drawing parallels between this situation and well-known hidden action situations in microeconomics, we propose a novel scheme to ensure adherence to advertised QoS levels. We then apply it to delay-sensitive chunk distribution overlays and present the optimal contract payments required, along with a method for QoS contract enforcement through reciprocative strategies. We also present a probabilistic model for application-layer delay as a function of the prevailing network conditions. Finally, we address the incentives of managed overlays, and the prediction of their behaviour. We propose two novel models of multihoming managed overlay incentives in which overlays can freely allocate their traffic flows between different ISPs. One is obtained by optimising an overlay utility function with desired properties, while the other is designed for data-driven least-squares fitting of the cross elasticity of demand. This last model is then used to solve for ISP profit maximisation