OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

OpenBU

Browsing CAS: Computer Science: Technical Reports by Title

Sort by: Order: Results:

  • Hallet, J. J.; Kfoury, A. J. (Boston University Computer Science Department, 2005-08-08)
    A weak reference is a reference to an object that is not followed by the pointer tracer when garbage collection is called. That is, a weak reference cannot prevent the object it references from being garbage collected. ...
  • Ishakian, Vatche; Lapets, Andrei; Bestavros, Azer; Kfoury, Assaf (CS Department, Boston University, 2010-08-24)
    Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. ...
  • Mattar, Karim; Epstein, Samuel; Matta, Ibrahim (Boston University Computer Science Department, 2009-01-30)
    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 ...
  • Martin, David M. (Boston University Computer Science Department, 1998-02-21)
    We describe and evaluate options for providing anonymous IP service, argue for the further investigation of local anonymity, and sketch a framework for the implementation of locally anonymous networks.
  • Zhang, Yuting; Bestavros, Azer; Guirguis, Mina; Matta, Ibrahim; West, Richard (Boston University Computer Science Department, 2004-07-19)
    With the increased use of "Virtual Machines" (VMs) as vehicles that isolate applications running on the same host, it is necessary to devise techniques that enable multiple VMs to share underlying resources both fairly and ...
  • Ratnam, Karunaharan; Matta, Ibrahim; Rangarajan, Sampath (Boston University Computer Science Department, 1999-08-24)
    In [previous papers] we presented the design, specification and proof of correctness of a fully distributed location management scheme for PCS networks and argued that fully replicating location information is both appropriate ...
  • Jahama, Said; Kfoury, A. J. (Boston University Computer Science Department, 1993-12-20)
    Various restrictions on the terms allowed for substitution give rise to different cases of semi-unification. Semi-unification on finite and regular terms has already been considered in the literature. We introduce a general ...
  • Papapetrou, Panagiotis; Benson, Gary; Kollios, George (Boston University Computer Science Department, 2008-10-21)
    The problem of discovering frequent poly-regions (i.e. regions of high occurrence of a set of items or patterns of a given alphabet) in a sequence is studied, and three efficient approaches are proposed to solve it. The ...
  • Considine, Jeffrey (Boston University Computer Science Department, 2001-10-30)
    Fast forward error correction codes are becoming an important component in bulk content delivery. They fit in naturally with multicast scenarios as a way to deal with losses and are now seeing use in peer to peer networks ...
  • Wang, Chong; Byers, John W. (Boston University Computer Science Department, 2007)
    Understanding and modeling the factors that underlie the growth and evolution of network topologies are basic questions that impact capacity planning, forecasting, and protocol research. Early topology generation work ...
  • Barford, Paul; Crovella, Mark (Boston University Computer Science Department, 1997-12-31)
    One role for workload generation is as a means for understanding how servers and networks respond to variation in load. This enables management and capacity planning based on current and projected usage. This paper applies ...
  • Riga, Niky; Matta, Ibrahim; Bestavros, Azer (Boston University Computer Science Department, 2007)
    Traditionally, slotted communication protocols have employed guard times to delineate and align slots. These guard times may expand the slot duration significantly, especially when clocks are allowed to drift for longer ...
  • Byers, John W.; Cosidine, Jeffrey; Mitzenmacher, Michael (Boston University Computer Science Department, 2003-02-06)
    A well-known paradigm for load balancing in distributed systems is the``power of two choices,''whereby an item is stored at the less loaded of two (or more) random alternative servers. We investigate the power of two choices ...
  • Jin, Shudong; Bestavros, Azer (Boston University Computer Science Department, 2001-30)
    This paper presents a tool called Gismo (Generator of Internet Streaming Media Objects and workloads). Gismo enables the specification of a number of streaming media access characteristics, including object popularity, ...
  • Crovella, Mark; Kolaczyk, Eric (Boston University Computer Science Department, 2002-07-15)
    A number of problems in network operations and engineering call for new methods of traffic analysis. While most existing traffic analysis methods are fundamentally temporal, there is a clear need for the analysis of traffic ...
  • Jin, Shudong; Bestavros, Azer (Boston University Computer Science Department, 2000-04-04)
  • Chang, Ching; Li, Feifei; Bestavros, Azer; Kollios (Boston University Computer Science Department, 2004-07-01)
    We investigate adaptive buffer management techniques for approximate evaluation of sliding window joins over multiple data streams. In many applications, data stream processing systems have limited memory or have to deal ...
  • Chiaraviglio, Luca; Matta, Ibrahim (CS Department, Boston University, 2010-03-31)
    We propose a distributed approach in which an Internet Service Provider (ISP) and a Content Provider (CP) cooperate to minimize total power consumption. Our solution is distributed between the ISP and the CP to limit shared ...
  • Chiaraviglio, Luca; Matta, Ibrahim (Boston University Computer Science Department, 2009-11-24)
    Energy-efficient communication has recently become a key challenge for both researchers and industries. In this paper, we propose a new model in which a Content Provider and an Internet Service Provider cooperate to reduce ...
  • Hamandi, Hani; Itkis, Gene (Boston University Computer Science Department, 2004-04-27)
    Group communication is as an important functionality, which needs to be supported by various communication technologies. Applications of group communication include IP (or application-level) multicast, wireless and/or ...

Search OpenBU


Browse

Deposit Materials

Statistics