Abstract
The previous chapter looked at cloud computing from a client’s perspective. Late in the discussion we touched on one of the ways that cloud computing is forcing the Internet itself to evolve. In this chapter, we will say more about that topic. Dominant at the network level are issues stemming from the need of the cloud to control routing and maintain a seamlessly connected client experience even as a client system may be moving about, changing IP addresses and coping with potentially significant changes in connection quality, routing, DNS mapping and other properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Network address translators and firewalls often allow connections to be established in just one direction: from the “inner” network towards the external one. Thus, from Gimme! Coffee in Ithaca, my laptop can connect to a server at Amazon.com, but were Amazon.com to try and connect to my laptop, that second option would not work. It should be easy to see why this happens: although my machine has a unique IP address assigned by the DHCP protocol within the Gimme! wireless network, from the outside, all of the machines currently in use at Gimme! seem to share a single IP address, namely that assigned to Gimme! by the ISP from which the coffee shop gets its network connectivity. For connections from my machine to Amazon, all of this poses no issue at all: my machine picks a port number and tries to connect to Amazon, and the Gimme! wireless router simply replaces my IP address with its own IP address, and my port number with one it selects to be unique. When packets come back from Amazon, it does the reverse translation. But in contrast, had Amazon tried to connect to me directly, the connection establishment packets would have the IP address of Gimme!’s wireless router (or perhaps, firewall) in them, and the port number would seem to identify a service running on the router, not on my machine within the wireless subnetwork. Thus, short of assigning a static IP address and port range to my machine and somehow exposing that address to the outside world, incoming connections cannot be supported because the wireless router will not know what to do with them. There have been some proposals to work around this limitation, but to date, none has been widely adopted by the Internet community.
- 2.
This could be an IPv4 address or an IPv6 address; one hears a great deal of discussion about the two as if they were dramatically different standards, but in fact as currently defined, the only major difference is that IPv6 addresses are twice as long as IPv4 addresses. In particular, routing algorithms and routers are essentially unchanged by the move towards IPv6.
References
Agapi, A., Birman, K., Broberg, R., Cotton, C., Kielmann, T., Millnert, M., Payne, R., Surton, R., van Renesse, R.: Routers for the cloud: Can the Internet achieve 5-nines availability? IEEE Internet Comput. 15(5), 72–77 (2011)
Aguilera, M.K., Strom, R.E., Sturman, D.C., Astley, M., Chandra, T.D.: Matching events in a content-based subscription system. In: 18th ACM Symposium on Principles of Distributed Computing (PODC), Atlanta, GA (1999)
Balakrishnan, H., Katz, R.H., Padmanbhan, V.N.: The effects of asymmetry on TCP performance. Mob. Netw. Appl. 4(3), 219–241 (1999)
Balakrishnan, M., Marian, T., Birman, K., Weatherspoon, H., Vollset, E.: Maelstrom: Transparent error correction for lambda networks. In: NSDI 2008: Fifth Usenix Symposium on Networked Systems Design and Implementation, April 2008
Birman, K.P.: The league of SuperNets. IEEE Internet Comput. 7(5), 93–96 (2003)
Birman, K.P., Joseph, T.A.: Exploiting virtual synchrony in distributed systems. In: Proceedings of the Eleventh Symposium on Operating Systems Principles, Austin, November 1987, pp. 123–138. ACM Press, New York (1987a)
Broder, A.Z., Frieze, A.M., Upfal, E.: Static and dynamic path selection on expander graphs: A random walk approach. J. Random Struct. Algorithms 14(1), 87–109 (1999)
Carzaniga, A., Rosenblum, D., Wolf, A.: Design and evaluation of a wide-area event notification service. ACM Trans. Comput. Syst. 19(3) (2001)
Comer, D.E.: Internetworking with TCP/IP. Principles, Protocols, and Architecture, vol. I. Prentice Hall, Englewood Cliffs (1991)
Comer, D.E., Stevens, D.L.: Internetworking with TCP/IP. Client/Server Programming and Applications, vol. III. Prentice Hall, Englewood Cliffs (1993)
Freedman, D., Marian, T., Lee, J.H., Birman, K., Weatherspoon, H., Xu, C.: Exact temporal characterization of 10 Gbps optical wide-area network. In: Proceedings of the 10th ACM SIGCOMM Internet Measurement Conference (IMC), Melbourne, Australia, November 2010
Gupta, I., Birman, K.P., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: Proc. 2nd International Workshop on Peer-to-Peer Systems (IPTPS ’03), Oakland, CA (2003)
Jelasity, M., Babaoglu, O.: T-Man: Gossip-based overlay topology management. In: European Workshop on Engineering Self-organising Systems, pp. 1–15 (2005)
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. Trans. Comput. Syst. 25(3) (2007)
Jelasity, M., Montresor, A., Babaoglu, O.: T-Man: Gossip-based fast overlay topology construction. Comput. Netw. 53(13) (2009)
Johansen, H., Allavena, A., van Renesse, R.: Fireflies: Scalable support for intrusion-tolerant network overlays. In: Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006 (EuroSys ’06), pp. 3–13. ACM, New York (2006)
Kermarrec, A.M., Pace, A., Quéma, V., Schiavoni, V.: NAT-resilient gossip peer sampling. In: Proceedings of the International Conference on Distributed Computing Systems (ICDCS), Montreal, Canada, June 2009, pp. 360–367 (2009)
Kleinberg, J.: Navigation in a small world. Nature 406, 845 (2000a)
Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: Proc. 32nd ACM Symposium on Theory of Computing (2000b). Also appears as Cornell Computer Science Technical Report 99-1776 (October 1999)
Kleinberg, J.: Small-world phenomena and the dynamics of information. Adv. Neural Inf. Process. Syst. 14 (2001)
Kleinberg, J.: The small-world phenomenon and decentralized search. A short essay as part of Math Awareness Month 2004. SIAM News 37(3) (2004)
Oki, B., Pfluegl, M., Siegel, A., Skeen, D.: The information bus-an architecture for extensible distributed systems. In: Proceedings of the Thirteenth ACM Symposium on Operating Systems Principles, Asheville, NC, December 1993, pp. 58–68. ACM Press, New York (1993)
Schneider, F.B., Walsh, K., Sirer, E.G.: Nexus authorization logic (NAL): Design rationale and applications. ACM Trans. Inf. Syst. Secur. 14(1), 8 (2011). 28 pages
Shieh, A., Sirer, E.G., Schneider, F.B.: NetQuery: A knowledge plane for reasoning about network properties. In: Proceedings of the ACM SIGCOMM 2011 Conference on SIGCOMM (SIGCOMM ’11), pp. 278–289. ACM, New York (2011)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: ACM SIGCOMM 2001, San Diego, CA, August 2001, pp. 149–160 (2001)
Strom, R.E., Banavar, G., Chandra, T.D., Kaplan, M., Miller, K., Mukherjee, B., Sturman, D.C., Ward, M.: Gryphon: An information flow based approach to message brokering. CoRR (1998)
Voulgaris, S., van Steen, M.: Epidemic-style management of semantic overlays for content-based searching. In: Euro-Par 2005, pp. 1143–1152 (2005)
Voulgaris, S., Kermarrec, A.M., Massoulié, L., van Steen, M.: Exploiting semantic proximity in peer-to-peer content searching. In: FTDCS 2004, pp. 238–243 (2004)
Voulgaris, S., van Steen, M., Iwanicki, K.: Proactive gossip-based management of semantic overlay networks. Concurr. Comput. 19(17), 2299–2311 (2007)
Wang, Y., Keller, E., Biskeborn, B., van der Merwe, J., Rexford, J.: Virtual routers on the move: Live router migration as a network-management primitive. In: Proc. ACM SIGCOMM, August 2008
Zagorodnov, D., Marzullo, K., Alvisi, L., Bressoud, T.C.: Practical and low-overhead masking of failures of TCP-based servers. ACM Trans. Comput. Syst. 27(2) (2009)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag London Limited
About this chapter
Cite this chapter
Birman, K.P. (2012). Network Perspective. In: Guide to Reliable Distributed Systems. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-2416-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2416-0_4
Publisher Name: Springer, London
Print ISBN: 978-1-4471-2415-3
Online ISBN: 978-1-4471-2416-0
eBook Packages: Computer ScienceComputer Science (R0)