MOY, J.: “Multicast Routing Extensions for OSPF” Commun. of the ACM, vol. 37, pp. 61-66, AUg. 1994.
MULLINS, J.: “Making Unbreakable Code,” IEEE Spectrum, pp. 40-45, May 2002.
NAGLE, J.: “On Packet Switches with Infinite Storage,” IEEE Trans, on Commun., vol. COM-5, pp. 435-438, Apr. 1987.
NAGLE, J.: “Congestion Control in TCP/IP Internetworks,” Computer Commun. Rev., vol. 14, pp. 11-17, Oct. 1984.
NAUGHTON, J.: “A Brief History of the Future,” Woodstock, NY: Overlook Press, 2000.
NEEDHAM, R.M., andSCHROEDER, M.D.: “Using Encryption for Authentication in Large Networks of Computers,” Commun. of the ACM, vol. 21, pp. 993-999, Dec. 1978.
NEEDHAM, R.M., and SCHROEDER, M.D.: ‘Authentication Revisited,’’ Operating Systems Rev., vol. 21, p. 7, Jan. 1987.
NELAKUDITI, S., and ZHANG, Z.-L.: ‘A Localized Adaptive Proportioning Approach to QoS Routing,” IEEE Commun. Magazine vol. 40, pp. 66-71, June 2002.
NEUMAN, C., and TS’O, T.: “Kerberos: An Authentication Service for Computer Networks,’’ IEEE Commun. Mag., vol. 32, pp. 33-38, Sept. 1994.
NICHOLS, R.K., andLEKKAS, P.C.: Wireless Security, New York: McGraw-Hill, 2002.
NIST: “Secure Hash Algorithm,” U.S. Government Federal Information Processing Standardise, 1993.
NONNENMACHER, J,, BIERSACK, E., and TOWSLEY, D.: “Parity-Based Loss Recovery for Reliable Multicast Transmission,’’ Proc. SIGCOMM ’97 Conf., ACM, pp. 289-300, 1997.
NUCCI, A., and PAPAGIANNAKI, D.: Design, Measurement and Management of Large- Scale IP Networks, Cambridge: Cambridge University Press, 2008.
NUGENT, R., MUNAKANA, R., CHIN, A., COELHO, R., and PUIG-SUARI, J.: “The CubeSat: The PicoSatellite Standard for Research and Education,’’ Proc. SPACE 2008 Conf., AIAA, 2008.
ORAN, D.: “OSI IS-IS Intra-domain Routing Protocol,’’ RFC 1142, Feb. 1990.
OTWAY, D., and REES, O.: “Efficient and Timely Mutual Authentication,” Operating Systems Rev., pp. 8-10, Jan. 1987.
PADHYE, J., FIROIU, V., TOWSLEY, D., and KUROSE, J.: “Modeling TCP Throughput: A Simple Model and Its Empirical Validation,’’ Proc. SIGCOMM ’98 Conf., ACM, pp. 303-314, 1998.
PALAIS, J.C.: Fiber Optic Commun., 5rd ed., Englewood Cliffs, NJ: Prentice Hall, 2004.
PARAMESWARAN, M., SUSARLA, A., and WHINSTON, A.B.: “P2P Networking: An InformationSharing Alternative,” Computer, vol. 34, pp. 31-38, July 2001.
PAREKH, A., and GALLAGHER, R.: “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple-Node Case,’’ IEEE/ACM Trans. on Networking, vol. 2, pp. 137-150, Apr. 1994.
PAREKH, A., and GALLAGHER, R.: ‘A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,’’ IEEE/ACM Trans. on Networking, vol. 1, pp. 344-357, June 1993.
PARTRIDGE, C, HUGHES, J, and STONE, J.: “Performance of Checksums and CRCs over Real Data,” Proc. SIGCOMM ‘95 Conf., ACM, pp. 68-76, 1995.
PARTRIDGE, C, MENDEZ, T,, andMILLIKEN, W.: “Host Anycasting Service,’’ RFC 1546, Nov. 1993.
PAXSON, V., and FLOYD, S.: “Wide-Area Traffic: The Failure of Poisson Modeling,’’ IEEE/ACM Trans. on Networking, vol. 3, pp. 226-244, June 1995.
PERKINS, C.: “IP Mobility Support for IPv4,’’ RFC 3344, Aug. 2002.
PERKINS, C.E.: RTP: Audio and Video for the Internet, Boston: Addison-Wesley, 2003. PERKINS, C.E. (ed.): Ad Hoc Networking, Boston: Addison-Wesley, 2001.
PERKINS, C.E.: Mobile IP Design Principles and Practices, Upper Saddle River, NJ: Prentice Hall, 1998.
PERKINS, C.E., and ROYER, E.: “The Ad Hoc On-Demand Distance-Vector Protocol,’’ in Ad Hoc Networking, edited by C. Perkins, Boston: Addison-Wesley, 2001.
PERLMAN, R.: Interconnections, 2nd ed., Boston: Addison-Wesley, 2000.
PERLMAN, R.: Network Layer Protocols with Byzantine Robustness, Ph.D. thesis, M.I.T., 1988.
PERLMAN, R.: ‘An Algorithm for the Distributed Computation of a Spanning Tree in an Extended LAN,’’ Proc. SIGCOMM ’85 Conf., ACM, pp. 44-53, 1985.
PERLMAN, R., and KAUFMAN, C.: “Key Exchange in IPsec,” IEEE Internet Computing, vol. 4, pp. 50-56, Nov.-Dec. 2000.
PETERSON, W.W., and BROWN, D.T.: “Cyclic Codes for Error Detection,” Proc. IRE, vol. 49, pp. 228-235, Jan. 1961.
PIATEK, M., KOHNO, T., and KRISHNAMURTHY, A.: “Challenges and Directions for Monitoring P2P File Sharing Networks—or Why My Printer Received a DMCA Takedown Notice,’’ 3rd Workshop on Hot Topics in Security, USENIX, July 2008.
PIATEK, M., ISDAL, T,, ANDERSON, T,, KRISHNAMURTHY, A., and VENKATARAMANI, V.: “Do Incentives Build Robustness in BitTorrent?,’’ Proc. NSDI 2007 Conf., USENIX, pp. 1-14, 2007.
PISCITELLO, D.M., and CHAPIN, A.L.: Open Systems Networking: TCP/IP and OSI, Boston: Addison-Wesley, 1993.
PIVA, A., BARTOLINI, F., andBARNI, M.: “Managing Copyrights in Open Networks,” IEEE Internet Computing, vol. 6, pp. 18-26, May- 2002.
POSTEL, J.: “Internet Control Message Protocols,’’ RFC 792, Sept. 1981.
RABIN, J., and MCCATHIENEVILE, C.: “Mobile Web Best Practices 1.0,’’ W3C Recommendation, July 2008.
RAMAKRISHNAM, K.K., FLOYD, S., and BLACK, D.: “The Addition of Explicit Congestion Notification (ECN) to IP,’’ RFC 3168, Sept. 2001.
RAMAKRISHNAN, K.K., and JAIN, R.: “A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with a Connectionless Network Layer,’’ Proc. SIGCOMM ’88 Conf., ACM, pp. 303-313, 1988.
RAMASWAMI, R., KUMAR, S., and SASAKI, G.: Optical Networks: A Practical Perspective, 3rd ed., San Francisco: Morgan Kaufmann, 2009.
RATNASAMY, S., FRANCIS, P,, HANDLEY, M., KARP, R.., and SHENKER, S.: ‘A Scalable Content-Addressable Network,” Proc. SIGCOMM 2001 Conf, ACM, pp. 1161-172, 2001.
RIEBACK, M., CRISPO, B., and TANENBAUM, A.: “Is Your Cat Infected with a Computer Virus?,’’ Proc. IEEE Percom, pp. 169-179, Mar. 2006.
RIVEST, R.L.: “The MD5 Message-Digest Algorithm,” RFC 1320, Apr. 1992.
RIVEST, R.L., SHAMIR, A., and ADLEMAN, L.: “On a Method for Obtaining Digital Signatures and Public Key Cryptosystems,” Commun. of the ACM, vol. 21, pp. 120-126, Feb. 1978.
ROBERTS, L.G.: “Extensions of Packet Communication Technology to a Hand Held Personal Terminal,” Proc. Spring Joint Computer Conference, AFIPS, pp. 295-298, 1972.
ROBERTS, L.G.: “Multiple Computer Networks and Intercomputer Communication,” Proc. First Symp. on Operating Systems Prin., ACM, pp. 3.1-3.6, 1967.
ROSE, M.T.: The Simple Book, Englewood Cliffs, NJ: Prentice Hall, 1994.
ROSE, M.T.: The Internet Message, Englewood Cliffs, NJ: Prentice Hall, 1993.
ROWSTRON, A., and DRUSCHEL, P.: “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Storage Utility,” Proc. 18th Int’l Conf. on Distributed Systems Platforms, London: Springer-Verlag LNCS 2218, pp. 329-350, 2001.
RUIZ-SANCHEZ, M.A., BIERSACK, E.W., andDABBOUS, W.: “Survey and Taxonomy of IP Address Lookup Algorithms,” IEEE Network Magazine, vol. 15, pp. 8-23, March-April 2001.
SALTZER, J.H., REED, D.P, and CLARK, D.D.: “End-to-End Arguments in System Design,’’ ACM Trans. on Computer Systems, vol. 2, pp. 277-288, Nov. 1984.
SAMPLE, A., YEAGER, D., POWLEDGE, P,, MAMISHEV, A., and SMITH, J.: “Design of an RFID-Based Battery-Free Programmable Sensing Platform,’’ IEEE Trans. on Instrumentation and Measurement, vol. 57, pp. 2608-2615, Nov. 2008.
SAROIU, S., GUMMADI, K., and GRIBBLE, S.: “Measuring and Analyzing the Characteristics of Napster & Gnutella Hosts,’’ Multim. Syst., vol. 9,, pp. 170-184, Aug. 2003.