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

OpenBU

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

Sort by: Order: Results:

  • Sweha, Raymond; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2009-02-10)
    This paper proposes the use of in-network caches (which we call Angels) to reduce the Minimum Distribution Time (MDT) of a file from a seeder – a node that possesses the file – to a set of leechers – nodes who are interested ...
  • Medina, Alberto; Matta, Ibrahim; Byers, John (Boston University Computer Science Department, 2000-01-21)
    BRITE is a parametrized topology generation tool, which can be used to flexibly control various parameters (such as connectivity and growth models) and study various properties of generated topologies (such power laws, ...
  • Medina, Alberto; Lakhina, Anukool; Matta, Ibrahim; Byers, John (Boston University Computer Science Department, 2001-04-12)
    Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in ...
  • Govindan, Ramesh; Jamin, Sugih; Zekauskas, Matt; Willinger, Walter; Towsley, Don; Pitkow, Jim; Ammar, Mostafa; Padmanabhan, Venkata; Bharghavan, Vaduvur; Schulzrinne, Henning; Rajagopalan, Bala; Zinky, John (Boston University Computer Science Department, 1999-12-15)
  • Rost, Stanislav; Byers, John; Bestavros, Azer (Boston University Computer Science Department, 2000-12-15)
    We propose a new technique for efficiently delivering popular content from information repositories with bounded file caches. Our strategy relies on the use of fast erasure codes (a.k.a. forward error correcting codes) to ...
  • Byers, John; Considine, Jeffrey; Mitzenmacher, Michael (Boston University Computer Science Department, 2002)
    We present new, simple, efficient data structures for approximate reconciliation of set differences, a useful standalone primitive for peer-to-peer networks and a natural subroutine in methods for exact reconciliation. In ...
  • Byers, John; Luby, Michael; Mitzenmacher, Michael (Boston University Computer Science Department, 2000-12-15)
    Traditional approaches to receiver-driven layered multicast have advocated the benefits of cumulative layering, which can enable coarse-grained congestion control that complies with TCP-friendliness equations over large ...
  • Smaragdakis, Georgios; Laoutaris, Nikolaos; Bestavros, Azer; Byers, John; 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 the existing mesh and re-wiring to cope with ...
  • Bestavros, Azer; Byers, John; Harfoush, Khaled (Boston University Computer Science Department, 2001-05)
    The development and deployment of distributed network-aware applications and services over the Internet require the ability to compile and maintain a model of the underlying network resources with respect to (one or more) ...
  • Byers, John; Considine, Jeffrey; Mitzenmacher, Michael; Rost, Stanislav (Boston University Computer Science Department, 2002)
    Overlay networks have emerged as a powerful and highly flexible method for delivering content. We study how to optimize throughput of large, multipoint transfers across richly connected overlay networks, focusing on the ...
  • Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2001-07-31)
    Accurate measurement of network bandwidth is crucial for flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilization of network resources. These applications must do so ...
  • Fayed, Marwan; Krapivsky, Paul; Byers, John; Finkel, David; Redner, Sid; Crovella, Mark (Boston University Computer Science Department, 2003-03-01)
    Recent studies have noted that vertex degree in the autonomous system (AS) graph exhibits a highly variable distribution [15, 22]. The most prominent explanatory model for this phenomenon is the Barabási-Albert (B-A) model ...
  • Bedford, Paul; Bestavros, Azer; Byers, John; Crovella, Mark (Boston University Computer Science Department, 2000-07-03)
    The cost and complexity of deploying measurement infrastructure in the Internet for the purpose of analyzing its structure and behavior is considerable. Basic questions about the utility of increasing the number of ...
  • Medina, Alberto; Matta, Ibrahim; Byers, John (Boston University Computer Science Department, 2000-01-21)
    Recent empirical studies have shown that Internet topologies exhibit power laws of the form for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; ...
  • Fayed, Marwan; Krapivsky, Paul; Byers, John; Crovella, Mark; Finkel, David; Redner, Sid (Boston University Computer Science Department, 2003-01-17)
    This paper explores reasons for the high degree of variability in the sizes of ASes that have recently been observed, and the processes by which this variable distribution develops. AS size distribution is important for a ...
  • Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2002)
    Growing interest in inference and prediction of network characteristics is justified by its importance for a variety of network-aware applications. One widely adopted strategy to characterize network conditions relies on ...
  • Doyle, Ronald; Chase, Jeffrey; Gadde, Syam; Vahdat, Amin; Rabinovich, Michael; Sibal, Sandeep; Spatscheck, Oliver; Sturm, Walter; Nottingham, Mark; Kangasharju, Jussi; Roberts, James; Ross, Keith; Radoslavov, Pavlin; Govindan, Ramesh; Estrin, Deborah; Fei, Zongming; Ma, Wei-Ying; Shen, Bo; Brassil, Jack; Beck, Andre; Hofmann, Markus; Ardaiz, O.; Freitag, F.; Navarro, L.; Hughes, Amy; Touch, Joseph; Panteleenko, Vsevolod; Freeh, Vincent; Rost, Stanislav; Byers, John; Bestavros, Azer; Acharya, Arup; Shaikh, Anees; Tewari, Renu; Verma, Dinesh; Coffman, E.G. Jr; Jelenkovic, Predrag; Momcilovic, Petar; Venkataramani, Arun; Yalagandula, Praveen; Kokku, Ravi; Sarif, Sadia; Dahlin, Mike; Davison, Brian; Kelly, Terence; Lee, Johnson; Miniscalco, William; Li, Meng; Shambroom, W. David; Buford, John; Almeida, V.; Menasce, D.; Riedi, R.; Peligrinelli, F.; Fonseca, R.; Meira, W. Jr; Liston, Richard; Zegura, Ellen; Koletsou, Mimika; Voelker, Geoffrey; Krashakov, Serge; Shchur, Lev; Lee, Sung-Ju; Verscheure, Olivier; Venkatramani, Chitra; Frossard, Pascal; Amini, Lisa (Boston University Computer Science Department, 2001-08-02)
    OVERVIEW The International Web Content Caching and Distribution Workshop (WCW) is a premiere technical meeting for researchers and practitioners interested in all aspects of content caching, distribution and ...
  • Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2000-05-30)
    Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When two or more such connections share a common endpoint, there is an ...
  • Harfoush, Khaled; Bestavros, Azer; Byers, John (Boston University Computer Science Department, 2000-01-08)
    ERRATA: We present corrections to Fact 3 and (as a consequence) to Lemma 1 of BUCS Technical Report BUCS-TR-2000-013 (also published in IEEE INCP'2000)[1]. These corrections result in slight changes to the formulae used ...
  • 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 ...

Search OpenBU


Advanced Search

Browse

Deposit Materials