MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Georgios Smaragdakis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 12 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • The Effect of Router Buffer Size on HighSpeed TCP Performance  
  • by Dhiman Barman, Georgios Smaragdakis, Ibrahim Matta — 2004 — in GLOBECOM 2004
  • …We study the effect of the IP router buffer size on the throughput of HighSpeed TCP (HSTCP). We are motivated by the fact that in high speed routers, the buffer size is important as such a large buffer size might be a constraint. We first derive an analytical model for HighSpeed TCP and we show that…
  • Cited by 5 (0 self) – Add To MetaCart
  • Distributed placement of service facilities in largescale networks  
  • by Nikolaos Laoutaris, Georgios Smaragdakis, Konstantinos Oikonomou — 2006
  • …Abstract — 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 would amount to formulating and solving the uncapacitated k-median…
  • Cited by 1 (0 self) – Add To MetaCart
  • Mistreatment in distributed caching groups: Causes and implications  
  • by Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bestavros, Ioannis Stavrakakis — 2006 — in Proc. of IEEE INFOCOM ’06
  • …Abstract — 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 through the exposition of one node’s resources to others. We study…
  • Cited by 6 (4 self) – Add To MetaCart
  • The EGOIST Overlay Routing System  
  • by Georgios Smaragdakis, Vassilis Lekakis, Nikolaos Laoutaris — 2008
  • …A foundational issue underlying many overlay net-work 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 cope with changing network conditions. Pre-vious work has considered the proble…
  • Add To MetaCart
  • Distributed Selfish Caching  
  • by Nikolaoslaoutflq- Georgios Smaragdakis, Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bestavros, Ibrahim Matta, Ioannis Stavrakakis — 2006
  • …Although coope"+E=@ ge+E=@DT incre@DT the amount ofre@zO"@D available to a community of node" thus improving individual andcollezED e pezzO@DT@=fi it also allows for the appe arance of pote tial mistreDT@z t proble" throughthe ee osition of one nodefi refi=fi+O toothefifl We study suchconce@D by con…
  • Cited by 1 (1 self) – Add To MetaCart
  • A Feedback Control Approach to Mitigating Mistreatment  
  • by Georgios Smaragdakis, Nikolaos Laoutaris, Ibrahim Matta, Azer Bestavros, Ioannis Stavrakakis — 2006 — in Distributed Caching Groups, in: Proceedings of IFIP Networking 2006
  • …Abstract. We consider distributed collaborative caching groups where individual members are autonomous and self-aware. Such groups have been emerging in many new overlay and peer-to-peer applications. In a recent work of ours, we considered distributed caching protocols where group members (nodes) c…
  • Cited by 1 (1 self) – Add To MetaCart
  • Mistreatment-Resilient Distributed Caching ⋆  
  • by Georgios Smaragdakis, Nikolaos Laoutaris, Azer Bestavros, Ibrahim Matta, Ioannis Stavrakakis
  • …The distributed partitioning of autonomous, self-aware nodes into cooperative groups, within which scarce resources could be effectively shared for the benefit of the group, is increasingly emerging as a hallmark of many newly-proposed overlay and peer-topeer applications. Distributed caching protoc…
  • Cited by 1 (1 self) – Add To MetaCart
  • Implications of selfish neighbor selection in overlay networks  
  • by Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bestavros, John W. Byers — 2007 — in Proc. of IEEE INFOCOM ’07
  • …Abstract — 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 neighbors so as to minimize the weighted sum of expected access cost…
  • Cited by 7 (4 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB