Open resource allocation for mobile code

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1219, Issue , 1997, Pages 186-197

  Tschudin, Christian F ^a,b  

^a UNIVERSITY OF ZURICH   (Switzerland)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Communication messengers; Computational ecosystems; Market; Mobile code; Open resource allocation

Indexed keywords

CODES (SYMBOLS); COMMERCE; MARKETING; RESOURCE ALLOCATION;

COMPUTATIONAL ECOSYSTEMS; FOREIGN CODES; MOBILE CODE TECHNOLOGY; MOBILE CODES; RUNNING SYSTEMS; SATURATION POINT; STANDARDIZATION PROCESS; UTILIZATION OF RESOURCES;

MOBILE AGENTS;

EID: 0011875260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62803-7_16     Document Type: Conference Paper

References (14)

1. D. E Ferguson, C. Nikolaou, and Y. Yemini. An economy for flow control in computer networks. In Proceedings of the IEEElnfocom-89 pages 110-118 1989.
2. B A, Huberman, editor. The Ecology of Computation. Elsevier, 1988.
3. Bemardo A. Hubermann, Computation as economics. Presentation at the Second International Conference in Economics and Finance. URL: http://www.unige.ch/ce/ce96/ps/huberman.eps, June 1996.
4. V. Jacobson. Congestion avoidance and control. In S1GCOMM'88 Conference on CommunicationsArchitectures & Protocols pages 314-329 August 1988.
5. Guy Neuschwander. Exécution du code natif dans l'environnement MOS. Diploma thesis, University of Geneva, November 1996.
6. J. Sairamesh, D. E Ferguson, and Y. Yemini. An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networks. In Proceedings of the 1EEE Infocom'95 pages 1111-1119 1995.
7. J. W. Stamos and D. K. Gifford. Remote Evaluation. ACMTPLS 12(4) 1990, pages 537-565.
8. I. E. Sutherland. A futures market in computer time. CACM, 11 (6), 1968.
9. Chr. F. Tschudin. Minimality as the Leitmotiv for mobile code. Presentation at the 2nd German Workshop on Mobile Agents (DeMAT-II). http://www.ifi.unizh.ch/groups/bauknecht/tschudin/research/demat96-eng.ps.gz, September 1996.
10. Chr. F Tschudin, G. Di Marzo, M. Murhimanya, and J. Harms. Welche Sicherheit fiJr mobile Code? In K. Bauknecht, D. Karangiannis, and S. Teufel, editors, Proceedings der Fachtagung SIS'96 Sicherheit in Informationssystemen, pages 291-307, Vienna, March 1996. English abstract: http://www.ifi.unizh.ch/groups/bauknecht/tschudin/research/sis96-abstract.html.
11. Christian E Tschudin. On the Structuring of Computer Communications. PhD thesis, Université de Genève, 1993. Thèse No 2632. ftp://cui.unige.ch/pub/tschudin/phd-{123}ps.Z.
12. Christian F. Tschudin. MO-a messenger execution environment. Usenet newsgroup comp. sources, unix, Vol 28, Issue 51-62, June 1994. ftp://cui.unige.ch/pub/m0/m0-manual.ps.Z
13. C. A. Waldspurger, T. Hogg, B. A. Hubermann, J. O. Kephart, and W. S. Stometta. Spawn: a distributed computational economy. IEEE Transactions on Software Engineering, 18(2): 103-117, February 1992.
14. Carl. A. Waldspurger and William E. Weihl. Lottery scheduling: Flexible proportional-share resource management. In First Symposium on Operating System Design and Implementation (OSDI), USENIX Association, pages 11, 1994.