An Efficient Scheme for Aggregation and Presentation of Network Performance

The Internet is presently being used to support increasingly complex interaction models as a result of more and more applications, services and frameworks becoming network centric. Efficient utilization of network and networked resources is of paramount importance. Network performance gathering is a precursor to any scheme that seeks to provide adaptive routing capabilities for interactions. In this paper we present a network performance aggregation framework that is extensible and appropriate for distributed messaging systems that span multiple realms, disparate communication protocols and support different applications

A Portal Based Approach to Viewing Aggregated Network Performance Data in Distributed Brokering Systems

this paper, we present a scheme to view aggregated performance information inside a portal and specify constraints on the accumulated performance information to detect network conditions, based on specified thresholds on measured performance factors. This information would then be used to work around network bottlenecks and also be used to drive heuristics for generating optimal routes (and transport protocols deployed) to reach a set of computed destinations. The scheme that we have prototyped in our current work provides for detection of network conditions. The remedial measures that are initiated are currently based on static techniques. We suggest that this work is a precursor to a dynamically responsive system. This work builds upon our previous work [1] involving the design of a framework for aggregation network performance. The investigations that we report in this paper are in the context of NaradaBrokering [2-10] a distributed brokering syste