References

From FIpedia

Guidelines

• Enter references alphabetically according to the citation scheme detailed below.

• Remember to check the list before posting a reference to make sure that it doesn't already have an entry!

• Please hyperlink your reference titles directly to the corresponding material wherever possible (e.g. websites, PDFs, etc.).

• Please follow the IEEE Style Manual when compiling your list of references, with the following exception: we ask that you ignore the "[1] [2] [3] etc." numbering scheme and instead list your sources alphabetically using the following notation:

[AutYEARx]
 
- "Aut" is the first three letters of the primary/first author's surname (if it has less than three letters, 
use the full surname)
- "YEAR" is the 4 digit publication year (if the reference was never published, indicate the date at which it was 
made available in its current form)
- "x" is a lower case letter (i.e. a, b, c, etc.) used to differentiate separate publications whose entries for 
"Aut" and "YEAR" are identical; 
  to clarify:
     * if there is only a single reference with a given author and year, omit the distinguishing letter e.g. [Aut2008];
     * otherwise, number each identical item using "a" "b" "c" etc. e.g. [Aut2008a] [Aut2008b] [Aut2008c].

---

Contents 1 A - E 2 F - J 3 K - O 4 P - T 5 U - Z

[edit] A - E

[Aba1998] M. Abadi and A. D. Gordon, A Calculus for Cryptographic Protocols — The Spi Calculus, Research report SRC 149, 1998, pp. 110.

[Abr2005] I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup, "Compact Name Independent Routing with Minimum Stretch," In Proc. The sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004, pp. 20-24.

[Ada2005] D. Adams, J. Nicholas, and W. Siadak, Protocol Independent Multicast - Dense Mode (PIM-DM): Protocol Specification (Revised), IETF RFC 3973, Jan. 2005.

[Ana2008] Anand, A., Gupta, A., Akella, A., Seshan, S., and Shenker, S. 2008. Packet caches on routers: the implications of universal redundant traffic elimination. SIGCOMM Comput. Commun. Rev. 38, 4 (Oct. 2008), 219-230.

[And2003] T. Anderson, T. Roscoe, and D. Wetherall, "Preventing Internet denial-of-service with capabilities," In Proc. of the 2th ACM Workshop on Hot Topics in Networks (HotNets), 2003.

[And2007] D. Andersen, H. Balakrishnan, N. Feamster, T. Koponen, D. Moon, and S. Shenker, "Holding the Internet Accountable," In HotNets-VI, Nov. 2007, pp. 7–12.

[Are2005a] R. Arends, R. Austein, M. Larson, D. Massey, S. Rose, DNS Security Introduction and Requirements, IETF RFC 4033, Mar. 2005.

[Are2005b] R. Arends, R. Austein, M. Larson, D. Massey, S. Rose, Resource Records for the DNS Security Extensions, IETF RFC 4034, Mar. 2005.

[Are2005c] R. Arends, R. Austein, M. Larson, D. Massey, S. Rose, Protocol Modifications for the DNS Security Extensions, IETF RFC 4035, Mar. 2005.

[Arg2005] K. Argyraki and D. Cheriton, "Network capabilities: The good, the bad and the ugly," In Proc. of the 4th ACM Workshop on Hot Topics in Networks (HotNets), 2005.

[Ari2003] M. Arias, L. J. Cowen, K. A. Laing, R. Rajaraman, and O. Taka, "Compact Routing with Name Independence," In Proc. Fifteenth annual ACM symposium on Parallel algorithms and architectures, 2003, pp. 184-192.

[Aur1999] T. Aura, "Distributed access-rights management with delegation certificates," Secure Internet Programming, 1999, pp. 211–235.

[Avr2004] I. Avramopoulos, H. Kobayashi, R. Wang, and A. Krishnamurthy, "Highly Secure and Efficient Routing," In Proc. of IEEE INFOCOM 2004, Hong Kong, Mar. 2004.

[Awe2002] B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens, "An On-demand Secure Routing Protocol Resilient to Byzantine Failures," Proc. of the ACM Workshop on Wireless Security, 2002, pp. 21-30.

[Awe2005] B. Awerbuch, R. G. Cole, R. Curtmola, D. Holmer, C. Nita-Rotaru, and H. Rubens, Dynamics of learning Algorithms for the On-Demand Secure Byzantine Routing Protocol, JHU Applied Physics Laboratory Technical Report No. VIC-05-088, Nov. 2005.

[Bac2002] J. Bacon, K. Moody, and W. Yao, "A model of OASIS role-based access control and its support for active security," ACM Transactions on Information and System Security (TISSEC), vol. 5, issue 4, Nov. 2002, pp. 492-540.

[Bac2005] J. Bacon, D. M. Eyers, K. Moody, and L. I. W. Pesonen, "Securing publish/subscribe for multi-domain systems," in Middleware, ser. Lecture Notes in Computer Science, G. Alonso, Ed., vol. 3790, Springer, 2005, pp. 1–20.

[Bal1993] A. Ballardie, J. Crowcroft and P. Francis, "Core Based Trees (CBR) - An Architecture for scalable inter-domain multicast routing," Computer Communications Review, vol. 23, no. 4, 1993, pp. 85-95.

[Bal2005] H. Ballani, Y. Chawathe, S. Ratnasamy, T. Roscoe, and S. Shenker, "Off by default!", In Proc. of the 4th ACM Workshop on Hot Topics in Networks (HotNets), 2005.

[Bal2005] R. Baldoni, R. Beraldi, S. T. Piergiovanni, and A. Virgillito, "On the modelling of publish/subscribe communication systems," Concurrency and Computation: Practice and Experience, vol. 17, no. 12, Oct. 2005, pp. 1471-1495.

[Ban2002] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, "Scalable application layer multicast," Proc. of the conference on Applications, technologies, architectures, and protocols for computer communications, 2002, pp. 205-217.

[Bau2006] S. J. Bauer, P. Faratin, and Robert Beverly, "Assessing the assumptions underlying mechanism design for the Internet," In Proc. Workshop on the Economics of Networked Systems (NetEcon06), 2006.

[Bel2003] A. Belokosztolszki, D. M. Eyers, P. R. Pietzuch, J. Bacon and K. Moody, "Role-based access control for publish/subscribe middleware architectures," Proc. of the 2nd international workshop on Distributed event-based systems (DEBS’03), 2003.

[Ben2006] Y. Benkler. The Wealth of Networks: How Social Production Transforms Markets and Freedom. Yale University Press New Haven, CT, USA, 2006.

[Big2004] N. W. Biggart and R. Delbridge, "Systems of Exchange," Academy of Management Review, vol. 29, no. 1, 2004, pp. 28–49.

[Bla1996] M. Blaze, J. Feigenbaum, and J. Lacy, "Decentralized trust management," Proc. of the 1996 IEEE Symposium on Security and Privacy, 1996, pp. 164–173.

[Bla1999] M. Blaze, J. Feigenbaum, and A.D. Keromytis, "KeyNote: Trust Management for Public-Key Infrastructures," Lecture Notes in Computer Science, 1999.

[Blu2001] M. Blumenthal and D. Clark, "Rethinking the design of the Internet: The End-to-End arguments vs. The Brave New World," ACM Transactions on Internet Technology 2001, vol. 1, issue 1, 2001, pp. 70-109.

[Boi2000] R. Boivie, N. Feldman, and C. Metz, "Small group multicast: a new solution for multicasting on the Internet," IEEE Internet Computing, vol. 4, no. 3, 2000, pp. 75-79.

[Bra1998] S. Brackin, "Evaluating and improving protocol analysis by automatic proof," In Proc. of the 11th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, June 1998.

[Bra2006] A. Brady and L. Cowen, "Compact routing on power-law graphs with additive stretch," In ALENEX, 2006.

[Bri2004] R. Briscoe. "The implications of pervasive computing on network design," BT Technology Journal, vol. 22, no. 3, July 2004, pp. 170–190.

[Bri2005] B. Briscoe, A. Jacquet, C. D. Cairano-Gilfedder, A. Salvatori, A. Soppera and M. Koyabe, "Policing Congestion Response in an Internetwork using Re-feedback," ACM SIGCOMM Computer Communications Review, vol. 35, issue 4, Sep. 2005, pp. 277-288.

[Bri2007] B. Briscoe, "Flow Rate Fairness: Dismantling a Religion," ACM Computer Communications Review, vol. 37, issue 2, Apr 2007, pp. 63-74.

[Bur1990] M. Burrows, M. Abadi, and R. Needham, "A logic of authentication," ACM Transactions on Computer Systems (TOCS), vol. 8, issue 1, 1990, pp. 18-36.

[But2002] L. Buttyán and J. P. Hubaux, "A Formal Analysis of Syverson’s Rational Exchange Protocol," IEEE Computer Security Foundations Workshop, 2002.

[Bye1998] J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A Digital Fountain Approach to Reliable Distribution of Bulk Data," ACM SIGCOMM Computer Communication Review, vol. 48, no. 4, Oct. 1998, pp. 56-67.

[Cae2006] M. Caesar, T. Condie, J. Kannan, K. Lakshminarayanan, I. Stoica, and S. Shenker, "ROFL: Routing on Flat Labels," In ACM SIGCOMM, Sep. 2006, pp. 363–374.

[Cai2002] B. Cain, S. Deering, I. Kouvelas, B. Fenner, and A. Thyagarajan, Internet Group Management Protocol, Version 3, IETF RFC 3376, Oct. 2002.

[CAI2008] CAIDA, NeTS-NR Toward Mathematically Rigorous Next-Generation Routing Protocols for Realistic Network Topologies [online], available at: http://www.caida.org/funding/nets-nr/ [Accessed 13th June 2008].

[Cal2006] C. Caleiro, L. Viganò, and D. Basin, "On the Semantics of Alice&Bob Specifications of Security Protocols," Theoretical Computer Science, vol. 367, no. 1–2, 2006, pp. 88-122.

[Cal2007] K. Calvert, J. Griffioen, and L. Poutievski, "Separating Routing and Forwarding: A Clean-Slate Network Layer Design," In Proc. of Broadnets 2007, 2007.

[Cao2004] F. Cao, and J. P. Singh, "Efficient Event Routing in Content-based Publish-Subscribe Service Networks," In Proc. of the 23rd Conference on Computer Communications (IEEE INFOCOM 2004), Mar. 2004.

[Cao2005] F. Cao and J. P. Singh, "MEDYM: Match-Early and Dynamic Multicast for Content-Based Publish-Subscribe Service Networks," In Proc. of the Fourth international Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW’05), vol. 04, Washington DC, USA, June 2005, pp. 370-376.

[Cap2003] M. Caporuscio, A. Carzaniga, and A. L. Wolf, "Design and evaluation of a support service for mobile, wireless publish/subscribe applications," IEEE Transactions on Software Engineering, vol. 29, no. 12, Dec. 2003, pp. 1059–1071.

[Car1998] A. Carzaniga, "Architectures for an Event Notification Service Scalable to Wide-area Networks," doctoral dissertation, Politecnico di Milano, Dec. 1998.

[Car2001] A. Carzaniga, D. S. Rosenblum, and A. L. Wolf, "Design and evaluation of a wide-area event notification service," ACM Transactions on Computer Systems, vol. 19, no. 3, Aug. 2001, pp. 332–383.

[Cas2002a] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach, "Secure routing for structured peer-to-peer overlay networks," in Proc. of USENIX Operating System Design and Implementation(OSDI), Boston, MA, Dec. 2002.

[Cas2002b] M. Castro, P. Druschel, A.-M. Kermarrec, and A.I.T. Rowstron, "Scribe: a large-scale and decentralized application-level multicast infrastructure," IEEE Journal on Selected Areas in Communications, vol. 20, no. 8, 2002, pp. 1489-1499.

[Cas2003] M. Castro, M. B. Jones, A.-M. Kermarrec, Α. Rowstron, Μ. Theimer, H. Wang, and A. Wolman, "An evaluation of scalable application-level multicast built using peer-to-peer overlays," Proc. of the IEEE INFOCOM, vol. 2, 2003, pp. 1510-1520.

[CFP2005] D. Trossen and C. Fine (Eds), "Value Chain Dynamics in the Communication Industry," MIT Communications Futures Program, 2005.

[CFP2008] Communications Futures Program [online], 2008, available at: http://cfp.mit.edu [Accessed 19th June 2008].

[Cha1981] D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, vol. 4, no. 2, Feb. 1981.

[Cha2002] D. Chang, R. Govindan, and J. Heidemann, "An empirical study of router response to large BGP routing table load," SIGCOMM IMW, 2002.

[Che1985] D. R. Cheriton and S. E. Deering, "Host groups: A multicast extension for datagram internetworks," Proc. of the Data Communication Symposium, vol. 9, 1985, pp. 172-179.

[Che1993] K. Cheun and W. E. Stark, "Optimal Selection of Reed-Solomon Code Rate and the Number of Frequency Slots in Asynchronous FHSS-MA Networks," IEEE Transaction on Communications, vol. 41, no. 2, Feb. 1993, pp. 307-311.

[Chr1997] C. M. Christensen, "The innovator's dilemma : when new technologies cause great firms to fail", Harvard Business School Press, 1997

[Chu2002] Y.-H. Chu, S. G. Rao, S. Seshan, and H. Zhang, "A Case for End System Multicast," Journal of Selected Areas in Communications, vol. 20, no. 8, 2002, pp. 1456-1471.

[Cla2002] D. D. Clark, J. Wroclawski, K. R. Sollins, R. Braden, "Tussle in Cyberspace: Defining Tomorrow’s Internet," Proc. of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, 2002.

[Cla2003] D. D. Clark, K. Sollins, J. Wroclawski, T. Faber. "Addressing Reality: An Architectural Response to Real-World Demands on the Evolving Internet," In Proc. of the ACM SIGCOMM workshop on Future directions in network architecture, New York, NY, USA, 2003, pp. 247-257.

[Cla2005] D. D. Clark, J. Wroclawski, K. R. Sollins, and R. Braden, "Tussle in Cyberspace: Defining Tomorrow’s Internet," IEEE/ACM Transactions on Networking, vol. 13, issue 3, 2005, pp. 462-475.

[Cla2006] D. Clark, B. Lehr, S. Bauer, P. Faratin, R. Sami, and J. Wroclawski, "Overlay Networks and the Future of the Internet," COMMUNICATIONS & STRATEGIES, no. 63, 2006, p. 1.

[Cla2007] D. D. Clark and M. S. Blumenthal, "End-to-end Arguments in Application Design: The Role of Trust," In Proc. of TPRC, 2007.

[Cor2007] A. Corman, P. Schachte, and V. Teague, "QUIP: A Protocol For Securing Content in Peer-To-Peer Publish/Subscribe Overlay Networks," In Proc. Thirtienth Australasian Computer Science Conference (ACSC2007), Ballarat, Australia, 2007, pp. 35-40.

[Cou2000] C. Courcoubetis, F. P. Kelly, V. A. Siris and R. Weber, "A study of simple usage-based charging schemes for broadband networks," Telecommunication systems, vol. 15, issue 3-4, 2000, pp. 323-343.

[Cow1999] LJ Cowen, "Compact routing with minimum stretch," in Proc. Tenth annual ACM-SIAM symposium on Discrete algorithms, 1999, pp. 255-260.

[Cra2002] F. Crazzolara and G. Milicia, "Developing Security Protocols in X-Spaces," In Proc. of the 7th Nordic Workshop on Secure IT Systems (NordSec), Nov. 2002.

[Cro2003] J. Crowcroft, S. Hand, R. Mortier, T. Roscow, and A. Warfield, "Plutarch: An Argument for Network Pluralism," in Proc. SIGCOMM Workshops, Aug. 2003.

[Cui2003] J.-H. Cui, L. Lao, D. Maggiorini, and M. Gerla, "BEAM: a distributed aggregated multicast protocol using bi-directional trees," IEEE International Conference on Communications, vol. 1, 2003, pp. 689-695.

[DeC2005] D. S. J. DeCouto, D. Aguayo, J. Bicket, and R. Moris, "A High-Throughput Path Metric for Multi-Hop Wireless Routing," Wireless Networks, Spinger, Netherlands, vol. 11, no. 4, July 2005, pp. 419-434.

[Dee1991] S. Deering, "Multicast Routing in a Datagram Network," doctoral dissertation, Dept. of Computer Science, Stanford University, 1991.

[Dem1968] A. P. Dempster, "A generalization of Bayesian inference," Journal of the Royal Statistical Society, vol. 30, 1968, pp. 205-247.

[Din2004] R. Dingledine, N. Mathewson, and P. Syverson, "Tor: The Second-Generation Onion Router," In Proc. of the 13th USENIX Security Symposium, Aug. 2004.

[Dio2000] C. Diot, B. N. Levine, B. Lyles, H. Kassem, and D. Balensiefen, "Deployment issues for the IP multicast service and architecture," IEEE Network, vol. 14, no. 1, 2000, pp. 78-88.

[Dol1983] D. Dolev and A. C. Yao, "On the security of public-key protocols," IEEE Transactions on Information Theory, vol. 2, no. 29, Mar. 1983, pp. 198-208.

[Dou2002] J. Douceur, "The Sybil attack," Proc. of IPTPS, 2002, pp. 251-260.

[Ell1999] C. Ellison, B. Frantz, B. Lampson, R. Rivest, B. Thomas, and T. Ylonen, "SPKI Certificate Theory," 1999.

[edit] F - J

[Fab1999] F. Javier Thayer Fabrega, J. C. Herzog, and J. D. Guttman, "Strand Spaces: Proving Security Protocols Correct," Journal of Computer Security, 1999, pp. 191-230.

[Far2002] S. Farrell and R. Housley, An Internet Attribute Certificate Profile for Authorization, IETF RFC 3281, April 2002.

[Far2007] P. Faratin, "Economics of Overlay Networks: An Industrial Organization Perspective on Network Economics," Proc. of the Joint Workshop on The Economics of Networked Systems and Incentive-Based Computing (NetEcon+IBC) in conjunction with ACM Conference on Electronic Commerce (EC’07), 2007.

[Fea2004] N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and J. v. d. Merwe, "The case for separating routing from routers," In FDNA ’04: Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture, New York, NY, USA, 2004. pp. 5-12.

[Feh2002] E. Fehr, U. FIschbacher, and S. Gächter, "Strong Reciprocity, Human Cooperation and the Enforcement of Social Norms," Human Nature, vol. 13, 2002, pp. 1-25.

[Fei2001] J. Feigenbaum, C. Papadimitriou, and Scott Shenker, "Sharing the Cost of Multicast Transmissions," Journal of Computer and System Sciences, vol. 63, 2001, pp. 21-41.

[Fei2006] J. Feigenbaum, V. Ramachandran, and M. Schapira, "Incentive-Compatible Interdomain Routing," in Proc. of the 7th Conference on Electronic Commerce, ACM Press, New York, 2006, pp. 130-139.

[Fei2007] J. Feigenbaum, D. Karger, V. Mirrokni, and R. Sami, "Subjective-Cost Policy Routing," Theoretical Computer Science, vol. 378, 2007, pp. 175-189.

[Fen2006] B. Fenner, M. Handley, H. Holbrook, and I. Kouvelas, Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification (Revised), IETF RFC 4601, Aug. 2006.

[Fie2004] C. Fiege, A. Zeidler, A. Buchmann, R. Kilian-Kehr, and G. Mühl, "Security Aspects in Publish/Subscribe Systems," in Proc. Of Third International Workshop on Distributed Event-Based Systems (DEBS), Edinburgh, Scotland, UK, May 2004.

[Fin1998] C. Fine, Clockspeed: Winning Industry Control in the Age of Temporary Advantage, Sloan School of Management, 1998.

[Fra2006] C. Fragouli, J.-Y. Le Boudec, and J. Widmer, "Network Coding: An Instant Primer," ACM SIGCOM Computer Communication Review, vol. 36, no. 1, Jan. 2006, pp. 63-68.

[Fra2007] C. Fraguoli, D. Katabi, A. Markopoulou, M. Medard, and H. Rahul, "Wireless Network Coding, Opportunities and Challenges," Military Communications Conference, IEEE MILCOM 2007, Oct. 2007, pp. 1-8.

[Fuk1995] F. Fukuyama, "Trust: the social virtues and the creation of prosperity," Free Press, 1995.

[Ful1993] V. Fuller, T. Li, J. Yu and K. Varadhan, Classless Inter-Domain Routing (CIDR), IETF RFC 1519, Sep. 1993.

[Gan2004] P. Ganesan, K. Gummadi, H. Garcia-Molina, "Canon in G Major: Designing DHTs with Hierarchical Structure," ICDCS, Mar. 2004.

[Gav1996] C. Gavoille and S. P´erennes, "Memory requirement for routing in distributed networks," In Proc. of the 15th PODC, ACM, 1996.

[Gav2001] C. Gavoille and M. Gengler, "Space-Efficiency for Routing Schemes of Stretch Factor Three," Journal of Parallel and Distributed Computing, vol. 61, issue 5, 2001, pp. 679-687.

[Gib1999a] R. J. Gibbens and F. P. Kelly, "Resource pricing and the evolution of congestion control," Automatica, vol. 35, 1999, pp. 1969-1985.

[Gib1999b] R. J. Gibbens and F. P. Kelly, "Distributed connection acceptance control for a connectionless network," in Proc. of Teletraffic Engineering in a Competitive World (Editors P. Key and D. Smith), ITC16, Elsevier, Amsterdam, 1999, pp. 941-952.

[Gil2006] S. Gillett, B. Lehr, C. A. Osorio, and M. Sirbu, Measuring the Economic Impact of Broadband Deployment, Final Report prepared for the U.S. Department of Commerce, Economic Development Administration, 2006.

[Gin2000] H. Gintis, "Strong Reciprocity and Human Sociality," Journal of Theoretical Biology, vol. 206, no. 2, 2000, pp. 169–179.

[Gon1990] L. Gong, R. Needham, and R. Yahalom, "Reasoning about belief in cryptographic protocols," Proc. 1990 IEEE Symposium on Research in Security and Privacy, 1990, pp. 234-248.

[Gri2001] M. Gritter and D. R. Cheriton, "An Architecture for Content Routing Support in the Internet," In USITS’01: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems, Berkeley, CA, USA, 2001, pp. 37-48.

[GTI2000] Modeling Topology of Large Internetworks, Georgia Institute of Technology. Project website.

[Gui2005] A. Guitton and J. Moulierac, "Scalable Tree Aggregation for Multicast," In proc. of 8th International Conference on Telecommunications (ConTEL), Zagreb, Croatia, June 2005.

[Guo2005] H. Q. Guo, L. H. Ngoh, and W. C. Wong, "DINloop based inter-domain multicast with MPLS," In Proc. of 24th IEEE International Conference on Performance, Computing, and Communications, IPCCC 2005, Phoenix, USA, Apr. 2005.

[Gur2005] A. Gurtov, D. Korzun, and P. Nikander, Hi3: An efficient and secure networking architecture for mobile hosts, Technical Report TR-2005-2, HIIT, June 2005.

[Haa2004] C. Haack and A. Jeffrey, "Pattern-matching Spi-calculus," Proc. FAST’04, IFIP series 173, 2004, pp. 193-205.

[Hak1971] S. L. Hakimi, "Steiner’s problem in graphs and its implications," Networks, vol. 1, 1971, pp. 113-133.

[Han2004] M. Handley and A. Greenhalgh, "Steps Towards a DoS-resistant Internet Architecture," In FDNA ’04: Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture, New York, NY, USA, 2004, pp. 49-56.

[Han2005] M. Handley and A. Greenhalgh, "The Case for Pushing DNS," In Proc. of the 4th ACM Workshop on Hot Topics in Networks (HotNets), 2005.

[He2006] L. He and J. Walrand, "Pricing and Revenue Sharing Strategies for Internet Service Providers," IEEE JSAC, May 2006.

[Her1997] S. Herzog, S. Shenker, and D. Estrin, "Sharing the "cost" of multicast trees: an axiomatic analysis," IEEE/ACM Transactions on Networking, vol. 5, no. 6, Dec. 1997, pp. 847-860.

[Her2003] J. C. Herzog, "The Diffie-Hellman Key-Agreement Scheme in the Strand-Space Model," In Proc. of the 16th IEEE Computer Security Foundations Workshop, 2003.

[Him2007] P. Himanen, "Finnish dream: An Innovation Report," 2nd ed. (in Finnish), 2007.

[Hin2006] R. Hinden and S. Deering. IP Version 6 Addressing Architecture, IETF RFC 4291, Feb. 2006.

[Ho2005] T. Ho, M. Medard, R. Koetter, D. R. Karger, M. Effros, J. Shi, and B. Leong, "A Random Linear Network Coding Approach to Multicast," IEEE Transactions on Information Theory, vol. 52, no. 10, Oct. 2005, pp. 4413-4430.

[Hol2006] H. Holbrook and B. Cain, Source-Specific Multicast for IP, IETF RFC 4607, Aug. 2006.

[Hol2008] R. Hollingsworth and K. Müller, "Transforming socio-economics with a new epistemology," Socio-Economic Review, vol. 6, 2008, pp. 395–426.

[Hu2002] Y. Hu, A. Perrig, and D. Johnson, "Packet Leashes: A Defense Against Wormhole Attacks in Wireless Ad Hoc Networks," Proc. of IEEE INFOCOM, 2003.

[Hu2004] Y. Hu and A. Perrig, "A Survey of Secure Wireless Ad Hoc Routing," IEEE Security & Privacy, 2004, pp. 28-39.

[Hui1999] A. Huima, "Efficient Infinite-State Analysis of Security Protocols," Workshop on Formal Methods and Security Protocols, 1999.

[Hui2007] F. Huici and M. Handley, "An edge-to-edge filtering architecture against DoS," ACM SIGCOMM Computer Communication Review 2007, vol. 37, issue 2, ACM Press New York, NY, USA, 2007, pp. 37-50.

[Jøs1996] A. Jøsang, "The right type of trust for distributed systems," Proc. of the 1996 workshop on New security paradigms, 1996, pp. 119-131.

[Jøs1999] A. Jøsang, "An algebra for assessing trust in certification chains," Proc. of the Network and Distributed Systems Security Symposium (NDSS99), The Internet Society, 1999.

[Jøs2001] A. Jøsang, "A logic for uncertain probabilities," International Journal of Uncertainty Fuzziness and Knowledge-Based Systems, vol. 9, issue 3, 2001, pp. 279–311.

[edit] K - O

[Kat2006] S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft, "XOR in the Air," ACM SIGCOMM Computer Communication Review, vol. 36, no. 4, Oct. 2006, pages 243-254.

[Kat2007] S. Katti and D. Katabi, MIXIT: The Network Meets the Wireless Channel, MIT Computer Science and Artificial Intelligence Laboratory Technical Report, Sep. 2007.

[Kel1998] F. P. Kelly, A. Maulloo and D. Tan, "Rate control in communication networks: shadow prices, proportional fairness and stability," Journal of the Operational Research Society, vol. 49, 1998, pp. 237-252.

[Ker2002] A. D. Keromytis, V. Misra, and D. Rubenstein, "SOS: secure overlay services," In Proc. of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, ACM Press, New York, NY, USA, 2002, pp. 61-72.

[Kes1998] D. Kesdogan, J. Egner, and R. Buschkes, "Stop-and-go MIXes Providing Probabilistic Security in an Open System," 2nd International Workshop on Information Hiding, 1998.

[Key2006] P. Key and L. Massoulié, "Combining Multipath Routing and Congestion Control for Robustness," 40th Conference on Information Sciences and Systems (CISS 2006), March 2006, pp. 345-350.

[Khu2005] H. Khurana, "Scalable Security and Accounting Services for Content-based Publish/Subscribe Systems," ACM Symposium on Applied Computing, 2005.

[Kop2007] T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K. H. Kim, S. Shenker, and I. Stoica, "A Data-Oriented (and Beyond) Network Architecture," In SIGCOMM ’07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, New York, NY, USA, 2007, pp. 181-192.

[Kri2004] D. Krioukov, K. Fall, and X. Yang, "Compact Routing on Internet-like Graphs," In Proc. INFOCOM 2004, Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, 2004, pp. 208-219.

[Kri2007] D. Krioukov, kc claffy, K. Fall and A. Brady, "On Compact Routing for the Internet," In ACM SIGCOMM Computer Communication Review, vol. 37, no. 3, 2007, pp. 41-52.

[Lak2006] K. K. Lakshminarayanan, I. Stoica, S. Shenker, and J. Rexford, Routing as a Service, Technical report, UC Berkeley, 2006.

[Leh1998] I. Lehti and P. Nikander, "Certifying trust," Proc. of the Practice and Theory in Public Key Cryptography (PKC)98, 1998.

[Les2007] J. Leskovec, and C. Faloutsos, "Scalable modeling of real graphs using Kronecker multiplication", In Proceedings of the 24th international Conference on Machine Learning, Corvalis, Oregon, Jun. 2007.

[Lev2002] B. N. Levine and C. Shields, "Hordes: A multicast-based protocol for anonymity", J. of Computer Sec., vol. 10, issue 3, 2002, pp. 213-240.

[Lou1989] K. Lougheed and Y. Rekhter, A Border Gateway Protocol (BGP), IETF RFC 1105, June 1989.

[Low1996] G. Lowe, "Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR," in Tools and Algorithms for the Construction and Analysis of Systems, Springer-Verlag, 1996, pp. 147-166.

[Low2001] G. Lowe, P. Broadfoot, and M. L. Hui, "Casper A Compiler for the Analysis of Security Protocols," [online] Dec. 2001, available at: http://web.comlab.ox.ac.uk/people/gavin.lowe/Security/Casper/ [Accessed 23th June 2008].

[Lub2002] M. Luby, "LT Codes," in Proc. of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 271-280.

[Mac1995] J. MacKie-Mason and H. Varian, "Pricing congestible network resources," IEEE Journal on Selected Areas in Communication, vol. 13, 1995, pp. 1141-1149.

[Mac2005] D. J. C. MacKay, "Capacity Approaching Codes Design and Implementation, Fountain Codes," IEEE Proc.-Commun., vol. 156, no. 6, Dec. 2005, pp. 1062-1068.

[Mah2006] P. Mahadevan, D. V. Krioukov, K. R. Fall and A. Vahdat, "Systematic topology analysis and generation using degree correlations", SIGCOMM 2006.

[Mea2001] C. Meadows, "A formal framework and evaluation method for network denial of service," In Proc. of the 12th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, vol. 9, no. 1, 2001, pp. 47–74.

[Mea2003] C. Meadows, "Formal methods for cryptographic protocol analysis: emerging issues and trends," IEEE Journal on Selected Areas in Communications, vol. 21, no. 1, 2003, pp. 44–54.

[Mey2007] D. Meyer, L. Zhang, and K. Fall, Report from the IAB Workshop on Routing and Addressing, IETF RFC 4984, Sep. 2007.

[Mil1997] J. K. Millen, "CAPSL: Common Authentication Protocol Specification Language," The MITRE Corporation, 1997.

[Mil2001] J. Millen and V. Shmatikov, "Constraint solving for bounded-process cryptographic protocol analysis," in 8th ACM Conference on Computer and Communication Security, Nov. 2001, pp. 166–175.

[Mit2004] M. Mitzenmacher, "Digital Fountains: Survey and Look Forward," IEEE Information Theory Workshop 2004, Oct. 2004, pp. 271-276.

[Mos2006] R. Moskowitz and P. Nikander, Host Identity Protocol (HIP) Architecture, IETF RFC 4423, May 2006.

[Moy1994] J. Moy, Multicast Extensions to OSPF, IETF RFC 1584, Mar. 1994.

[Muh2002a] J. Al-Muhtadi, R. Campbell, A. Kapadia, M. D. Mickunas, and S. Yi, "Routing Through the Mist: Privacy Preserving Communication in Ubiquitous Computing Environments," in Proc. Intl. Conf. of Distributed Comp. Syst., 2002.

[Müh2002b] G. Mühl, "Large-Scale Content-Based Publish/Subscribe Systems," doctoral dissertation, Darmstadt University of Technology, Sep. 2002.

[Mus2008] J. Musacchio, G. Schwartz, and J. Walrand, "A Two-Sided Market Analysis of Provider Investment Incentives with an Application to the Net Neutrality Issue," Review of Network Economics, to be published, 2008.

[Nik1999] P. Nikander, "An Architecture for Authorization and Delegation in Distributed Object-Oriented Agent Systems," doctoral dissertation, Helsinki University of Technology, Mar. 1999.

[Nis1999] N. Nisan and A. Ronen, "Algorithmic Mechanism Design," in Proc. 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 129-140.

[Odl1999] A. Odlyzko, "Paris metro pricing for the internet," Proc. of the 1st ACM conference on Electronic commerce, 1999, pp. 140-147.

[Odl2003] A. Odlyzko, "The case against micropayments," in Proc. of Financial Cryptography: 7th International Conference, FC 2003, Guadeloupe, French West Indies, Jan. 2003.

[OEC2001] OECD "The Well-being of Nations: the Role of Human and Social Capital," 2001.

[edit] P - T

[Pap2001] C. Papadimitriou, "Algorithms, Games, and the Internet," in Proc. of STOC’01, July 6-8, Crete, Greece, 2001.

[Pap2004] I. Papaefstathiou and C. Manifavas, "Evaluation of Micropayment Transaction Costs," Journal of Electronic Commerce Research, vol. 5, no. 2, 2004, pp. 99-113.

[Par2007] B. Parno, D. Wendlandt, E. Shi, A. Perrig, B. Maggs, and Y. C. Hu, "Portcullis: protecting connection setup from denial-of-capability attacks," In Proc. of ACM Sigcomm 2007, 2007.

[Pas1998] J. C. Pasquale, G. C. Polyzos, and G. Xylomenos, "The multimedia multicast problem," Multimedia Systems, vol. 6, no. 1, 1998, pp. 43-59.

[Pau2002] P. Paul and S. V. Raghavan, "Survey of multicast routing algorithms and protocols," Proc. of the Fifteenth International Conference on Computer Communication 2002, Mumbai, India, Aug. 2002.

[Pen2001] D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel, "ALMI: an application level multicast infrastructure," Proc. of the USENIX Symposium on Internet Technologies and Systems, vol. 3, 2001.

[Per1998] R. Perlman, "Network layer protocols with Byzantine robustness," doctoral dissertation, MIT-LCS-TR-429, 1998.

[Per2002] A. Perrig, R. Canetti, J. D. Tygar, and D. Song, "The TESLA Broadcast Authentication Protocol," CryptoBytes, vol. 5, no. 2, Summer/Fall 2002, pp. 2-13.

[Pes2005] L. I. W. Pesonen and J. Bacon, "Secure event types in content-based, multi-domain publish/subscribe systems," in SEM ’05: Proc. of the 5th international workshop on Software engineering and middleware, New York, NY, USA: ACM Press, Sept. 2005, pp. 98-105.

[Pes2006] L. I. W. Pesonen, D. M. Eyers, and J. Bacon, "A capabilities-based access control architecture for multi-domain publish/subscribe systems," in Proc. of the Symposium on Applications and the Internet (SAINT 2006). Phoenix, AZ, Jan. 2006, pp. 222-228.

[Pes2007a] L. I. W. Pesonen, D. M. Eyers, and J. Bacon, "Access Control in Decentralised Publish/Subscribe Systems," Journal on Networks, vol. 2, no. 2, Apr. 2007.

[Pes2007b] L. I. W. Pesonen, D. M. Eyers, and J. Bacon, "Encryption-Enforced Access Control in Dynamic Multi-Domain Publish/Subscribe Networks," In Proc. of the International Conference on Distributed Event-Based Systems (DEBS’07), ACM Press, June 2007, pp. 104-115.

[Pie2002] P. R. Pietzuch and J. M. Bacon. "Hermes: A Distributed Event-Based Middleware Architecture," Proc. of the 1st International Workshop on Distributed Event-Based Systems (DEBS’02), July 2002, pp. 611-618.

[Pie2004] P. R. Pietzuch, "Hermes: A Scalable Event-Based Middleware," doctoral dissertation, Computer Laboratory, Queens’ College, University of Cambridge, Feb. 2004.

[Pit2008] M. Pitkänen and J. Ott, "Enabling Opportunistic Storage for Mobile DTNs," Elsevier, to be published, 2008.

[Put1993] R. Putnam, R. Leonardi, and R. Nanetti, "Making democracy work: civic traditions in modern Italy," Princeton University Press, Princeton, NJ, 1993.

[Qui2001] B. Quinn and K. Almeroth, IP Multicast Applications: Challenges and Solutions, IETF RFC 3170, Sep. 2001.

[Rai2006] C. Raiciu, D. S. Rosenblum, and M. Handley, "Revisiting Content-Based Publish/Subscribe," In Proc. of the ICDCS Workshop on Distributed Event Based Systems (DEBS), Lisbon, Portugal, July 2006.

[Ram2004a] V. Ramasubramanian and E. G. Sirer, "Beehive: Exploiting Power Law Query Distributions for O(1) Lookup Performance in Peer to Peer Overlays," Symposium on Networked Systems Design and Implementation, San Francisco CA, Mar. 2004.

[Ram2004b] V. Ramasubramanian, E. G. Sirer, "The Design and Implementation of a Next Generation Name Service for the Internet," SIGCOMM, 2004.

[Rat2001a] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," In Proceedings of ACM SIGCOMM, Aug. 2001.

[Rat2001b] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Application-level multicast using content-addressable networks," Lecture Notes in Computer Science, 2233, 2001, pp. 14-29.

[Rat2005] S. Ratnasamy, S. Shenker, and S. McCanne, "Towards an Evolvable Internet Architecture," In Proc. of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications, ACM Press New York, NY, USA, 2005, pp. 313-324.

[Rat2006] S. Ratnasamay, A. Ermolinskiy, and S. Shenker, "Revisiting IP Multicast," In Proc. of the ACM SIGCOMM 2006, Pisa, Italy, Sep. 2006.

[Ree1960] I. S. Reed and G. Solomon, "Polynomial Codes over Certain Finite Fields," SIAM Journal of Applied Math., vol. 8, 1960, pp. 300-304.

[Ree1998] M. G. Reed, P. F. Syverson, and D. M. Goldschlag, "Anonymous connections and onion routing," IEEE JSAC, vol. 16, issue 4, 1998, pp. 482-494.

[Rei1998] M. K. Reiter and A. D. Rubin. "Crowds: anonymity for web transactions," ACM Trans. Information Systems Security, vol. 1, issue 1, 1998, pp. 66-92.

[Ria2002] A. Riabov, Z. Liu, J. L. Wolf, P. S. Yu, and L. Zhang, "Clustering algorithms for content-based publication-subscription systems," In Proc. of the 22nd IEEE International Conference on Distributed Computing Systems, July 2002.

[Roa2002] A. B. Roach, Session Initiation Protocol (SIP)-Specific Event Notification, IETF RFC 3265, June 2002.

[Rob2002] S. Robinson, "Beyond Reed-Solomon: New Codes for Internet Multicasting Drive Silicon Valley Start Up," SIAM News, vol. 35, no. 4, May 2002.

[Ros2002] J. Rosenberg, H. Schulzrinne, G. Camarillo, A. Johnston, J. Peterson, R. Sparks, M. Handley and E. Schooler, SIP: Session Initiation Protocol, IETF RFC 3261, June 2002.

[Row2001] A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems," In Proc. of Middleware 2001, Springer, Nov. 2001, pp. 329–250.

[Rya2001] P. Ryan, S. Schneider, M. Goldsmith, G. Lowe, and B. Roscoe, Modelling and Analysis of Security Protocols, Addison Wesley, 2001.

[Sal1984] J. H. Saltzer, D. P. Reed and D. D. Clark, "End-to-End Arguments in System Design," ACM Transactions on Computer Systems, vol. 2, issue 4, Nov. 1984, pp. 277-288.

[Sam1998] P. Samarati and L. Sweeney, "Protecting Privacy when Disclosing Information: k-Anonymity and Its Enforcement through Generalization and Suppression," Proc. IEEE Symposium on Research in Security and Privacy, 1998.

[Sco2006] J. Scott, P. Hui, J. Crowcroft, and C. Diot, "Haggle: A Networking Architecture Designed Around Mobile Users," IFIP WONS 2006, Les Menuires, France, 2006.

[Sha1976] G. Shafer, A mathematical theory of evidence, Princeton University Press, Princeton, NJ, 1976.

[She1995] S. Shenker, "Some fundamental design decisions for the future Internet," IEEE Journal on Selected Areas in Communications, vol. 13, 1995, pp. 1176-1188.

[She2008] R. Sherwood, A. Bender and N. Spring, "DisCarte: A Disjunctive Internet Cartographer", Proceedings of ACM SIGCOMM'08, Aug. 2008.

[Sho2001] P. Sholtz, "Transaction Costs and the Social Cost of Online Privacy," First Monday, vol. 6, no. 5, May 2001.

[Skl2001] B. Sklar, Digital Communications: Fundamentals and Applications, Second Edition, Chapter 8, Prentice Hall PTR, 2001, pp. 437-461.

[Sol2007] K. Sollins and D. Trossen, "From Visions to Understanding," presentation to the Communications Futures Program, 2007.

[Spr2004] N. Spring, R. Mahajan, D. Wetherall and T. Anderson, "Measuring ISP topologies with Rocketfuel," IEEE/ACM Transactions on Networking, vol.12, no.1, pp. 2-16, Feb. 2004.

[Sri2005] M. Srivatsa and L. Liu, "Securing publish-subscribe overlay services with EventGuard," Proc. of the 12th ACM conference on Computer and communications security, Nov. 2005.

[Ste2000] R. Stewart, Q. Xie, K. Morneault, C. Sharp, H. Schwarzbauer, T. Taylor, I. Rytina, M. Kalla, L. Zhang, and V. Paxson. Stream Control Transmission Protocol, IETF RFC 2960, Oct. 2000.

[Sto2001] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, ACM Press, 2001, pp. 149-160.

[Sto2002] I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana, "Internet indirection infrastructure," In Proc. of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, ACM Press, New York, NY, USA, 2002, pp 73-86.

[Sto2004] K. Lakshminarayanan, I. Stoica, S. Shenker, and J. Rexford, Routing as a Service, Tech. Rep. UCB-CS-04-1327, UC Berkeley, 2004.

[Sur2004] J. Surowiecki, The Wisdom of Crowds: Why the Many Are Smarter Than the Few and How Collective Wisdom Shapes Business, Economies, Societies and Nations, Random House, June 2004.

[Swe2002] L. Sweeney, "k-Anonymity: A Model for Protecting Privacy," Int’l J. Uncertainty, Fuzziness, and Knowledge-Based Systems, vol. 10, no. 5, 2002, pp. 557-570.

[Syv2001] P. Syverson and I. Cervesato, "The Logic of Authentication Protocols," Lecture Notes in Computer Science, vol. 2171, 2001, pp. 63–136.

[Tan2004] A. Tanner and G. Mühl, A Formalisation of Message-Complete Publish/Subscribe Systems, Technical Report, Berlin University of Technology, Nov. 2004.

[Tar2006a] S. Tarkoma, "Efficient Content-based Routing, Mobility-aware Topologies, and Temporal Subspace Matching," doctoral dissertation, Dept. of Computer Science, Univ. of Helsinki, Apr. 2006.

[Tar2006b] S. Tarkoma, "Preventing Spam in Publish/Subscribe," Distributed Computing Systems Workshops, 2006.

[Tar2007] S. Tarkoma and J. Kangasharju, "On the cost and safety of handoffs in content-based routing systems," Computer Networks, vol. 51, no. 6. Apr. 2007.

[Tha1999] F. J. Thayer, "Strand Spaces: Proving Security Protocols Correct," Journal of Computer Security, vol. 7, issue 2-3, Jan. 1999, pp.191-230.

[Tho2001] M. Thorup and U. Zwick, "Compact routing schemes," In Proc. Thirteenth annual ACM symposium on Parallel algorithms and architectures, 2001, pp. 1-10.

[Tri2008a] Trilogy FP7 project [online], 2008, available at: http://www.trilogy-project.org/ [Accessed 19th June 2008].

[Tri2008b] S. Schuetz (ed), "D2 - Lessons in ’Designing for Tussle’ from Case Studies," Trilogy FP7 project [online], 2008, available at: http://www.trilogy-project.org/ [Accessed 19th June 2008].

[Tro2007] D. Trossen, "The Sky is Falling or at least it is creaking," presentation at PIMRC, 2007.

[Tur2004] D. A. Turner and K. W. Ross, "A Lightweight Currency Paradigm for the P2P Resource Market," International Conference on Electronic Commerce Research, 2004.

[edit] U - Z

[Vai2008] C. Vaishnav, Does Technology Disruption Always Mean Industry Disruption?, International Conference of System Dynamics Society, July 2008 Media:ICSDS_2008_Vaishnav.pdf.

[Wai1998] D. Waitzman, C. Partridge, and S. Deering, Distance Vector Multicast Routing Protocol, IETF RFC 1075, Nov. 1998.

[Wal2000] M. Waldman, A. Rubin, and L. Cranor, "Publius, A robust, tamper-evident, censorship-resistant web publishing system," in Proc. of the 9th USENIX Security Symposium, Aug. 2000.

[Wal2004] M. Walfish, J. Stribling, M. Krohn, H. Balakrishnan, R. Morris, and S. Shenker, "Middleboxes No Longer Considered Harmful," In Proc. 6th USENIX OSDI, San Francisco, USA, Dec. 2004.

[Wal2005] M. Walfish, H. Balakrishnan, D. Karger, and S. Shenker, "DoS: Fighting fire with fire," In Proc. of the 4th ACM Workshop on Hot Topics in Networks (HotNets), 2005.

[Wan2002] C. Wang, A. Carzaniga, D. Evans, and A. L. Wolf, "Security issues and requirements in internet-scale publish-subscribe systems," in Proc. of the 35th Annual Hawaii International Conference on System Sciences (HICSS’02), Big Island, HI, USA, 2002.

[Web1978] M. Weber, Economy and society, Berkeley: University of California Press, 1968/1978.

[Wei2007] D. J. Weitzner, H. Abelson, T. Berners-Lee, J. Feigenbaum, J. Hendler, and G. J. Sussman, Information Accountability, Technical Report, Massachusetts Institute of Technology (MIT), June 2007.

[Wic1999] S. B. Wicker and V. K. Bhargava, Reed-Solomon Codes and their Applications, Chapter 1, IEEE Press, 1999, pp. 1-17.

[Wit2001] Wittbrodt, B. Woodcock, A. Ahuja, T. Li, V. Gill, and E. Chen, "Global routing system scaling issues," NANOG Panel [online], Feb. 2001, available at: http://www.nanog.org/mtg-0102/witt.html.

[Woo1993] T. Y. C. Woo and S. S. Lam, "A Semantic Model for Authentication Protocols," Proc. IEEE Symposium on Security and Privacy, 1993.

[Wu2006] B. Wu, J. Chen, J. Wu, and M. Cardei, "A Survey on Attacks and Countermeasures in Mobile Ad Hoc Networks", Wireless/Mobile Network Security, Y. Xiao, X. Shen, and D.-Z. Du (Eds.), Springer, 2006.

[Wun2007] A. Wun, A. Cheung, and H.A. Jacobsen, "A taxonomy for denial of service attacks in content-based publish/subscribe systems," Proc. of the 2007 International Conference on Distributed event-based systems, 2007.

[Xyl2008] G. Xylomenos, V. Vogkas and G. Thanos, "The Multimedia Broadcast / Multicast Service," Wireless Communications and Mobile Computing, vol. 8, no. 2, 2008, pp. 255-265.

[Yah1993] R. Yahalom, B. Klein, and T. Beth, "Trust Relationships in Secure Systems-A Distributed Authentication Perspective," Proc. of the 1993 IEEE Symposium on Security and Privacy, 1993, p. 150.

[Yah1994] R. Yahalom, B. Klein, and T. Beth, "Trust-based navigation in distributed systems," Computing Systems, vol. 7, issue 1, 1994, pp. 45-73.

[Yan2006] X. Yang, G. Tsudik, and X. Liu, "A Technical Approach to Net Neutrality," In Proc. ACM SIGCOMM HotNets Workshop, 2006.

[Yan2007] X. Yang, D. Clark, and A. Berger, "NIRA: A New Inter-Domain Routing Architecture," IEEE/ACM Transactions on Networking, vol. 15, no. 4, Aug. 2007, pp. 775-788.

[Yan2008] Y. Yang, J. Want, and M. Yang, "A Service-Centric Multicast Architecture and Routing Protocol," IEEE Transactions on Parallel and Distributed Systems, vol. 19, issue 1, Jan. 2008, pp. 35-51.

[Zha2001] B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing, Technical report, UC Berkeley, Apr. 2001.

[Zha2003] B. Zhang and H. T. Mouftah, "Forwarding state scalability for multicast provisioning in IP networks," IEEE Communications, vol. 41, no. 6, 2003, pp. 46-51.