Performance Evaluation of Transition-based Systems with Applications to Communication Networks

Since the beginning of the twenty-first century, communication systems have witnessed a revolution in terms of their hardware capabilities. This transformation has enabled modern networks to stand up to the diversity and the scale of the requirements of the applications that they support. Compared to their predecessors that primarily consisted of a handful of homogeneous devices communicating via a single communication technology, today's networks connect myriads of systems that are intrinsically different in their functioning and purpose. In addition, many of these devices communicate via different technologies or a combination of them at a time. All these developments, coupled with the geographical disparity of the physical infrastructure, give rise to network environments that are inherently dynamic and unpredictable. To cope with heterogeneous environments and the growing demands, network units have taken a leap from the paradigm of static functioning to that of adaptivity. In this thesis, we refer to adaptive network units as transition-based systems (TBSs) and the act of adapting is termed as transition. We note that TBSs not only reside in diverse environment conditions, their need to adapt also arises following different phenomena. Such phenomena are referred to as triggers and they can occur at different time scales. We additionally observe that the nature of a transition is dictated by the specified performance objective of the relevant TBS and we seek to build an analytical framework that helps us derive a policy for performance optimization. As the state of the art lacks a unified approach to modelling the diverse functioning of the TBSs and their varied performance objectives, we first propose a general framework based on the theory of Markov Decision Processes. This framework facilitates optimal policy derivation in TBSs in a principled manner. In addition, we note the importance of bespoke analyses in specific classes of TBSs where the general formulation leads to a high-dimensional optimization problem. Specifically, we consider performance optimization in open systems employing parallelism and closed systems exploiting the benefits of service batching. In these examples, we resort to approximation techniques such as a mean-field limit for the state evolution whenever the underlying TBS deals with a large number of entities. Our formulation enables calculation of optimal policies and provides tangible alternatives to existing frameworks for Quality of Service evaluation. Compared to the state of the art, the derived policies facilitate transitions in Communication Systems that yield superior performance as shown through extensive evaluations in this thesis

Collaborative Uploading in Heterogeneous Networks: Optimal and Adaptive Strategies

Collaborative uploading describes a type of crowdsourcing scenario in networked environments where a device utilizes multiple paths over neighboring devices to upload content to a centralized processing entity such as a cloud service. Intermediate devices may aggregate and preprocess this data stream. Such scenarios arise in the composition and aggregation of information, e.g., from smartphones or sensors. We use a queuing theoretic description of the collaborative uploading scenario, capturing the ability to split data into chunks that are then transmitted over multiple paths, and finally merged at the destination. We analyze replication and allocation strategies that control the mapping of data to paths and provide closed-form expressions that pinpoint the optimal strategy given a description of the paths' service distributions. Finally, we provide an online path-aware adaptation of the allocation strategy that uses statistical inference to sequentially minimize the expected waiting time for the uploaded data. Numerical results show the effectiveness of the adaptive approach compared to the proportional allocation and a variant of the join-the-shortest-queue allocation, especially for bursty path conditions.Comment: 15 pages, 11 figures, extended version of a conference paper accepted for publication in the Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), 201

Generalized Cost-Based Job Scheduling in Very Large Heterogeneous Cluster Systems

We study job assignment in large, heterogeneous resource-sharing clusters of servers with finite buffers. This load balancing problem arises naturally in today's communication and big data systems, such as Amazon Web Services, Network Service Function Chains, and Stream Processing. Arriving jobs are dispatched to a server, following a load balancing policy that optimizes a performance criterion such as job completion time. Our contribution is a randomized Cost-Based Scheduling (CBS) policy in which the job assignment is driven by general cost functions of the server queue lengths. Beyond existing schemes, such as the Join the Shortest Queue (JSQ), the power of d or the SQ(d) and the capacity-weighted JSQ, the notion of CBS yields new application-specific policies such as hybrid locally uniform JSQ. As today's data center clusters have thousands of servers, exact analysis of CBS policies is tedious. In this article, we derive a scaling limit when the number of servers grows large, facilitating a comparison of various CBS policies with respect to their transient as well as steady state behavior. A byproduct of our derivations is the relationship between the queue filling proportions and the server buffer sizes, which cannot be obtained from infinite buffer models. Finally, we provide extensive numerical evaluations and discuss several applications including multi-stage systems

On the throughput optimization in large-scale batch-processing systems

We analyse a data-processing system with clients producing jobs which are processed in batches by parallel servers; the system throughput critically depends on the batch size and a corresponding sub-additive speedup function. In practice, throughput optimization relies on numerical searches for the optimal batch size, a process that can take up to multiple days in existing commercial systems. In this paper, we model the system in terms of a closed queueing network; a standard Markovian analysis yields the optimal throughput in time. Our main contribution is a mean-field model of the system for the regime where the system size is large. We show that the mean-field model has a unique, globally attractive stationary point which can be found in closed form and which characterizes the asymptotic throughput of the system as a function of the batch size. Using this expression we find the asymptotically optimal throughput in time. Numerical settings from a large commercial system reveal that this asymptotic optimum is accurate in practical finite regimes

pH-Triggered conversion of soft nanocomposites: in situ synthesized AuNP-hydrogel to AuNP-organogel

Amino acid based amphiphilic gelators (carboxylate salts) were employed for the in situ synthesis of gold nanoparticles (GNPs) in hydrogel networks at room temperature without using any external reducing or capping agents for the development of AuNP-hydrogel soft composite. Synthesized AuNP-hydrogel composites were then successfully converted to AuNP-organogel composites simply by lowering the pH of the aqueous medium, as the hydrogelating amphiphilic carboxylates were transformed to corresponding carboxylic acids that are efficient organogelators. These water insoluble carboxylic acids spontaneously moved from the aqueous phase to the nonpolar organic media (toluene) along with the synthesized GNPs to form the AuNP-organogel composite. The phase transfer of the GNPs from a hydrogel network to an organogel network was investigated by UV-Vis spectroscopy, field emission scanning electron microscopy (FESEM), transmission electron microscopy (TEM) and X-ray diffraction (XRD) studies. Supramolecular networks of both the gels played a crucial role in stabilization of the GNPs. Fluorescence spectroscopy was used to investigate the mechanistic detail of the in situ GNP synthesis. The characterizations indicated the formation of spherical and uniform sized GNPs and even phase transfer of the nanoparticles did not result in change of shape or size of the nanoparticles. Rational designing of the gelator/nongelator molecules helped us to recognize the key structural components required for the efficient synthesis and stabilization of the GNPs in both the phases. Rheological study suggested that the hydrogel-GNP composites possess improved viscoelastic property than the native hydrogel

Towards Optimal Placement of Monitoring Units in Time-varying Networks under Centralized Control

The increasing penetration of software-dened communication networks with centralized control has made network management a highly demanding task. Common monitoring approaches in the context of such convoluted high-speed networks have become a serious challenge in terms of complexity and resource management. Management functions rely on monitoring information such as the ow size distribution (FSD), to perform crucial activities such as load balancing and resource provisioning. In this paper, we propose a solution as to how one can utilize limited monitoring resources to estimate the FSD for distinct ows characterized by origin-destination pairs. We provide a method to dynamically adapt placement of monitoring units with some extracted knowledge about the change in FSD's with time