Guide to the Linfield Chamber Orchestra (LCO) Collection

This collection, a repository for the documents, media, and minutia of the Linfield Chamber Orchestra, shows the efforts of the organization to provide a teaching orchestra to the Yamhill County area. The majority of the collection is paper-based, with ephemerae such as posters and news clippings

Deliverable JRA1.1: Evaluation of current network control and management planes for multi-domain network infrastructure

This deliverable includes a compilation and evaluation of available control and management architectures and protocols applicable to a multilayer infrastructure in a multi-domain Virtual Network environment.The scope of this deliverable is mainly focused on the virtualisation of the resources within a network and at processing nodes. The virtualization of the FEDERICA infrastructure allows the provisioning of its available resources to users by means of FEDERICA slices. A slice is seen by the user as a real physical network under his/her domain, however it maps to a logical partition (a virtual instance) of the physical FEDERICA resources. A slice is built to exhibit to the highest degree all the principles applicable to a physical network (isolation, reproducibility, manageability, ...). Currently, there are no standard definitions available for network virtualization or its associated architectures. Therefore, this deliverable proposes the Virtual Network layer architecture and evaluates a set of Management- and Control Planes that can be used for the partitioning and virtualization of the FEDERICA network resources. This evaluation has been performed taking into account an initial set of FEDERICA requirements; a possible extension of the selected tools will be evaluated in future deliverables. The studies described in this deliverable define the virtual architecture of the FEDERICA infrastructure. During this activity, the need has been recognised to establish a new set of basic definitions (taxonomy) for the building blocks that compose the so-called slice, i.e. the virtual network instantiation (which is virtual with regard to the abstracted view made of the building blocks of the FEDERICA infrastructure) and its architectural plane representation. These definitions will be established as a common nomenclature for the FEDERICA project. Other important aspects when defining a new architecture are the user requirements. It is crucial that the resulting architecture fits the demands that users may have. Since this deliverable has been produced at the same time as the contact process with users, made by the project activities related to the Use Case definitions, JRA1 has proposed a set of basic Use Cases to be considered as starting point for its internal studies. When researchers want to experiment with their developments, they need not only network resources on their slices, but also a slice of the processing resources. These processing slice resources are understood as virtual machine instances that users can use to make them behave as software routers or end nodes, on which to download the software protocols or applications they have produced and want to assess in a realistic environment. Hence, this deliverable also studies the APIs of several virtual machine management software products in order to identify which best suits FEDERICA’s needs.Postprint (published version

Static Data Structure for Discrete Advance Bandwidth Reservations on the Internet

In this paper we present a discrete data structure for reservations of limited resources. A reservation is defined as a tuple consisting of the time interval of when the resource should be reserved, $I_R$, and the amount of the resource that is reserved, $B_R$, formally $R=\{I_R,B_R\}$. The data structure is similar to a segment tree. The maximum spanning interval of the data structure is fixed and defined in advance. The granularity and thereby the size of the intervals of the leaves is also defined in advance. The data structure is built only once. Neither nodes nor leaves are ever inserted, deleted or moved. Hence, the running time of the operations does not depend on the number of reservations previously made. The running time does not depend on the size of the interval of the reservation either. Let $n$ be the number of leaves in the data structure. In the worst case, the number of touched (i.e. traversed) nodes is in any operation $O(\log n)$, hence the running time of any operation is also $O(\log n)$

Incentivizing Resilience in Financial Networks

When banks extend loans to each other, they generate a negative externality in the form of systemic risk. They create a network of interbank exposures by which they expose other banks to potential insolvency cascades. In this paper, we show how a regulator can use information about the financial network to devise a transaction-specific tax based on a network centrality measure that captures systemic importance. Since different transactions have different impact on creating systemic risk, they are taxed differently. We call this tax a Systemic Risk Tax (SRT). We use an equilibrium concept inspired by the matching markets literature to show analytically that this SRT induces a unique equilibrium matching of lenders and borrowers that is systemic-risk efficient, i.e. it minimizes systemic risk given a certain transaction volume. On the other hand, we show that without this SRT multiple equilibrium matchings exist, which are generally inefficient. This allows the regulator to effectively stimulate a `rewiring' of the equilibrium interbank network so as to make it more resilient to insolvency cascades, without sacrificing transaction volume. Moreover, we show that a standard financial transaction tax (e.g. a Tobin-like tax) has no impact on reshaping the equilibrium financial network because it taxes all transactions indiscriminately. A Tobin-like tax is indeed shown to have a limited effect on reducing systemic risk while it decreases transaction volume.Comment: 38 pages, 9 figure

INFORMATION AS A DOUBLE-EDGED SWORD: THE ECONOMIC AND WELFARE CONSEQUENCES OF CERTIFIED LABELING FOR CREDENCE ATTRIBUTES

Certified labeling for credence attributes is examined using the concepts of pooled and separating equilibria. Credence attributes are product features that cannot be experienced directly by consumer, features such as pesticide-free, dolphin-safe, hormone-free, and organic. Without labeling, the traded good is a mix of credence and conventional goods. With certified labeling, the pooled market is replaced with separate markets for the credence and conventional good. Market outcomes are examined theoretically and with empirical simulations. Costless labeling is net welfare improving, but impacts are highly asymmetric. Credence producers gain largely at the expense of conventional producers. Costly labeling may reduce welfare even with rather modest labeling costs.Marketing,

Theory and evidence on pricing by asymmetric oligopolies

We present an analysis of markets with many asymmetrically positioned retailers that compete for the business of both informed and uninformed customers for a homogenous good, such as software, music, book or a brand-name appliance. We show that two forms of asymmetry, one related to loyal segment sizes of retailers and one related to the positioning of firms, completely explain the observed price dispersion in such markets and the multitude of asymmetrical strategies adopted by retailers. The stochastic dominance of empirical mixed strategy measures is used to test the theory with data on 968 books from 10 online retailers