| 1. |
- Holmberg, Torgny, et al.
(författare)
-
Scheduling deadline driven packet flows in HiperAccess
- 2003
-
Ingår i: Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003. - 076951961X ; , s. 108-113
-
Konferensbidrag (refereegranskat)abstract
- Wireless communication systems are by nature and by regulations limited in bandwidth and hence capacity. Services with high demands on quality of service (QoS) will enforce high demands on the available capacity. This observation motivates the development of schedulers that can deliver the required QoS as well as being resource efficient. In this paper, we provide expressions of the worst case delivery time for schedulers based in the first in first out (FIFO) and the earliest due-date (EDD) principles which are applied to the HiperAccess point-to-multipoint radio communication system. Further, we propose modifications of the schedulers, which are more resource efficient at the expense of rare deadline misses. Despite the deadline misses, the modified scheduling algorithms can still provide an average delivery time well within the required deadline
|
|
| 2. |
- Karlsson, Johan, et al.
(författare)
-
Extended expedited forwarding : the in-time PHB group
- 2003
-
Ingår i: Computers and Communication, 2003. (ISCC 2003). - : IEEE Computer Society Press. - 076951961X ; , s. 291-298
-
Konferensbidrag (refereegranskat)abstract
- This paper presents a new set of forwarding behaviorsthat fits rate-adaptive and delay-sensitive applications withlimited loss tolerance. We consider an application to havelimited loss tolerance if it needs loss-free forwarding of specificpackets up to a certain rate. The new set of forwardingbehaviors are attractive for developing real-time applicationsfor the Internet. In particular, such applications canbe designed to use reserved forwarding capacity efficientlyand compete for more bandwidth while being fair to best-efforttraffic. To provide the new set of forwarding behaviors,we define a scheduling mechanism that can be implementedefficiently. Through simulations, we show that thismechanism supports the defined forwarding behaviors.
|
|
| 3. |
- Kihl, Maria, et al.
(författare)
-
Analysis of admission control mechanisms using non-linear control theory
- 2003
-
Ingår i: Proceedings of the 8th IEEE International Symposium on Computers and Communication. Vol. 2. - 076951961X ; , s. 1306-1311
-
Konferensbidrag (refereegranskat)abstract
- All service control nodes can be modelled as a server system with one or more servers processing incoming requests. In this paper we show how non-linear control theory may be used when analyzing admission control mechanisms for server systems. Two models are developed, one linear and one non-linear. We show that, due to the non-linearities appearing in a real server system, linear control theory is sufficient when designing controllers for these systems. With non-linear analysis, however, the dynamics of a server system may be analysed and taken care of by choosing the controller parameters appropriately.
|
|
| 4. |
- Pioro, Michal, et al.
(författare)
-
On efficient max-min fair routing algorithms
- 2003
-
Ingår i: Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003. - Antalya : IEEE conference proceedings. - 076951961X ; , s. 365-372
-
Konferensbidrag (refereegranskat)abstract
- In the paper, we consider the problem of routing and bandwidth allocation in networks that support elastic traffic. We assume that the bandwidth demand between each source-destination (S-D) pair is specified in terms of a minimum and maximum value, and a set of flows between each S-D pair is allowed to realize these demands. (We say that a set of flows realizes the demand associated with an S-D pair, if the sum of the bandwidths allocated to these flows is greater than the minimum value assumed for the demand of that S-D pair). In this setting, we show that routing and bandwidth allocation can be formulated as an optimization problem, where network utilization is to be maximized under capacity and the widely used max-min fairness constraints. We describe three different algorithms to solve variants of this problem. The most important one, an efficient, original algorithm assuming multipath routing is studied in detail and illustrated with a numerical example
|
|
