The increased complexity of the service model relative to store-and-forward routers, has made resource management one of the paramount concerns in active networking research and engineering. Previous work investigated methods for controlling access to resources by restricting namespaces or providing limited functionality in a domain-specific language. Combinations of these methods and scheduling technologies have also been used to demonstrate a resource-managed node architecture. In this paper, we address Two major challenges in scaling resource management to many-node active networks. The first is the use of market mechanisms and trading amongst nodes and programs with varying degrees of competition and cooperation to provide a scalable approach to managing active network resources. The second is the use of a trust-management architecture to ensure that the participants in the resource management marketplace have a policy-driven “rule of law” in which marketplace decisions can be made and relied upon. We have used lottery scheduling and the Keynote trust-management system for our implementation, for which we provide some initial performance indications.

[ .ps ]

@inproceedings{AnagnostakisHIKS00,
  author = {Kostas G. Anagnostakis and Michael W. Hicks and Sotiris Ioannidis and Angelos D. Keromytis and Jonathan M. Smith},
  title = {Scalable Resource Control in Active Networks},
  booktitle = {Proceedings of the Second International Working Conference on
Active Networks (IWAN)},
  month = {October},
  year = 2000,
  publisher = {Springer-Verlag},
  editor = {Hiroshi Yashuda},
  series = {Lecture Notes in Computer Science},
  volume = 1942,
  pages = {343--358}
}

This file was generated by bibtex2html 1.99.