This paper describes a pseudo-polynomial time algorithm for timing analysis of a class of choice-free asynchronous systems, called tightly-coupled systems, with both min and max type timing constraints and bounded component delays. The algorithm consists of two phases: (i) longterm behavior analysis, that computes bounds on the time separation of events after the system has run for a sufficient...

Many works have reported simulated performance benefits of stream reuse techniques such as batching, chaining, and patching to the scalability of VoD systems. However, the relative contribution of such techniques has been rarely evaluated in practical implementations of scalable VoD servers. In this work, we investigated the efficiency of representative stream reuse techniques on the GloVE syst...

The traditional TCP congestion control scheme often yields limited performance due to its conservative Slow Start algorithm, which can require many round-trip times to reach an appropriate sending rate that well utilizes the available capacity. A number of techniques in the literature address this issue, but we offer a different approach that is simple yet blunt: allow TCPs to begin transmissio...

This dissertation analyzes where and when experienced investors add value to startups. Building on the resource-dependence theory and the relational view of the firm, I argue that the positive effect of investor experience on startup performance is stronger when the startup faces a more uncertain environment. The first essay predicts a greater effect of investor experience early in the life cyc...

The creation of spinoff companies is often promoted as a desirable mechanism for transferring knowledge and technologies from research organizations to the private sector for commercialization. In the promotion process, policymakers typically treat these “university” spinoffs like industry startups. However, when university spinoffs involve an employment transition by a researcher out of the no...

—Project JXTA is the first peer-to-peer application development infrastructure that includes standard protocols and multi-language implementations. Performance and scalability of JXTA are not well understood, despite its widespread usage in research and increasing popularity in the industry. This paper reports on a performance evaluation of the JXTA protocol implementations in Java. The peer st...

A set of k mobile agents with distinct identifiers and located in nodes of an unknown anonymous connected network, have to meet at some node. We show that this gathering problem is no harder than its special case for k = 2, called the rendezvous problem, and design deterministic protocols solving the rendezvous problem with arbitrary startups in rings and in general networks. The measure of per...