Applicability of fair simulation

AbstractIn this paper we compare four notions of fair simulation: direct [9], delay [12], game [19], and exists [16]. Our comparison refers to three main aspects: The time complexity of constructing the fair simulation, the ability to use it for minimization, and the relationship between the fair simulations and universal branching-time logics. We developed a practical application that is based on this comparison. The application is a new implementation for the assume-guarantee modular framework presented By Grumberg at al. in [ACM Transactions on Programming Languages and Systems (TOPLAS), 16 (1994) 843]. The new implementation significantly improves the complexity of the framework

Low-temperature and high-temperature approximations for penetrable-sphere fluids. Comparison with Monte Carlo simulations and integral equation theories

The two-body interaction in dilute solutions of polymer chains in good solvents can be modeled by means of effective bounded potentials, the simplest of which being that of penetrable spheres (PSs). In this paper we construct two simple analytical theories for the structural properties of PS fluids: a low-temperature (LT) approximation, that can be seen as an extension to PSs of the well-known solution of the Percus-Yevick (PY) equation for hard spheres, and a high-temperature (HT) approximation based on the exact asymptotic behavior in the limit of infinite temperature. Monte Carlo simulations for a wide range of temperatures and densities are performed to assess the validity of both theories. It is found that, despite their simplicity, the HT and LT approximations exhibit a fair agreement with the simulation data within their respective domains of applicability, so that they complement each other. A comparison with numerical solutions of the PY and the hypernetted-chain approximations is also carried out, the latter showing a very good performance, except inside the core at low temperatures.Comment: 14 pages, 8 figures; v2: some figures redone; small change

Cross-layer design of multi-hop wireless networks

MULTI -hop wireless networks are usually defined as a collection of nodes equipped with radio transmitters, which not only have the capability to communicate each other in a multi-hop fashion, but also to route each others’ data packets. The distributed nature of such networks makes them suitable for a variety of applications where there are no assumed reliable central entities, or controllers, and may significantly improve the scalability issues of conventional single-hop wireless networks. This Ph.D. dissertation mainly investigates two aspects of the research issues related to the efficient multi-hop wireless networks design, namely: (a) network protocols and (b) network management, both in cross-layer design paradigms to ensure the notion of service quality, such as quality of service (QoS) in wireless mesh networks (WMNs) for backhaul applications and quality of information (QoI) in wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of this Ph.D. dissertation, different network settings are used as illustrative examples, however the proposed algorithms, methodologies, protocols, and models are not restricted in the considered networks, but rather have wide applicability. First, this dissertation proposes a cross-layer design framework integrating a distributed proportional-fair scheduler and a QoS routing algorithm, while using WMNs as an illustrative example. The proposed approach has significant performance gain compared with other network protocols. Second, this dissertation proposes a generic admission control methodology for any packet network, wired and wireless, by modeling the network as a black box, and using a generic mathematical 0. Abstract 3 function and Taylor expansion to capture the admission impact. Third, this dissertation further enhances the previous designs by proposing a negotiation process, to bridge the applications’ service quality demands and the resource management, while using WSNs as an illustrative example. This approach allows the negotiation among different service classes and WSN resource allocations to reach the optimal operational status. Finally, the guarantees of the service quality are extended to the environment of multiple, disconnected, mobile subnetworks, where the question of how to maintain communications using dynamically controlled, unmanned data ferries is investigated

Congestion Control using FEC for Conversational Multimedia Communication

In this paper, we propose a new rate control algorithm for conversational multimedia flows. In our approach, along with Real-time Transport Protocol (RTP) media packets, we propose sending redundant packets to probe for available bandwidth. These redundant packets are Forward Error Correction (FEC) encoded RTP packets. A straightforward interpretation is that if no losses occur, the sender can increase the sending rate to include the FEC bit rate, and in the case of losses due to congestion the redundant packets help in recovering the lost packets. We also show that by varying the FEC bit rate, the sender is able to conservatively or aggressively probe for available bandwidth. We evaluate our FEC-based Rate Adaptation (FBRA) algorithm in a network simulator and in the real-world and compare it to other congestion control algorithms

Design and analysis for TCP-friendly window-based congestion control

The current congestion control mechanisms for the Internet date back to the early 1980’s and were primarily designed to stop congestion collapse with the typical traffic of that era. In recent years the amount of traffic generated by real-time multimedia applications has substantially increased, and the existing congestion control often does not opt to those types of applications. By this reason, the Internet can be fall into a uncontrolled system such that the overall throughput oscillates too much by a single flow which in turn can lead a poor application performance. Apart from the network level concerns, those types of applications greatly care of end-to-end delay and smoother throughput in which the conventional congestion control schemes do not suit. In this research, we will investigate improving the state of congestion control for real-time and interactive multimedia applications. The focus of this work is to provide fairness among applications using different types of congestion control mechanisms to get a better link utilization, and to achieve smoother and predictable throughput with suitable end-to-end packet delay

Markets are Dead, Long Live Markets

Researchers have long proposed using economic approaches to resource allocation in computer systems. However, few of these proposals became operational, let alone commercial. Questions persist about the economic approach regarding its assumptions, value, applicability, and relevance to system design. The goal of this paper is to answer these questions. We find that market-based resource allocation is useful, and more importantly, that mechanism design and system design should be integrated to produce systems that are both economically and computationally efficient.Comment: Fix rotation of figure

Frame Based Precoding in Satellite Communications: A Multicast Approach

In the present work, a multibeam satellite that employs aggressive frequency reuse towards increasing the offered throughput is considered. Focusing on the forward link, the goal is to employ multi-antenna signal processing techniques, namely linear precoding, to manage the inter-beam interferences. In this context, fundamental practical limitations, namely the rigid framing structure of satellite communication standards and the on-board per-antenna power constraints, are herein considered. Therefore, the concept of optimal frame based precoding under per-antenna constraints, is discussed. This consists in precoding the transmit signals without changing the underlying framing structure of the communication standard. In the present work, the connection of the frame based precoding problem with the generic signal processing problem of conveying independent sets of common data to distinct groups of users is established. This model is known as physical layer multicasting to multiple co-channel groups. Building on recent results, the weighted fair per-antenna power constrained multigroup multicast precoders are employed for frame based precoding. The throughput performance of these solutions is compared to multicast aware heuristic precoding methods over a realistic multibeam satellite scenario. Consequently, the gains of the proposed approach are quantified via extensive numerical results.Comment: Accepted for presentation at the IEEE ASMS 201

Introducing a methodological approach to determine value shares in Digital Ecosystems

Motivated by the critical yet unsolved task of fair value distribution in digital ecosystems (DEs), this study presents a methodological approach that allows us to determine ecosystem components\u27 value share to the total co-created value. Our method takes a holistic perspective on DEs. It suggests that when viewing DEs as complex networks, the value share of a component to the total co-created value stems from the network size and the interaction between the network participants. We demonstrate the applicability of the proposed method in a simulation of a Smart Living service ecosystem. Our simulation shows that our method is suitable for unraveling hitherto hidden interconnectedness between value-co-creating ecosystem components. Components that offer a low structural contribution to the total value can still play a crucial role in the network and have the most significant value share to the whole network