Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Forty data communications research questions

Published: 22 October 2011 Publication History

Abstract

About ten years ago, Bob Lucky asked me for a list of open research questions in networking. I didn't have a ready list and reacted it would be good to have one. This essay is my (long- belated) reply.

Supplementary Material

JPG File (sigcomm-bestofccr-01-fortydatacommunicationsresearchquestions.jpg)
MP4 File (sigcomm-bestofccr-01-fortydatacommunicationsresearchquestions.mp4)

References

[1]
R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, Network information flow. IEEE Trans. Information Theory, Vol 46 (2000), pp. 1204--1216
[2]
I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty. NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey. Comput. Netw. 50, 13 (September 2006), 2127--2159. DOI=10.1016/j.comnet.2006.05.001 http://dx.doi.org/10.1016/j.comnet.2006.05.001
[3]
Ashley-Rollman, M.P., Lee, P., Goldstein, S.C. Pillai, P. and Campbell, J.D. 2009. A Language for Large Ensembles of Independently Executing Nodes. Proc. Intl. Conference on Logic Programming (ICLP '09).
[4]
Baccelli, F. and Hong, D. 2000. TCP is max-plus linear and what it tells us on its throughput. In Proc. ACM SIGCOMM 2000. (Stockholm). 219--230. DOI= http://doi.acm.org/10.1145/347059.347548
[5]
J. G. Bednorz and K. A. Mueller (1986). Possible high TC superconductivity in the Ba-La-Cu-O system. Zeitschrift für Physik B 64 (2): 189--193.
[6]
Beeler, C. and Partridge, C. 2009. All-Optical Computing and All-Optical Networks are Dead. Queue 7, 3 (Apr. 2009), 10--10. DOI= http://doi.acm.org/10.1145/1530818.1530830
[7]
Caesar, M., Caldwell, D., Feamster, N., Rexford, J., Shaikh, A., and van der Merwe, J. 2005. Design and implementation of a routing control platform. Proc. 2nd Conf. on Networked Systems Design & Implementation - Volume 2 (May 02 - 04, 2005). USENIX Association, Berkeley, CA, 15--28.
[8]
Chiang, M., Low, S.H., Calderbank, A.R. and J. C. Doyle, J.C. 2007. Layering as optimization decomposition: A mathematical theory of network architectures. (Proc. IEEE, 95, 1, (Jan 2007), 255--312.
[9]
Clark, D. D., Wroclawski, J., Sollins, K. R., and Braden, R. 2002. Tussle in cyberspace: defining tomorrow's internet. Proc. ACM SIGCOMM 2002. (Pittsburgh, USA, August 19 - 23, 2002). 347--356. DOI= http://doi.acm.org/10.1145/633025.633059
[10]
Clark, D. D., Partridge, C., Ramming, J. C., and Wroclawski, J. T. 2003. A knowledge plane for the internet. Proc. SIGCOMM 2003. (Karlsruhe, August 25 - 29, 2003). 3--10. DOI= http://doi.acm.org/10.1145/863955.863957
[11]
Cohen, G., Dubois, D., Quadrat, J., and Viot, M. 1985. A linear-system theoretic view of discrete even processes and its use for performance evaluation in manufacturing. IEEE Trans. Auto Control, Vol. 30 (1985), pp. 210--220.
[12]
Cousins, D., Partridge, C., Bongiovanni, K., Jackson, A.W., Krishnan, R., Saxena, T., and Strayer.W.T. 2003. Understanding Encrypted Networks Through Signal and Systems Analysis of Traffic Timing. Proc. of IEEE Aerospace Conf.
[13]
Crowcroft, J. 2008. Cold topics in networking. SIGCOMM Comput. Commun. Rev. 38, 1 (Jan. 2008), 45--47. DOI= http://doi.acm.org/10.1145/1341431.1341440.
[14]
Day, J. 2008. Patterns in network architecture. Prentice Hall (2008).
[15]
Davidson, J. Hathaway, W., Postel, J., Mimno, N., Thomas, R., and Walden, D. 1997, The ARPAnet telnet protocol: its purpose, principles of implementation, and impact on host operating system design. Proc. Fifth Data Communications Symposium. 1977.
[16]
Dean, J. and Ghemawat, S. 2008. MapReduce: simplified data processing on large clusters. Commun. ACM 51, 1 (Jan. 2008), 107--113. DOI= http://doi.acm.org/10.1145/1327452.1327492
[17]
De Rosa, M., Goldstein, S.C., Lee, P., Pillai, P., and Campbell, J.D., 2009. A Tale of Two Planners: Modular Robotic Planning with LDP. Proceedings IEEE Intl. Conf. on Intelligent Robots and Systems (IROS '09).
[18]
Fall, K. A delay-tolerant network architecture for challenged internets. Proc. SIGCOMM 2003. DOI=10.1145/863955.863960 http://doi.acm.org/10.1145/863955.863960
[19]
Gentry, C. 2010. Computing arbitrary functions of encrypted data. Commun. ACM 53, 3 (Mar. 2010), 97--105. DOI= http://doi.acm.org/10.1145/1666420.1666444
[20]
Haigh, K., Hussain, T.S., Partridge, C. and Troxel, G.D. 2008. Rethinking Networking Architectures for Cognitive Control. Microsoft Research Cognitive Wireless Networking Summit 2008.
[21]
J. Hamilton. Data center networks are in my way. Stanford Clean Slate CTO Summit. 23 October 2009. http://www.mvdirona.com/jrh/work/
[22]
Han, S., Jang, K., Park, K., and Moon, S. PacketShader: a GPU-Accelerated Software Router. Proc. ACM SIGCOMM 2010 (New Dehli,August 30-September 3, 2010).
[23]
Heilmeier, G. Some Reflections on Innovation and Invention. Founders Award Lecture, National Academy of Engineering, Washington, D.C., Sept. 1992
[24]
Hilbert, D. Mathematical problems. Bulletin of the American Mathematical Society, vol. 8, no. 10 (1902), pp. 437--479.
[25]
Holzmann, G. 2004. SPIN Model Checker, The: Primer and Reference Manual. Addison Wesley, 2004.
[26]
Hussain, A., Heidemann, J., and Papadopoulos, C. 2003. A framework for classifying denial of service attacks. Proc SIGCOMM 2003 (Karlsruhe, August 25-29, 2003). 99--110. DOI= http://doi.acm.org/10.1145/863955.863968
[27]
Hutchinson, N. C. and Peterson, L. L. 1991. The X-Kernel: An Architecture for Implementing Network Protocols. IEEE Trans. Softw. Eng. 17, 1 (Jan. 1991), 64--76. DOI= http://dx.doi.org/10.1109/32.6757
[28]
Jacobson, V. 1990. RFC-1144: Header Compression for Low-Speed Serial Links. Internet Requests for Comments, No. 1144.
[29]
Jacobson, V., Smetters, D. K., Briggs, N. H., Plass, M. F., Stewart, P., Thornton, J. D., and Braynard, R. L. 2009. VoCCN: voice-over content-centric networks. Proc. ReArch 2009 (Rome, December 01-01, 2009). 1--6. DOI= http://doi.acm.org/10.1145/1658978.1658980
[30]
Jun, E.-S., and Vaidya, N. 2002. A power saving MAC protocol for wireless networks. Proc. IEEE INFOCOM 2002, pp.
[31]
Karsten, M., Keshav, S., Prasad, S., and Beg, M. 2007. An axiomatic basis for communication. Proc. SIGCOMM 2007 (Kyoto, August 27-31, 2007). 217--228. DOI= http://doi.acm.org/10.1145/1282380.128240
[32]
Kawadia, K. and Kumar, P.R. 2005. A cautionary perspective on cross layer design. IEEE Wireless Communication Magazine, 12, 1 (Feb 2005), 3--11.
[33]
Kim, C., Caesar, M., and Rexford, J. 2008. Floodless in seattle: a scalable ethernet architecture for large enterprises. Proc. SIGCOMM 2008 (Seattle, August 17 - 22, 2008). 3--14. DOI= http://doi.acm.org/10.1145/1402958.1402961.
[34]
Kobayashi, K. 2008. Flexible arrays of inexpensive network (FAIN): toward global parallelism in the internet to satisfy future traffic growth. Proc. CoNext 2008 (Madrid, December 09 - 12, 2008). 1--6. DOI= http://doi.acm.org/10.1145/1544012.1544075
[35]
Kone, V., Yang, L., Yang, X., Zhao, B.Y., and Zhang, H. On the feasibility of effective opportunistic spectrum access. Proc. IMC 2010. 151--164. DOI=10.1145/1879141.1879160 http://doi.acm.org/10.1145/1879141.1879160
[36]
Krugman, P. 2010. Building a green economy. The New York Times Magazine. 5 April 2010.
[37]
Lakhina, A., Papagiannaki, K., Crovella, M., Diot, C., Kolaczyk, E. D., and Taft, N. 2004. Structural analysis of network traffic flows. SIGMETRICS Perform. Eval. Rev. 32, 1 (Jun. 2004), 61--72. DOI= http://doi.acm.org/10.1145/1012888.1005697
[38]
W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson. On the self-similar nature of Ethernet traffic. Proc. SIGCOMM '93. 183--193. DOI=10.1145/166237.166255 http://doi.acm.org/10.1145/166237.166255
[39]
Little, J.D.C. A Proof of the Queueing Formula L = » W.Operations Research 9, 383--387 (1961)
[40]
Lucky, R. and Eisenberg, J., ed. 2006. Renewing U.S. Telecommunications Research. National Research Council (2006).
[41]
Ludwig, R. Eliminating Inefficient Cross-Layer Interactions in Wireless Networking. Ph.D. thesis, RWTH Aachen, 2000.
[42]
McHenry, M.A. 2005. NSF Spectrum Occupancy Measurements - Project Summary (on-line at http://www.sharedspectrum.com/inc/content/measurements/nsf/NSF_Project_Summary.pdf).
[43]
Markoff, J. 2010. Scientists Strive to Map the Shape-Shifting Net. The New York Times (1 March 2010).
[44]
Mathis, M., Mahdavi, J. Floyd, S., and Romanow, A. TCP Selective Acknowledgment Options. Internet Requests for Comments, RFC-2018. October 1996.
[45]
Maxemchuk, N.F. Routing in the Manhattan Street Network. IEEE Trans. on Commun. May 1987, vol. COM-35, no. 5, pp. 503--512.
[46]
Metcalfe, R. M. and Boggs, D. R. 1976. Ethernet: distributed packet switching for local computer networks. Commun. ACM 19, 7 (Jul. 1976), 395--404. DOI= http://doi.acm.org/10.1145/360248.360253
[47]
Mitola, J. Software Radios -- survey, critical evaluation and future directions. National Telesystems Conference, 1992.
[48]
Mills, D.L, Boncelet, C.G., Elias, J.G., Schragger, P.A., and Jackson, A.W. Highball: a high speed, reserved-access, wide-area network. Electrical Engineering Department Report 90-9-3, University of Delaware, September 1990.
[49]
Moy, J., Pillay-Esnault, P. and Lindem, A. Graceful OSPF restart. Internet Requests for Comments, No. 3623. Nov 2003.
[50]
National Research Council. Network Science. The National Academies Press (2005).
[51]
Nosratinia, A., Hunter, T.E., and A. Hedayat, A., 2004. Cooperative communication in wireless networks. IEEE Communications Magazine, 42, 10 (Oct 2004), 68--73.
[52]
Nychis, G., Fallin, C., Moscibroda, T. and Mutlu, O. Next generation on-chip networks: What kind of congestion control do we need? Proc. ACM HOTNETS IX (2009).
[53]
Partridge, C., Mendez, T., and Milliken, W. Host anycasting service. Internet Requests for Comments, No. 1546. November 1993.
[54]
Partridge, C., Cousins, D., Jackson, A. W., Krishnan, R., Saxena, T., and Strayer, W. T. 2002. Using signal processing to analyze wireless data traffic. In Proceedings of the 1st ACM Workshop on Wireless Security (Atlanta, GA, USA, September 28 - 28, 2002). 67--76. DOI= http://doi.acm.org/10.1145/570681.570689
[55]
Partridge, C. Realizing the Future of Wireless Data Communications. To appear in Commun. ACM.
[56]
Patterson, D. 2002. How to have a bad career in research/academia. Feb 2002. http://www.cs.berkeley.edu/~pattrsn/talks/BadCareer.pdf.
[57]
Patterson, D. The trouble with multicore. IEEE Spectrum, July 2010.
[58]
Popa, L., Ghodsi, A. and Stoica, I. HTTP as the Narrow Waist of the Future Internet. Proc. ACM HOTNETS 2010. Nov 2010.
[59]
Ray S., Guerin, R., and Sofia., R. A distributed hash table based address resolution scheme for large-scale Ethernet networks. In Proc. IEEE Intl. Conf. on Communications 2007.
[60]
Raymond, E. The iron laws of network cost scaling. Blog posting at ibiblio.org.
[61]
Redi J., Kolek, S., Manning, K., Partridge, C., Rosales-Hain, R., Ramanathan, R. and Castineyra, I., JAVeLEN -- an ultra-low energy ad hoc wireless network. Ad Hoc Networks, Vol. 6, No. 1 (2008), pp. 108--126.
[62]
Riga, N., Matta, I., Medina, A., Partridge, C., and Redi, J. 2007. An energy-conscious transport protocol for multi-hop wireless networks. Proc. CoNext 2007 (New York, December 10 - 13, 2007). 1--12. DOI= http://doi.acm.org/10.1145/1364654.1364683.
[63]
Saltzer, J. On the naming and binding of network destinations. Internet Requests for Comments, No. 1498, Aug 1983.
[64]
Santivanez, C., Ramanathan, R., Partridge, C., Krishnan, R., Condell, M. and Polit, S. Opportunistic Spectrum Access: Challenges, Architecture, Protocols. Proc. 2nd Annual International Wireless Internet Conference, August 2006
[65]
Shneidman, J. and Parkes, D. C. 2004. Specification faithfulness in networks with rational nodes. Proc. PODC 2004 (St. John's, July 25 - 28, 2004). 88--97. DOI= http://doi.acm.org/10.1145/1011767.1011781
[66]
Singh, S. Fermat's Enigma. Walker and Company (1997).
[67]
Sobel, D. Longitude. Walker and Company (1995).
[68]
Stanik, J. 2009. A Conversation with Van Jacobson. Queue 7, 1 (Jan. 2009), 8--16. DOI= http://doi.acm.org/10.1145/1508211.1508215
[69]
B. Tiwana, M. Balakrishnan, M.K. Aguilera, H. Ballani, and Z. M. Mao. Location, location, location!: modeling data proximity in the cloud. Proc. ACM HOTNETS 2010. Nov 2010.
[70]
Turner, J. S., Crowley, P., DeHart, J., Freestone, A., Heller, B., Kuhns, F., Kumar, S., Lockwood, J., Lu, J., Wilson, M., Wiseman, C., and Zar, D. 2007. Supercharging planetlab: a high performance, multi-application, overlay network platform. Proc. SIGCOMM 2007 (Kyoto, August 27 - 31, 2007). 85--96. DOI= http://doi.acm.org/10.1145/1282380.1282391
[71]
Van Meter, R., Ladd, T. D., Munro, W. J., and Nemoto, K. 2009. System design for a long-line quantum repeater. IEEE/ACM Trans. Netw. 17, 3 (Jun. 2009), 1002--1013. DOI= http://dx.doi.org/10.1109/TNET.2008.927260
[72]
R. Van Meter, J. Touch and C. Horsman. Recursive Quantum Repeater Networks. To appear Progress in Informatics, Mar 2011.
[73]
Yang, Q., Siganos, G., Faloutsos, M., and Lonardi, S. Evolution versus Intelligent Design: Comparing the Topology of Protein-Protein Interaction Networks to the Internet. LSS Computational Systems Bioinformatics Conference (CSB'06). 299--310, Stanford, CA, August 2006.
[74]
Ye, W., Heidemann, J., and Estrin, D. 2004. Medium access control with coordinated adaptive sleeping for wireless sensor networks. IEEE/ACM Trans. Netw. 12, 3 (Jun. 2004), 493--506. DOI=http://dx.doi.org/10.1109/TNET.2004.828953
[75]
Yeh, Y-.S., Hluchyj, M.G., and Acampora, A. The knockout switch: a simple, modular architecture for high-performance packet switching. IEEE Jour. Selected Areas in Communications, Vol 5, No. 8, (October 1987), pp. 1274--1283.
[76]
Zegura, E.W. Architectures for ATM switching systems. IEEE Communications Magazine, Vol 31, No. 2, (February 1993), pp. 28--37.
[77]
Zhao, Q. and Sadler, B. A survey of dynamic spectrum access. IEEE Signal Processing Magazine. (May 2007).
[78]
Zimmerman, H., 1980. OSI reference model -- the ISO model of architecture for open systems interconnection. IEEE Transactions on Communications, 28, 4 (Apr. 1980), 425--432.

Cited By

View all

Index Terms

  1. Forty data communications research questions

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 41, Issue 5
      September 2011
      43 pages
      ISSN:0146-4833
      DOI:10.1145/2043165
      Issue’s Table of Contents

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 22 October 2011
      Published in SIGCOMM-CCR Volume 41, Issue 5

      Check for updates

      Author Tags

      1. data communications
      2. data networking
      3. networking research agenda
      4. research

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)11
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 09 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2021)Research and Education Towards Smart and Sustainable WorldIEEE Access10.1109/ACCESS.2021.30699029(53156-53177)Online publication date: 2021
      • (2019)Graph Filter: Enabling Efficient Topology CalibrationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2019.292500130:12(2730-2742)Online publication date: 1-Dec-2019
      • (2017)The Habits of Highly Effective Researchers: An Empirical StudyIEEE Transactions on Big Data10.1109/TBDATA.2016.26116683:1(3-17)Online publication date: 1-Mar-2017
      • (2013)Is SDN the de-constraining constraint of the future internet?ACM SIGCOMM Computer Communication Review10.1145/2541468.254147243:5(13-18)Online publication date: 4-Nov-2013
      • (2013)Measurement-based simulation of WiFi interferenceProceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems10.1145/2507924.2507990(395-398)Online publication date: 3-Nov-2013
      • (2013)Complexity of Spectrum Activity and Benefits of Reinforcement Learning for Dynamic Channel SelectionIEEE Journal on Selected Areas in Communications10.1109/JSAC.2013.13111531:11(2237-2248)Online publication date: Nov-2013
      • (2013)Channel switching cost aware and energy-efficient cooperative sensing scheduling for cognitive radio networks2013 IEEE International Conference on Communications (ICC)10.1109/ICC.2013.6654933(2633-2638)Online publication date: Jun-2013
      • (2013)Designing robust network topologies for wireless sensor networks in adversarial environmentsPervasive and Mobile Computing10.1016/j.pmcj.2012.05.0019:4(546-563)Online publication date: Aug-2013
      • (2013)A Taxonomy of Naming ArchitecturesInternet Naming and Discovery10.1007/978-1-4471-4552-3_4(55-61)Online publication date: 2013
      • (2012)MeshMS: Ad Hoc Data Transfer within Mesh NetworkInternational Journal of Communications, Network and System Sciences10.4236/ijcns.2012.5806005:08(496-504)Online publication date: 2012

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media