Nikolaos Laoutaris

Learn More
The difficulty of scaling Online Social Networks (OSNs) has introduced new system design challenges that has often caused costly re-architecting for services like Twitter and Facebook. The complexity of interconnection of users in social networks has introduced new scalability challenges. Conventional vertical scaling by resorting to full replication can be(More)
Motivated by increased concern over energy consumption in modern data centers, we propose a new, distributed computing platform called Nano Data Centers (NaDa). NaDa uses ISP-controlled home <i>gateways</i> to provide computing and storage services and adopts a managed peer-to-peer model to form a distributed data center infrastructure. To evaluate the(More)
In a multi-level cache such as those used for web caching, a hit at level l leads to the caching of the requested object in all intermediate caches on the reverse path (levels l − 1, . . . , 1). This paper shows that a simple modification to this de facto behavior, in which only the l− 1 level cache gets to store a copy, can lead to significant performance(More)
Many emerging scientific and industrial applications require transferring multiple Tbytes of data on a daily basis. Examples include pushing scientific data from particle accelerators/colliders to laboratories around the world, synchronizing data-centers across continents, and replicating collections of high definition videos from events taking place at(More)
Large datacenter operators with sites at multiple locations dimension their key resources according to the peak demand of the geographic area that each site covers. The demand of specific areas follows strong diurnal patterns with high peak to valley ratios that result in poor average utilization across a day. In this paper, we show how to rescue unutilized(More)
A commonly employed abstraction for studying the object placement problem for the purpose of Internet content distribution is that of a distributed replication group. In this work, the initial model of the distributed replication group of Leff et al. [CHECK END OF SENTENCE] is extended to the case that individual nodes act selfishly, i.e., cater to the(More)
The chronic lymphocytic leukemia (CLL) immunoglobulin repertoire is biased and characterized by the existence of subsets of cases with closely homologous ("stereotyped") complementarity-determining region 3 (CDR3) sequences. In the present series, 201 (21.9%) of 916 patients with CLL expressed IGHV genes that belonged to 1 of 48 different subsets of(More)
The addition of storage capacity in network nodes for the caching or replication of popular data objects results in reduced end-user delay, reduced network traffic, and improved scalability. The problem of allocating an available storage budget to the nodes of a hierarchical content distribution system is formulated; optimal algorithms, as well as(More)
Somatic hypermutation (SHM) features in a series of 1967 immunoglobulin heavy chain gene (IGH) rearrangements obtained from patients with chronic lymphocytic leukemia (CLL) were examined and compared with IGH sequences from non-CLL B cells available in public databases. SHM analysis was performed for all 1290 CLL sequences in this cohort with less than 100%(More)