The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper addresses a H∞ TCP controller for end-to-end TCP congestion control. The proposed controller which is based on the algorithm of TCP Vegas is aimed to minimize error term in TCP Vegas and achieve one step optimal solution for TCP congestion control. A series of simulation experiments based on a single bottle-neck FIFO queue model are conducted to compare the new controller with TCP Vegas...
This paper presents a design procedure for access and congestion control in communication networks. Motivated by an analysis of the characteristics of communication networks, the proposed approach makes use of model-based control methodologies, i.e. Internal Model Control, Model Reference Control and the Smith's principle. The design procedure is then applied to the problems of access control in satellite...
This paper analyzes an economic model of congestion control for a communication network The model consists of the userspsila utility functions and the functions of userspsila sensitivity to delay. It applies the concept of marginal-cost pricing to analyze the global optimality of the system. From the analysis, it shows that the interior point is not the global optimal point when the userspsila utility...
We present a framework for designing delay- independent end-to-end congestion control algorithms, where each end-user may have a different utility function. We only require that utility functions are strictly increasing. In this framework, we design an algorithm that maximizes the minimum utility value in the network, that is, the resulting resource allocation is utility max-min fair. To achieve this,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.