Active resource allocation in active networks

A central premise of active networking is that small amounts of user-specific computation inserted at key locations within the network can significantly improve network-based application performance. Hence, a critical issue for active networking is the amount of resources required to achieve performance gains since excessive demands on scarce node resources can have detrimental effects on the entire network. We explore the trade-space between active resource utilization and performance, and attempt to provide insights into where limited active resources should be located within a given network topology in order to optimize performance. Simulation experiments based on performance assessments of the active error recovery/nominee-based congestion algorithm (AER/NCA) protocol-an active networks-based reliable multicast protocol-reveal that a high percentage of the achievable performance gains can be attained with only a small number of optimally selected network nodes providing active services. Further experiments show that an early algorithm for dynamically activating-deactivating active services within the network can achieve a significant portion of the gains afforded by an optimal, static configuration. The implication here is that this or similar algorithms hold significant promise as a means for active networks to dynamically self-optimize active resource allocation.