On the Flow-level Dynamics of a Packet-switched Network

The packet is the fundamental unit of transportation in modern communication networks such as the Internet. Physical layer scheduling decisions are made at the level of packets, and packet-level models with exogenous arrival processes have long been employed to study network performance, as well as design scheduling policies that more efficiently utilize network resources. On the other hand, a user of the network is more concerned with end-to-end bandwidth, which is allocated through congestion control policies such as TCP. Utility-based flow-level models have played an important role in understanding congestion control protocols. In summary, these two classes of models have provided separate insights for flow-level and packet-level dynamics of a network

Port-Hamiltonian systems: an introductory survey

The theory of port-Hamiltonian systems provides a framework for the geometric description of network models of physical systems. It turns out that port-based network models of physical systems immediately lend themselves to a Hamiltonian description. While the usual geometric approach to Hamiltonian systems is based on the canonical symplectic structure of the phase space or on a Poisson structure that is obtained by (symmetry) reduction of the phase space, in the case of a port-Hamiltonian system the geometric structure derives from the interconnection of its sub-systems. This motivates to consider Dirac structures instead of Poisson structures, since this notion enables one to define Hamiltonian systems with algebraic constraints. As a result, any power-conserving interconnection of port-Hamiltonian systems again defines a port-Hamiltonian system. The port-Hamiltonian description offers a systematic framework for analysis, control and simulation of complex physical systems, for lumped-parameter as well as for distributed-parameter models

VINEA: a policy-based virtual network embedding architecture

Network virtualization has enabled new business models by allowing infrastructure providers to lease or share their physical network. To concurrently run multiple customized virtual network services, such infrastructure providers need to run a virtual network embedding protocol. The virtual network embedding is the (NP-hard) problem of matching constrained virtual networks onto the physical network. We present the design and implementation of a policy-based architecture for the virtual network embedding problem. By policy, we mean a variant aspect of any of the (invariant) embedding mechanisms: resource discovery, virtual network mapping, and allocation on the physical infrastructure. Our architecture adapts to different scenarios by instantiating appropriate policies, and has bounds on embedding efficiency and on convergence embedding time, over a single provider, or across multiple federated providers. The performance of representative novel policy configurations are compared over a prototype implementation. We also present an object model as a foundation for a protocol specification, and we release a testbed to enable users to test their own embedding policies, and to run applications within their virtual networks. The testbed uses a Linux system architecture to reserve virtual node and link capacities.National Science Foundation (CNS-0963974

Exploring galaxy evolution with generative models

Context. Generative models open up the possibility to interrogate scientific data in a more data-driven way. Aims: We propose a method that uses generative models to explore hypotheses in astrophysics and other areas. We use a neural network to show how we can independently manipulate physical attributes by encoding objects in latent space. Methods: By learning a latent space representation of the data, we can use this network to forward model and explore hypotheses in a data-driven way. We train a neural network to generate artificial data to test hypotheses for the underlying physical processes. Results: We demonstrate this process using a well-studied process in astrophysics, the quenching of star formation in galaxies as they move from low-to high-density environments. This approach can help explore astrophysical and other phenomena in a way that is different from current methods based on simulations and observations.Comment: Published in A&A. For code and further details, see http://space.ml/proj/explor

Usage of link-level performance indicators for HSDPA network-level simulations in E-UMTS

The paper describes integration of HSDPA (high-speed downlink packet access) link-level simulation results into network-level simulations for enhanced UMTS. The link-level simulations model all physical layer features depicted in the 3GPP standards. These include: generation of transport blocks; turbo coding; rate matching; spreading; scrambling; modulation. At the receiver side, all complementary blocks are designed, with soft-decision demodulation, and a turbo decoder using the MAP (maximum a posteriori) algorithm with 8 iterations. An analytical formula is defined that fits the CQI (channel quality indicator) dependent BLER (block error rate) versus E/sub b//N/sub 0/ results in an AWGN channel. This formula models the physical layer in the network-level simulator. A further extension for frequency selective fading channels has been defined. The network-level simulator includes propagation models that provide SNR values. Based on these SNR values and the simplified physical layer model, an algorithm selects the CQI, and determines the actual BLER at time of reception. The rounding down and delaying of the CQI reporting, which corresponds to the W-CDMA standard, has a significant impact on throughput and transfer delay of the HS-DSCH. Some compensation can be found in a modified transmission. The integration of the link-level and network-level simulators gives accurate and realistic results that can be used in more studies that focus on network layer aspects of packet based services over HSDP