Abstract
We believe that the problems of safety, security and resource usage combine to make it unlikely that programmable networks will ever be viable without mechanisms to transfer risk from the platform provider to the user and the programmer. However, we have well established mechanisms for managing risk – markets. In this paper we argue for the establishment of markets to manage the risk in running a piece of software and to ensure that the risk is reflected on all the stakeholders.
We describe a strawman architecture for third party computation in the programmable network. Within this architecture, we identify two major novel features:- Dynamic price setting, and a reputation service. We investigate the feasibility of these features and provide evidence that a practical system can indeed be built.
Our contributions are in the argument for markets providing a risk management mechanism for programmable networks, the development of an economic model showing incentives for developing better software, and in the first analysis of a real transaction graph for reputation systems from an Internet commerce site.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Schwartz, B., Jackson, A.W., Timothy Strayer, W., Zhou, W., Dennis Rockwell, R., Partbridge, C.: Smart packets: applying active networks to network management. ACM Transactions on Computer Systems 18(1), 67–88 (2000)
Volpano, D., Smith, G.: Language issues in mobile program security. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol. 1419, p. 25. Springer, Heidelberg (1998)
Alexander, D.: Alien: A Generalized Computing Model of Active Networks. PhD thesis, University of Pennsylvania (1998)
Kakkar, P., Hicks, M., Moore, J.T., Gunter, C.A.: Specifying the PLAN networking programming language. In: Higher Order Operational Techniques in Semantics, September 1999. Electronic Notes in Theoretical Computer Science, vol. 26, Elsevier, Amsterdam (1999)
Menage, P.: RCANE: A Resource Controlled Framework for Active Network Services. In: Covaci, S. (ed.) IWAN 1999. LNCS, vol. 1653, pp. 25–37. Springer, Heidelberg (1999)
Czajkowski, G., von Eicken, T.: JRes: A resource accounting interface for Java. In: Proceedings of OOPSLA 1998, pp. 21–35 (1998)
Leslie, I.M., McAuley, D., Black, R., Roscoe, T., Barham, P.T., Evers, D., Fairbairns, R., Hyden, E.: The design and implementation of an operating system to support distributed multimedia applications. IEEE Journal of Selected Areas in Communications 14(7), 1280–1297 (1996)
Morris, R., Kohler, E., Jannotti, J., Kaashoek, M.F.: The click modular router. In: ACM Symposium on Operating Systems Principles, Charleston, South Carolina, pp. 217–231. ACM Press, New York (1999)
Schmid, S., Chart, T., Sifalakis, M., Scott, A.: Flexible, dynamic and scalable service composition for active routers. In: Sterbenz, J.P.G., Takada, O., Tschudin, C.F., Plattner, B. (eds.) IWAN 2002. LNCS, vol. 2546, pp. 253–266. Springer, Heidelberg (2002)
Litzkow, M., Livny, M., Mutka, M.: Condor — a hunter of idle workstations. In: Proceedings of the Eighth Conference on Distributed Computing Systems, San Jose, California (June 1988)
Waldspurger, C.A., Hogg, T., Huberman, B.A., Kephart, J.O., Scott Stornetta, W.: Spawn: A distributed computational economy. Software Engineering 18(2), 103–117 (1992)
Amir, Y., Awerbuch, B., Borgstrom, R.S.: The java market: Transforming the internet into a metacomputer. Technical Report Technical Report CNDS-98-1, Johns Hopkins University (1998)
Buyya, R., Abramson, D., Giddy, J.: Nimrod/g: An architecture for a resource management and scheduling system in a global computational grid. In: Proceedings of the 4th International Conference on High Performance Computing in the Asia Pacific Region (May 2000)
Buyya, R., Abramson, D., Giddy, J., Stockinger, H.: Economic models for resource management and scheduling in grid computing. The Journal of Concurrency and Computation: Practice and Experience, CCPE ( May 2002)
Ferguson, D., Nikolaou, C., Sairamesh, J., Yemini, Y.: Economic models for allocating resources in computer systems. In: Market-Based Control: A Paradigm for Distributed Resource Allocation, World Scientific, Singapore (1996)
Gibbens, R.J., Kelly, F.P.: Resource pricing and the evolution of congestion control. Automatica 35, 1969–1985 (1999)
Cocchi, R., Shenker, S., Estrin, D., Zhang, L.: Pricing in computer networks: Motivation, formulation, and example. IEEE/ACM Transactions on Networking 1, (December 1993)
Cao, X.-R., Shen, H., Milito, R., Wirth, P.: Internet pricing with a game theoretical approach: Concepts and examples. IEEE/ACM Transactions on Networking 10, 208–216 (2002)
Varian, H.: Differential pricing and efficiency. First Monday 1(2) (August 1996)
Wooldridge, M.: Introduction to Multi Agent Systems. John Wiley & Sons, Chichester (2002)
Fu, K., Frans Kaashoek, M., Mazières, D.: Fast and secure distributed read-only file system. Computer Systems 20(1), 1–24 (2002)
Schneier, B.: Applied Cryptography: Protocols, Algorithms, 2nd edn. John Wiley & Sons, Chichester (1995)
Wakeman, I., Jeffrey, A., Owen, T., Pepper, D.: Safetynet: A language-based approach to programmable networks. Computer Networks and ISDN Systems 36(1) (June 2001)
Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)
Wakeman, I., Ellis, D., Owen, T., Rathke, J., Watson, D.: Risky business: Motivations for markets in programmable networks. Computer science technical report, University of Sussex (2003)
Gravelle, H., Rees, R.: Microeconomics, Longman (1992)
Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, New York, pp. 1–13 (2002)
Barabasi, A.-L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A 2272, 173–187 (1999)
Zacharia, G., Moukas, A., Maes, P.: Collaborative reputation systems in electronic marketplaces. In: Proceedings of the 32nd Hawaii International Conference on System Sciences (1999)
Cornelli, F., Damiani, E., De Capitani di Vimercati, S., Paraboschi, S., Samarati, P.: Choosing reputable servents in a p2p network. In: Proc. of the Eleventh International World Wide Web Conference, Honolulu, Hawaii (May 2002)
Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: Proceedings of the Twelfth International World Wide Web Conference (2003)
Adamic, L., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in powerlaw networks. Phys. Rev. E 64 (2001)
Kim, B.J., No Yoon, C., Han, S.K., Jeong, H.: Path finding strategies in scale-free networks. Physical Review E 65(027103) (2002)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, November 2001, pp. 329–350 (2001)
Reed, D., Pratt, I., Menage, P., Early, S., Stratford, N.: Xenoservers; accounted execution of untrusted code. In: IEEE Hot Topics in Operating Systems (HotOS) VII (March 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Wakeman, I., Ellis, D., Owen, T., Rathke, J., Watson, D. (2004). Risky Business: Motivations for Markets in Programmable Networks. In: Wakamiya, N., Solarski, M., Sterbenz, J. (eds) Active Networks. IWAN 2003. Lecture Notes in Computer Science, vol 2982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24715-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-24715-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21250-8
Online ISBN: 978-3-540-24715-9
eBook Packages: Springer Book Archive