Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Gacs, Peter (Boston University Computer Science Department, 1995-11-18)
    Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these ...
  • Morcos, Hany; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2008-02-10)
    Commonly, research work in routing for delay tolerant networks (DTN) assumes that node encounters are predestined, in the sense that they are the result of unknown, exogenous processes that control the mobility of these ...
  • Lakhina, Anukool; Crovella, Mark; Diot, Christophe (Boston University Computer Science Department, 2004-02-24)
    Anomalies are unusual and significant changes in a network's traffic levels, which can often involve multiple links. Diagnosing anomalies is critical for both network operators and end users. It is a difficult problem ...
  • Guo, Liang; Matta, Ibrahim (Boston University Computer Science Department, 2002)
    Internet measurements show that the size distribution of Web-based transactions is usually very skewed; a few large requests constitute most of the total traffic. Motivated by the advantages of scheduling algorithms which ...
  • Matta, Ibrahim; Guo, Liang (Boston University Computer Science Department, 2000-05-17)
    The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spurred further investigations into its congestion ...
  • Riga, Niky; Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 2004-05-31)
    Wireless sensor networks have recently emerged as enablers of important applications such as environmental, chemical and nuclear sensing systems. Such applications have sophisticated spatial-temporal semantics that set ...
  • Kfoury, A. J.; Wells, J. B. (Boston University Department of Computer Science, 1993-12-01)
    We study the problem of type inference for a family of polymorphic type disciplines containing the power of Core-ML. This family comprises all levels of the stratification of the second-order lambda-calculus by "rank" of ...
  • Alon, Jonathan; Sclaroff, Stan; Kollios, George; Pavlovic, Vladimir (Boston University Computer Science Department, 2003-03-26)
    A new approach is proposed for clustering time-series data. The approach can be used to discover groupings of similar object motions that were observed in a video collection. A finite mixture of hidden Markov models (HMMs) ...
  • Papapetrou, Panagiotis; Benson, Gary; Kollios, George (Boston University Computer Science Department, 2006-10-15)
    The problem of discovering frequent arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence is studied, and two efficient approaches are proposed to solve it. The first approach ...
  • Bestavros, Azer (Boston University Computer Science Department, 1997-09-10)
    In this paper, we introduce the notion of a "document cluster" in WWW space as a generalization of the notion of a "cache line" in linear memory address space. Through the analysis of Web server logs, we show evidence of ...
  • Bestavros, Azer; Crovella, Mark; Liu, Jun; Martin, David (Boston University Computer Science Department, 1998-02-01)
    To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in distributed Web servers is the need to direct incoming connections to ...
  • Heddaya, Abdelsalam; Sinha, Himanshu (Boston University Computer Science Department, 1996-03-07)
    Programmers of parallel processes that communicate through shared globally distributed data structures (DDS) face a difficult choice. Either they must explicitly program DDS management, by partitioning or replicating it ...
  • Laoutaris, Nikolaos; Smaragdakis, Georgios; Oikonomou, Konstantinos (Boston University Computer Science Department, 2006-07-14)
    The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter ...
  • Laoutaris, Nikolaos; Smaragdakis, Georgios; Bestavros, Azer; Motta, Ibrahim; Stavrakakis, Ioannis (Boston University Computer Science Department, 2006-02-07)
    Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems ...
  • Erramilli, Vijay; Chaintreau, Augustin; Crovella, Mark; Diot, Christophe (Boston University Computer Science Department, 2007)
    Forwarding in DTNs is a challenging problem. We focus on the specific issue of forwarding in an environment where mobile devices are carried by people in a restricted physical space (e.g. a conference) and contact patterns ...
  • Bestavros, Azer; Mehrotra, Sumit (Boston University Computer Science Department, 2001)
    This paper proposes a novel protocol which uses the Internet Domain Name System (DNS) to partition Web clients into disjoint sets, each of which is associated with a single DNS server. We define an L-DNS cluster to be a ...
  • Sharma, Abhishek; Bestavros, Azer; Matta, Ibrahim (Boston University Computer Science Department, 2004-07-07)
    We leverage the buffering capabilities of end-systems to achieve scalable, asynchronous delivery of streams in a peer-to-peer environment. Unlike existing cache-and-relay schemes, we propose a distributed prefetching ...
  • Crovella, Mark E.; Carter, Robert L. (Boston University Computer Science Department, 1995-06-30)
    As distributed information services like the World Wide Web become increasingly popular on the Internet, problems of scale are clearly evident. A promising technique that addresses many of these problems is service (or ...
  • Carter, Robert L.; Crovella, Mark E. (Boston University Computer Science Department, 1996-03-18)
    Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server. Prior work has generally assumed that ...
  • West, Richard; Schwan, Karsten; Poellabauer, Christian (Boston University Computer Science Department, 2003-08-29)
    This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for ...

Search OpenBU


Advanced Search

Browse

Deposit Materials