Browsing College of Arts and Sciences by Author "Byers, John W."

OpenBU

Browsing College of Arts and Sciences by Author "Byers, John W."

Sort by: Order: Results:

  • Byers, John W.; Mitzenmacher, Michael; Zervas, Georgios (Boston University Computer Science Department, 2009-10-10)
    Attributing a dollar value to a keyword is an essential part of running any profitable search engine advertising campaign. When an advertiser has complete control over the interaction with and monetization of each user ...
  • Bash, Boulat A.; Byers, John W.; Considine, Jeffrey (Boston University Computer Science Department, 2004-07-19)
    Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use ...
  • Smaragdakis, Georgios; Lekakis, Vassilis; Laoutaris, Nikolaos; Bestavros, Azer; Byers, John W.; Roussopoulos, Mema (Boston University Computer Science Department, 2008-07-01)
    A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and rewiring to ...
  • Smaragdakis, Georgios; Laoutaris, Nikolaos; Bestavros, Azer; Byers, John W.; Roussopoulos, Mema (Boston University Computer Science Department, 2007)
    A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with ...
  • 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 ...
  • 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 ...
  • Laoutaris, Nikolaos; Smaragdakis, Georgios; Bestavros, Azer; Byers, John W. (Boston University Computer Science Department, 2006-07-14)
    In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select ...
  • Lakhina, Anukool; Byers, John W.; Crovella, Mark; Matta, Ibrahim (Boston University Computer Science Department, 2002)
    One relatively unexplored question about the Internet's physical structure concerns the geographical location of its components: routers, links and autonomous systems (ASes). We study this question using two large inventories ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Kwon, Gu-In; Byers, John W. (Boston University Computer Science Department, 2002)
    A significant impediment to deployment of multicast services is the daunting technical complexity of developing, testing and validating congestion control protocols fit for wide-area deployment. Protocols such as pgmcc and ...

Search OpenBU


Advanced Search

Browse

Deposit Materials