The proposed scheme has been simulated and shown to be globally efficient, fair, responsive, conv... more The proposed scheme has been simulated and shown to be globally efficient, fair, responsive, convergent, robust, distributed, and configuration-independent.
Fairness is an important performance criterion in all resource allocation schemes, including thos... more Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitatively. The quantitative measures proposed in the literature are either too specific to a particular application, or suffer from some undesirable characteristics. In this paper, we have introduced a quantitative measure called Indiex of FRairness. The index is applicable to any resource sharing or allocation problem. It is independent of the amount of the resource. The fairness index always lies between 0 and 1. This boundedness aids intuitive understanding of the fairness index. For example, a distribution algorithm with a fairness of 0.10 means that it is unfair to 90% of the users. Also, the discrimination index can be defined as 1 - fairness index.
Congestion is said to occur in the network when the resource demands exceed the capacity and pack... more Congestion is said to occur in the network when the resource demands exceed the capacity and packets are lost due to too much queuing in the network. During congestion, the network throughput may drop to zero and the path delay may become very high. A congestion control scheme helps the network to recover from the congestion state. A congestion avoidance scheme allows a network to operate in the region of low delay and high throughput. Such schemes prevent a network from entering the congested state. Congestion avoidance is a prevention mechanism while congestion control is a recovery mechanism. We compare the concept of congestion avoidance with that of flow control and congestion control. A number of possible alternative for congestion avoidance have been identified. From these a few were selected for study. The criteria for selection and goals for these schemes have been described. In particular, we wanted the scheme to be globally efficient, fair, dynamic, convergent, robust, distributed, configuration independent, etc. These goals and the test cases used to verify whether a particular scheme has met the goals have been described. We model the network and the user policies for congestion avoidance as a feedback control system. The key components of a generic congestion avoidance scheme are: congestion detection, congestion feedback, feedback selector, signal filter, decision function, and increase/decrease algorithms. These components have been explained.
The authors compare the concept of congestion with that of flow control and congestion control. A... more The authors compare the concept of congestion with that of flow control and congestion control. A number of possible alternatives for congestion avoidance are identified. From these a few are selected for study. The criteria for selection and goals for these schemes are described. In particular, the authors wanted the scheme to be globally efficient, fair, dynamic, convergent, robust, distributed, configuration-independent, etc. They model the network and the user policies for congestion avoidance as a feedback control system. The key components of a generic congestion-avoidance scheme are congestion detection, congestion feedback, feedback selector, signal filter, decision function, and increase/decrease algorithms.>
The proposed scheme has been simulated and shown to be globally efficient, fair, responsive, conv... more The proposed scheme has been simulated and shown to be globally efficient, fair, responsive, convergent, robust, distributed, and configuration-independent.
Fairness is an important performance criterion in all resource allocation schemes, including thos... more Fairness is an important performance criterion in all resource allocation schemes, including those in distributed computer systems. However, it is often specified only qualitatively. The quantitative measures proposed in the literature are either too specific to a particular application, or suffer from some undesirable characteristics. In this paper, we have introduced a quantitative measure called Indiex of FRairness. The index is applicable to any resource sharing or allocation problem. It is independent of the amount of the resource. The fairness index always lies between 0 and 1. This boundedness aids intuitive understanding of the fairness index. For example, a distribution algorithm with a fairness of 0.10 means that it is unfair to 90% of the users. Also, the discrimination index can be defined as 1 - fairness index.
Congestion is said to occur in the network when the resource demands exceed the capacity and pack... more Congestion is said to occur in the network when the resource demands exceed the capacity and packets are lost due to too much queuing in the network. During congestion, the network throughput may drop to zero and the path delay may become very high. A congestion control scheme helps the network to recover from the congestion state. A congestion avoidance scheme allows a network to operate in the region of low delay and high throughput. Such schemes prevent a network from entering the congested state. Congestion avoidance is a prevention mechanism while congestion control is a recovery mechanism. We compare the concept of congestion avoidance with that of flow control and congestion control. A number of possible alternative for congestion avoidance have been identified. From these a few were selected for study. The criteria for selection and goals for these schemes have been described. In particular, we wanted the scheme to be globally efficient, fair, dynamic, convergent, robust, distributed, configuration independent, etc. These goals and the test cases used to verify whether a particular scheme has met the goals have been described. We model the network and the user policies for congestion avoidance as a feedback control system. The key components of a generic congestion avoidance scheme are: congestion detection, congestion feedback, feedback selector, signal filter, decision function, and increase/decrease algorithms. These components have been explained.
The authors compare the concept of congestion with that of flow control and congestion control. A... more The authors compare the concept of congestion with that of flow control and congestion control. A number of possible alternatives for congestion avoidance are identified. From these a few are selected for study. The criteria for selection and goals for these schemes are described. In particular, the authors wanted the scheme to be globally efficient, fair, dynamic, convergent, robust, distributed, configuration-independent, etc. They model the network and the user policies for congestion avoidance as a feedback control system. The key components of a generic congestion-avoidance scheme are congestion detection, congestion feedback, feedback selector, signal filter, decision function, and increase/decrease algorithms.>
Uploads
Papers by Raj Jain