Browsing Computer Science by Author "Laoutaris, Nikolaos"

OpenBU

Browsing Computer Science by Author "Laoutaris, Nikolaos"

Sort by: Order: Results:

  • Laoutaris, Nikolaos; Zervas, Georgios; Bestavros, Azer; Kollios, George (Boston University Computer Science Department, 2006-07-14)
    In many networked applications, independent caching agents cooperate by servicing each other's miss streams, without revealing the operational details of the caching mechanisms they employ. Inference of such details could ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Laoutaris, Nikolaos; Smaragdakis, Georgios; Bestavros, Azer; Ioannis Stavrakakis (Boston University Computer Science Department, 2005-07-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 ...
  • Smaragdakis, Georgios; Laoutaris, Nikolaos; Michiardi, Pietro; Bestavros, Azer; Byers, John; Roussopoulos, Mema (Boston University Computer Science Department, 2007)
    In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective data files. BitTorrent-like swarming protocols ...
  • Londoño, Jorge; Bestavros, Azer; Laoutaris, Nikolaos (Boston University Computer Science Department, 2009-07-29)
    We propose Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared resource (e.g., a DSLAM link) so as to converge on what they ...

Search OpenBU


Advanced Search

Browse

Deposit Materials