Jump to content

Ness B. Shroff

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by David Eppstein (talk | contribs) at 21:19, 23 July 2024 (Elif Uysal). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Ness B. Shroff
Alma materColumbia University
University of Pennsylvania
University of Southern California
Known forContributions to wireless network optimization and control
AwardsNSF Career Award (1996) IEEE Fellow (2007) IEEE Conference on Computer Communications (INFOCOM) Achievement Award (2014)
Scientific career
FieldsElectrical and Computer Engineering, Computer Science, Communication Networks, Machine Learning, Optimization
InstitutionsThe Ohio State University (2007–present)
Purdue University (1994–2007)
Doctoral advisorMischa Schwartz
Doctoral studentsJunyi Li

Ness B. Shroff is an American engineer, educator and researcher known for contributions to wireless networking, network control, and network analysis. He is professor in ECE and CSE departments at Ohio State University, where he holds the Ohio Eminent Scholar Chaired Professorship of Networking and Communications.[1]

Education

[edit]

Shroff received his B.S. from the University of Southern California in 1988, his M.S. from the University of Pennsylvania in 1990, his MPhil from Columbia University, in 1993, and his PhD from Columbia University, NY in 1994.

Career and research

[edit]

Shroff and his PhD student Xin Liu and colleague Edwin Chong were among the first researchers to recognize the importance of opportunistic scheduling in wireless networks with short-term fairness [2][3] Opportunistic scheduling is the idea that variability in wireless channel quality can be exploited to maximize network throughput while taking into account some measure of quality of service. Using connections to convex optimization theory and stochastic approximations, he developed online opportunistic scheduling mechanisms that could guarantee a variety of explicit fairness guarantees. Opportunistic scheduling is now a part of the communication paradigm in every modern mobile phone.

Shroff with his PhD student Xiaojun Lin were among the first researchers to show that a network utility maximization framework of wireless resource allocation provides a mathematical interpretation of the functionalities of the various layers of the network protocol stack.[4] Specifically, by making a connection to Lagrange multiplier theory in convex optimization, they showed that queue length information shared across multiple layers provided the right feedback to design resource allocation algorithms for the transport, network and medium access control protocols.[5][6] These tools and techniques have now become standards in cross-layer network design and his survey paper [7] on opportunistic scheduling and cross-layer design was also influential in making the topic widely accessible to a large audience.

Shroff and his PhD student Sellke developed a novel technique to protect computer networks for Internet worms and viruses. combat the most dangerous form of computer virus. The technique automatically detects when an Internet worm has infected a network and signals network administrators to isolate the infected machine and quarantine them for repairs.[8][9][10]

Shroff, his postdoc Yin Sun, along with colleagues, were the first researchers to show how to optimally manage the freshness of information updates sent from a source node to a destination via a channel.[11] A proper metric for data freshness at the destination is the age-of-information, or simply age, which is defined as how old the freshest received update is since the moment that this update was generated at the source node (e.g., a sensor). A well known update policy is the zero-wait policy, i.e., the source node submits a fresh update once the previous update is delivered and the channel becomes free, which achieves the maximum throughput and the minimum delay. In this work, Shroff et. al show the surprising result that the zero-wait policy does not always minimize the age. Their investigation shows that the zero-wait policy is far from the optimum if (i) the age penalty function grows quickly with respect to the age, (ii) the packet transmission times over the channel are positively correlated over time, or (iii) the packet transmission times are highly random (e.g., following a heavy-tail distribution). This was a seminal result in the area of age of information.


Shroff is currently leading a large multi-organization team, composed of universities, private companies, and research labs, which has been selected by the National Science Foundation for developing new Artificial Intelligence techniques to design future wireless networks.[12]

Awards and honors

[edit]

References

[edit]
  1. ^ "Ness B. Shroff". Ohio State University. Retrieved 7 October 2022.
  2. ^ X. Liu and E. K. P. Chong, and N. B. Shroff, “Opportunistic Transmission Scheduling With Resource-Sharing Constraints in Wireless Networks,” IEEE Journal on Selected Areas in Communications, vol. 19, no. 10, pp. 2053–2065.
  3. ^ X. Liu, E. K. P. Chong, and N. B. Shroff, “A Framework for Opportunistic Scheduling in Wireless Networks,” Computer Networks, vol. 41, no. 4, pp. 451–474, March 2003.
  4. ^ X. Lin and N. B. Shroff, “The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks,” IEEE INFOCOM’05, Miami, Florida, Mar. 2005
  5. ^ Xiaojun Lin and Ness B. Shroff. "Joint rate control and scheduling in multihop wireless networks." 43rd IEEE Conference on Decision and Control (CDC), Vol. 2. 2004.
  6. ^ Lin, Xiaojun, and Ness B. Shroff. "The impact of imperfect scheduling on cross-layer rate control in wireless networks." Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM).,Vol. 3. IEEE, 2005. (Extended version in IEEE/ACM Transactions on Networking, 2006).
  7. ^ X. Lin, N. B. Shroff, R. Srikant, “A Tutorial on Cross-Layer Optimization in Wireless Networks,” IEEE Journal on Selected Areas in Communications on “ Non-Linear Optimization of Communication Systems”, vol. 24, Issue 8, June 2006, pp. 1452- 1463.
  8. ^ "New strategy may protect computer networks from most virulent computer worms". Oneindia. Retrieved 7 October 2022.
  9. ^ "A new way to protect computer networks from Internet worms". Phys.org. Retrieved 7 October 2022.
  10. ^ "Boffins tackle random scanning worms". iTnews.
  11. ^ Yin Sun, E. Uysal-Biyikoglu, R. D. Yates, C. E. Koksal, and N. B. Shroff, “Update or Wait: How to Keep Your Data Fresh,” IEEE Trans. on Information Theory, vol. 63, no. 11, pp. 7492-7508, Nov. 2017.
  12. ^ "NSF funds 2 Ohio State-based institutes to expand artificial intelligence research". Osu.edu.
  13. ^ "IEEE INFOCOM 2016 Best Paper Award". IEEE.
  14. ^ "Most highly cited researchers". Thomas Reuters.
  15. ^ "IEEE INFOCOM 2014 Achievement Awards". IEEE.
  16. ^ "Professor Ness Shroff receives IEEE INFOCOM award". Electrical & Computer Engineering. 8 May 2014.
  17. ^ "The world's most influential scientific mind: 2014". Thomas Reuters.
  18. ^ "IEEE WiOPT 2012". IEEE.
  19. ^ "IEEE Fellows 2007". IEEE Communications Society.
  20. ^ a b "Best Paper Awards". Computer Science and Engineering. 17 September 2013.
  21. ^ "NSF Award Search: Award # 9624525 – CAREER: ATM and Wireless Networks: Theory, Experiments, and Applications". Nsf.gov.
  22. ^ "NSF awards fund seven young faculty members". Purdue.edu.
[edit]