MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Kishore Kothapalli" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 5 documents found, showing 1 through 5.
ATOM RSS
  • Information Gathering in Adversarial Systems: Lines and Cycles  
  • by Kishore Kothapalli, Christian Scheideler — 2003 — In ACM SPAA
  • …In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adversarial control. Routing packets to a single destination is also known as information gathering. Information gathering is…
  • Cited by 3 (0 self) – Add To MetaCart
  • Supervised peer-to-peer systems  
  • by Kishore Kothapalli, Christian Scheideler — 2005 — In Proceedings of 2005 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN
  • …In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peer-to-peer system is a system in which the overlay network is formed by a supervisor but in which all other activities can be performed on a peer-to-peer basis without involving the superviso…
  • Cited by 4 (1 self) – Add To MetaCart
  • Constant density spanners for wireless ad-hoc networks  
  • by Melih Onus, Andrea Richa, Kishore Kothapalli, Christian Scheideler — 2005 — In ACM SPAA
  • …An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining such overlay networks have already been suggested, but most of them are based on an oversimplified wireless communication…
  • Cited by 2 (2 self) – Add To MetaCart
  • Constant density spanners for wireless ad-hoc networks  
  • by Kishore Kothapalli, Christian Scheideler, Melih Onus, Andrea Richa — 2005 — SPAA’05: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures
  • …An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining such overlay networks have already been suggested, but most of them are based on an oversimplified wireless communication…
  • Cited by 7 (5 self) – Add To MetaCart
  • Pagoda: A dynamic overlay network for routing, data management, and multicasting  
  • by Ankur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober — 2004 — Proceedings of the 16th Annual ACM Symposium on Parallel Algorithms and Architectures
  • …The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for these systems. While a large collection of scalable peer-to-peer overlay networks has been proposed in recent years, many f…
  • Cited by 3 (1 self) – Add To MetaCart
Help! Showing 1 through 5.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB