Ness B. Shroff

Computer Networks and Communications · 2001–2020

A researcher in the Science corpus: 16 papers; trusts 38 researchers and is trusted by 36 researchers here, as inferred from the citation graph.

Subfields

Whom Ness B. Shroff trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Rene L. Cruz
  2. Xiaojun Lin
  3. Rayadurgam Srikant
  4. Sanjay Shakkottai
  5. Srisankar S. Kunniyur
  6. Yung Yi
  7. Arvind Santhanam
  8. Thomas Bonald
  9. Stephen J. Wright
  10. Michael J. Neely

Who trusts Ness B. Shroff overall

  1. Xiaojun Lin
  2. Mung Chiang
  3. Michael J. Neely
  4. Rayadurgam Srikant
  5. Alexander L. Stolyar
  6. Changhee Joo
  7. Devavrat Shah
  8. D. P. Palomar
  9. Atilla Eryilmaz
  10. Jean-Pierre Hubaux

Papers from Ness B. Shroff's perspective

Ordered by how strongly the researchers Ness B. Shroff trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Rate control for communication networks: shadow prices, proportional fairness and stability
  2. CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users (IEEE Communications Magazine)
  3. Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control (IEEE/ACM Transactions on Networking)
  4. Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm (Queueing Syst. Theory Appl.)
  5. Impact of fairness on Internet performance (Measurement and Modeling of Computer Systems)
  6. Partial Solutions Manual Parallel and Distributed Computation : Numerical Methods
  7. Mobility increases the capacity of ad-hoc wireless networks (Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213))
  8. Capacity regions for wireless ad hoc networks (2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333))
  9. A framework for opportunistic scheduling in wireless networks (Comput. Networks)
  10. Maxmin fair scheduling in wireless networks (Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies)

Their papers