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.
In the research of composite service execution, runtime QoS ensuring of composite service is an important problem in composite service adaptation. This paper gives an introduction to the design and implementation of composite service adaptive execution supported environment monitoring system, analyzes the crucial problem of the system, builds up an experiment environment to test the monitoring system...
Motivated by providing quality-of-service for next generation IP-based networks, we design algorithms to schedule packets with values and deadlines. Packets arrive over time; each packet has a non-negative value and an integer deadline. In each time step, at most one packet can be sent. Packets can be dropped at any time before they are sent. The objective is to maximize the total value gained by...
Though plenty of research has been conducted to improve Internet P2P streaming quality perceived by end-users, little has been known about the upper bounds of achievable performance with available resources so that different designs could compare against. On the other hand, the current practice has shown increasing demand of server capacities in P2P-assisted streaming systems in order to maintain...
We consider online scheduling weighted packets with time constraints over a fading channel. Packets arrive at the transmitter in an online manner. Each packet has a value and a deadline by which it should be sent. The fade state of the channel determines the throughput obtained per unit of time and the channel's quality may change over time. In this paper, we design online algorithms to maximize weighted...
Motivated by providing differentiated services on the Internet, we consider efficient online algorithms for buffer management in network switches. We study a FIFO buffering model, in which unit-length packets arrive in an online manner and each packet is associated with a value (weight) representing its priority. The order of the packets being sent should comply with the order of their arriving time...
We consider scheduling weighted packets with time constraints over a fading channel. Packets arrive in an online manner. Each packet has a value and a hard deadline by which it should be sent. The fade state of the channel determines the throughput obtained per unit of time and the channel's quality may change over time. In this paper, we design both offline and online algorithms to maximize weighted...
Motivated by providing differentiated services on the Internet, we consider efficient algorithms for buffer management in quality-of-service (QoS) routers. We study a FIFO buffering model with fairness constraint, in which packets have values to represent their priorities. The order of packets being sent complies with the order of their arriving time. Fairness is enforced such that the dropping rate...
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.