Foundational Theory for Understanding Policy Routing Dynamics

In this paper we introduce a theory of policy routing dynamics based on fundamental axioms of routing update mechanisms. We develop a dynamic policy routing model (DPR) that extends the static formalism of the stable paths problem (introduced by Griffin et al.) with discrete synchronous time. DPR captures the propagation of path changes in any dynamic network irrespective of its time-varying topology. We introduce several novel structures such as causation chains, dispute fences and policy digraphs that model different aspects of routing dynamics and provide insight into how these dynamics manifest in a network. We exercise the practicality of the theoretical foundation provided by DPR with two fundamental problems: routing dynamics minimization and policy conflict detection. The dynamics minimization problem utilizes policy digraphs, that capture the dependencies in routing policies irrespective of underlying topology dynamics, to solve a graph optimization problem. This optimization problem explicitly minimizes the number of routing update messages in a dynamic network by optimally changing the path preferences of a minimal subset of nodes. The conflict detection problem, on the other hand, utilizes a theoretical result of DPR where the root cause of a causation cycle (i.e., cycle of routing update messages) can be precisely inferred as either a transient route flap or a dispute wheel (i.e., policy conflict). Using this result we develop SafetyPulse, a token-based distributed algorithm to detect policy conflicts in a dynamic network. SafetyPulse is privacy preserving, computationally efficient, and provably correct.National Science Foundation (CISE/CCF 0820138, CISE/CSR 0720604, CISE/CNS 0524477, CNS/ITR 0205294, CISE/EIA RI #0202067

Discourse network analysis: policy debates as dynamic networks

Political discourse is the verbal interaction between political actors. Political actors make normative claims about policies conditional on each other. This renders discourse a dynamic network phenomenon. Accordingly, the structure and dynamics of policy debates can be analyzed with a combination of content analysis and dynamic network analysis. After annotating statements of actors in text sources, networks can be created from these structured data, such as congruence or conflict networks at the actor or concept level, affiliation networks of actors and concept stances, and longitudinal versions of these networks. The resulting network data reveal important properties of a debate, such as the structure of advocacy coalitions or discourse coalitions, polarization and consensus formation, and underlying endogenous processes like popularity, reciprocity, or social balance. The added value of discourse network analysis over survey-based policy network research is that policy processes can be analyzed from a longitudinal perspective. Inferential techniques for understanding the micro-level processes governing political discourse are being developed

Regulatory practice in the European telecommunications sector: Normative justification and practical application

The telecommunications sector is characterized by economies of scale and scope, high sunk costs, and strong network effects. This combination may facilitate monopolization and abuse of market power. The present study evaluates the need for sector-specific regulation in this sector. It is shown that there is a conflict between static and dynamic efficiency goals. A comparison of two prominent regulatory approaches for the telecommunications sector shows that the disaggregated approach takes account of this conflict most adequately, as it is committed to minimal regulation. The European regulatory framework for electronic communications markets is based on economic theory, and could principally be used to limit regulation to network areas in which stable networkspecific market power is localized. However, especially the criteria for the assessment of significant market power (SMP) are applied too liberally, such that, in practice, overregulation has resulted. --

Bertrand competition in markets with network effects and switching costs

We analyze Bertrand duopoly competition in markets with network effects and consumer switching costs. Depending on the ratio of switching costs to network effects, our modelerates four different market patterns: monopolization and market sharing which can be either monotone or alternating. A critical mass effect, where one firm becomes the monopolist for sure only occurs for intermediate values of the ratio, whereas for large switching costs market sharing is the unique equilibrium. For large network effcts both monopoly and market sharing equilibria exist. Our welfare analysis reveals a fundamental conflict between maximization of consumer surplus and social welfare when network effects are large. We also analyze firms' incentives for compatibility and we examine how market outcomes are affected by the switching costs, market expansion, and cost asymmetries. Finally, in a dynamic extension of our model, we show how competition depends on agents' discount factors. --Network Effects,Switching Costs,Bertrand Competition

Vehicle-Pedestrian Dynamic Interaction through Tractography of Relative Movements and Articulated Pedestrian Pose Estimation

To design robust Pre-Collision Systems (PCS) we must develop new techniques that will allow a better understanding of the vehicle-pedestrian dynamic relationship, and which can predict pedestrian future movements. This paper focuses on the potential-conflict situations where a collision may happen if no avoidance action is taken from driver or pedestrian. We have used 1000 15-second videos to find vehicle-pedestrian relative dynamic trajectories and pose of pedestrians. Adaptive structural local appearance model and particle filter methods have been implemented to track the pedestrians. We have obtained accurate tractography results for over 82% of the videos. For pose estimation, we have used flexible mixture model for capturing cooccurrence between pedestrian body segments. Based on existing single-frame human pose estimation model, we have implemented Kalman filtering with other new techniques to make stable stickfigure videos of the pedestrian dynamic motion. These tractography and pose estimation data were used as features to train a neural network for classifying 'potential conflict' and 'no potential conflict' situations. The training of the network achieved 91.2% true label accuracy, and 8.8% false level accuracy. Finally, the trained network was used to assess the probability of collision over time for the 15 seconds videos which generates a spike when there is a 'potential conflict' situation. The paper enables new analysis on potential-conflict pedestrian cases with 2D tractography data and stick-figure pose representation of pedestrians, which provides significant insight on the vehicle-pedestrian dynamics that are critical for safe autonomous driving and transportation safety innovations

Design and Implementation of a Distributed Middleware for Parallel Execution of Legacy Enterprise Applications

A typical enterprise uses a local area network of computers to perform its business. During the off-working hours, the computational capacities of these networked computers are underused or unused. In order to utilize this computational capacity an application has to be recoded to exploit concurrency inherent in a computation which is clearly not possible for legacy applications without any source code. This thesis presents the design an implementation of a distributed middleware which can automatically execute a legacy application on multiple networked computers by parallelizing it. This middleware runs multiple copies of the binary executable code in parallel on different hosts in the network. It wraps up the binary executable code of the legacy application in order to capture the kernel level data access system calls and perform them distributively over multiple computers in a safe and conflict free manner. The middleware also incorporates a dynamic scheduling technique to execute the target application in minimum time by scavenging the available CPU cycles of the hosts in the network. This dynamic scheduling also supports the CPU availability of the hosts to change over time and properly reschedule the replicas performing the computation to minimize the execution time. A prototype implementation of this middleware has been developed as a proof of concept of the design. This implementation has been evaluated with a few typical case studies and the test results confirm that the middleware works as expected