Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Hadjieleftheriou, Marios; Byers, John W.; Kollios, John (Boston University Computer Science Department, 2005-03-16)
    The data streaming model provides an attractive framework for one-pass summarization of massive data sets at a single observation point. However, in an environment where multiple data streams arrive at a set of distributed ...
  • Buzan, Dan (Boston University Computer Science Department, 2004-04-23)
    This technical report presents a combined solution for two problems, one: tracking objects in 3D space and estimating their trajectories and second: computing the similarity between previously estimated trajectories and ...
  • Kwon, Gu-In; Byers, John W. (Boston University Computer Science Department, 2003-07-01)
    We consider the problem of architecting a reliable content delivery system across an overlay network using TCP connections as the transport primitive. We first argue that natural designs based on store-and-forward principles ...
  • Lapets, Andrei; Kfoury, Assaf; Bestavros, Azer (CS Department, Boston University, 2010-01-19)
    NetSketch is a tool for the specification of constrained-flow networks (CFNs) and the certification of desirable safety properties imposed thereon, conceived to assist system integrators in modeling and design. It provides ...
  • Bestavros, Azer; Kfoury, Assaf; Lapets, Andrei; Ocean, Michael (Boston University Computer Science Department, 2009-10-30)
    NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: ...
  • Bestavros, Azer; Kfoury, Assaf; Lapets, Andrei; Ocean, Michael (Boston University Computer Science Department, 2009-10-01)
    NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of ...
  • Bestavros, Azer; Bradley, Adam D.; Kfoury, Assaf J.; Matta, Ibrahim (Boston University Computer Science Department, 2004-05-14)
    The Science of Network Service Composition has clearly emerged as one of the grand themes driving many of our research questions in the networking field today [NeXtworking 2003]. This driving force stems from the rise of ...
  • Liu, Likai; Kfoury, Assaf J.; Bestavros, Azer; Gabay, Yarom; Bradley, Adam D.; Matta, Ibrahim (Boston University Computer Science Department, 2005-12-28)
    We present a type inference algorithm, in the style of compositional analysis, for the language TRAFFIC—a specification language for flow composition applications proposed in [2]—and prove that this algorithm is correct: ...
  • Liu, Likai; Kfoury, Assaf J.; Bestavros, Azer; Bradley, Adam D.; Gabay, Yarom; Matta, Ibrahim (Boston University Computer Science Department, 2005-05-01)
    This paper formally defines the operational semantic for TRAFFIC, a specification language for flow composition applications proposed in BUCS-TR-2005-014, and presents a type system based on desired safety assurance. We ...
  • Liu, Likai; Kfoury, Assaf (Boston University Computer Science Department, 2006-10-26)
    In the framework of iBench research project, our previous work created a domain specific language TRAFFIC [6] that facilitates specification, programming, and maintenance of distributed applications over a network. It ...
  • Bradley, Adam D.; Bestavros, Azer; Kfoury, Assaf J. (Boston University Computer Science Department, 2002-05-22)
    As new multi-party edge services are deployed on the Internet, application-layer protocols with complex communication models and event dependencies are increasingly being specified and adopted. To ensure that such protocols ...
  • Lakhina, Anukool; Byers, John W.; Crovella, Mark; Xie, Peng (Boston University Computer Science Department, 2002-07-15)
    Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute studies have led some authors to conclude that the router graph of ...
  • Shudong, Jin; Bestavros, Azer (Boston University Computer Science Department, 2001-10)
    To serve asynchronous requests using multicast, two categories of techniques, stream merging and periodic broadcasting have been proposed. For sequential streaming access where requests are uninterrupted from the beginning ...
  • Sharma, Manish; Byers, John (Boston University Computer Science Department, 2005-01-20)
    Emerging network monitoring infrastructures capture packet-level traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in such an infrastructure do not coordinate monitoring ...
  • Parmer, Gabriel; West, Richard; Fry, Gerald (Boston University Computer Science Department, 2006-07-14)
    Overlay networks have become popular in recent times for content distribution and end-system multicasting of media streams. In the latter case, the motivation is based on the lack of widespread deployment of IP multicast ...
  • Considine, Jeffrey; Florio, Thomas A. (Boston University Computer Science Department, 2002-08-27)
    We present a distributed indexing scheme for peer to peer networks. Past work on distributed indexing traded off fast search times with non-constant degree topologies or network-unfriendly behavior such as flooding. In ...
  • Guo, Liang; Matta, Ibrahim (Boston University Computer Science Department, 2002-03-21)
    Previous studies have shown that giving preferential treatment to short jobs helps reduce the average system response time, especially when the job size distribution possesses the heavy-tailed property. Since it has been ...
  • Sclaroff, Stan; Pentland, Alex (Boston University Computer Science Department, 1994-10)
    We describe our work on shape-based image database search using the technique of modal matching. Modal matching employs a deformable shape decomposition that allows users to select example objects and have the computer ...
  • Guo, Liang; Matta, Ibrahim (Boston University Computer Science Department, 1999-10-08)
    To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of-Service (QoS) constraints. However, the ...
  • Byers, John; Cheng, Mei Chin; Considine, Jeffrey; Itkis, Gene; Yeung, Alex (Boston University Computer Science Department, 2002-01-21)
    Content providers often consider the costs of security to be greater than the losses they might incur without it; many view "casual piracy" as their main concern. Our goal is to provide a low cost defense against such ...

Search OpenBU


Advanced Search

Browse

Deposit Materials