A QoS performance measure framework for distributed heterogeneous networks

Providing up-to-date input to users' applications is an important data management problem for a heterogeneous distributed computing environment, where each data storage location and intermediate node may have different data available, storage limitations, and communication links available. Sites in the heterogeneous network request data items and each request has an associated deadline and priority. In a military situation, the data staging problem involves positioning data for facilitating a faster access time when it is needed by programs that will aid in decision making. This work concentrates on solving a basic version of the data staging problem in which all parameter values for the communication system and the data request information represent the best known information collected so far and stay fixed throughout the scheduling process. The heterogeneous network is assumed to be oversubscribed and not all requests for data items can be satisfied. Three multiplesource shortest-path algorithm based procedures for finding a near-optimal schedule of the communication steps for staging the data are described. Each procedure can be used with each of three cost criteria developed here (based on results from earlier experiments). A subset of the possible procedure/cost criterion combinations are evaluated in simulation studies considering different priority weighting schemes, different average number of links used to satisfy each data request, and different network loadings. The proposed heuristics are shown to perform well with respect to upper and lower bounds.

show abstract

Evaluation of expanded heuristics in a heterogeneous distributed data staging network

Theys

Beck

Siegel

et al.

Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)

Self Cite

View full text Add to dashboard Cite

show abstract

Toward quality of security service in a resource management system benefit function

Irvine

Levin

Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556)

View full text Add to dashboard Cite

Enforcement of a high-level statement of security policy may be difficult to discern when mapped through functional requirements to a myriad of possible security services and mechanisms in a highly complex, networked environment. A method for articulating network security functional requirements, and their fulfillment, is presented. Using this method, security in a quality of service framework is discussed in terms of "variant" security mechanisms and dynamic security policies. For illustration, it is shown how this method can be used to represent Quality of Security Service (QoSS) in a network scheduler benefit function 1 .

show abstract

A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests

Dharwadkar

Siegel²,

Chong³

Proceedings 21st International Conference on Distributed Computing Systems

Self Cite

View full text Add to dashboard Cite

Bandwidth allocation is a fundamental problem in communication networks. The problem of bandwidth allocation is further intensified when the requested bandwidth exceeds the available unused bandwidth and so not all requests can be completely served. This research examines on-line bandwidth allocation, where the decision for acceptance or rejection of the request has to be made when future requests and their arrival statistics are not known. A request can be defined as a flow of information from a source to a destination with a certain amount of bandwidth, a priority level, a utility function that is based on the bandwidth received, and a worth that is based on the utility function and the priority level. The goal of this research is to develop a scheduling heuristic for an overloaded system that attempts to schedule the requests such that the sum of the worths of the requests satisfied in a fixed interval of time is the maximum. The scheduling heuristic can preempt or degrade already-scheduled requests. Three difSerent types of utility functions (step, linear, and concave) are examined. Other parameters being considered include network loading and the relative weights of the different priority levels. The heuristic variations developed are shown to perform well compared to a complete sharing policy and an upper bound.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A QoS performance measure framework for distributed heterogeneous networks

Abstract: In a distributed heterogeneous computing environment, users' tasks

Cited by 10 publications

References 25 publications

Evaluation of expanded heuristics in a heterogeneous distributed data staging network

Evaluation of expanded heuristics in a heterogeneous distributed data staging network

Toward quality of security service in a resource management system benefit function

A heuristic for dynamic bandwidth allocation with preemption and degradation for prioritized requests

Contact Info

Product

Resources

About