MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Michalis Faloutsos" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 80 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Creating Optimal Distributed Algorithms for Minimum Spanning Trees  
  • by Michalis Faloutsos, Mart Molle — 1995
  • …This paper examines the complexity of distributed algorithms for finding a Minimum Spanning Tree in undirected graphs; the goal is to create algorithms optimal with respect to both communication O(E +N log N ) and time O(N ), where E; N is the number of edges and nodes respectively. A fundamental ba…
  • Cited by 8 (1 self) – Add To MetaCart
  • MDG: measurement-driven guidelines for 802.11 wlan design  
  • by Ioannis Broustis, Michalis Faloutsos — 2007 — In Mobicom
  • …Dense deployments of WLANs suffer from increased interference and as a result, reduced capacity. There are three main functions used to improve the overall network capacity: a) intelligent frequency allocation across APs, b) load-balancing of user affiliations across APs, and c) adaptive power-contr…
  • Cited by 2 (0 self) – Add To MetaCart
  • BGP Routing: A study at Large Time Scale  
  • by Georgos Siganos, Michalis Faloutsos — 2002 — in Proc. IEEE Global Internet
  • …In this paper, we conduct a longterm analysis of BGP routing properties such as path stability. Our work complements previous studies that examine the BGP routing behavior at smaller time scales such as its convergence to a routing update. We focus on properties that would reflect the BGP evolution …
  • Cited by 2 (0 self) – Add To MetaCart
  • Optimal Distributed Algorithm for Minimum Spanning Trees Revisited  
  • by Michalis Faloutsos, Mart Molle — 1995 — in Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing
  • …In an earlier paper, Awerbuch presented an innovative distributed algorithm for solving minimum spanning tree (MST) problems that achieved optimal time and message complexity through the introduction of several advanced features. In this paper, we show that there are some cases where his algorithm …
  • Cited by 17 (3 self) – Add To MetaCart
  • Analyzing BGP Policies: Methodology and Tool  
  • by Georgos Siganos, Michalis Faloutsos — 2004 — in Proc. IEEE INFOCOM
  • …The robustness of the Internet relies heavily on the robustness of BGP routing. BGP is the glue that holds the Internet together: it is the common language of the routers that interconnect networks or Autonomous Systems(AS). The robustness of BGP and our ability to manage it effectively is hampered …
  • Cited by 24 (1 self) – Add To MetaCart
  • On Power-Law Relationships of the Internet Topology  
  • by Michalis Faloutsos Riverside, Michalis Faloutsos — 1999
  • …Despite the apparent randomness of the Internet, we discover some surprisingly simple power-laws of the Internet topology. These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period. Weshow that our power-la…
  • Add To MetaCart
  • QoSMIC: Quality of Service sensitive Multicast Internet protoCol  
  • by Michalis Faloutsos Anindo, Michalis Faloutsos, Anindo Banerjea, Rajesh Pankaj — 1998
  • …In this paper, we present, QoSMIC, a multicast protocol for the Internet that supports QoS-sensitive routing, and minimizes the importance of a priori configuration decisions (such as core selection). The protocol is resource-efficient, robust, flexible, and scalable. In addition, our protocol is pr…
  • Add To MetaCart
  • The Evolution of the Internet:Topology and Routing  
  • by Georgos Siganos, Michalis Faloutsos, Christos Faloutsos
  • …Abstract—In this paper, we study the evolution of the Internet topology over the last three years. We study the evolution at three different levels: a) each node individually, b) the network as a whole, c) the path level. First, we find that the degrees of the nodes increase in a “rich get richer” f…
  • Add To MetaCart
  • Performance Evaluation of Mobile Wireless Networks: A New Perspective  
  • by J. Jobin, Michalis Faloutsos, Satish K. Tripathi — 2001 — ACM International Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM). Rome. Retrieved October 20, 2004, from http://www.cs.ucr.edu/~michalis/papers.html Kalim Susanto. (2001). Wireless Local Area Network. Michigan. UMI Di
  • …We propose a methodology to simplify the analysis of wireless network simulations. Wireless simulation models are plagued by a vast parameter space. Consequently, performance studies are not easy to interpret or compare across dierent models. We reduce this parameter space by proposing a set of para…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB