| Presentation | 2005-12-15 A High-speed Method for Calculating Worst-case Link Delays in EDD Connection Admission Control Scheme : In the case that many connections with large allowable end-to-end delay are established Ryusuke MIYAKE, Tokumi YOKOHIRA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In order to calculate the worst-case link delays in the EDD (Earliest Due Date) connection admission control scheme, a check called the point schedulability check is necessary for each of finite and discrete time instants (checkpoints). In our previous calculation method, high speed calculation is attained by decreasing an upper bound value of checkpoints. However, the method can not calculate at high speed when many connections with large allowable end-to-end delays are established. The purpose of the paper is to improve the previous method. In this paper, we clarify that we do not have to execute the point schedulability check for an interval of checkpoints which are less than the upper bound value in the previous method, and based on the fact, high speed calculation can be attained. Numerical examples show that the proposed method drastically decreases the calculation time when many connections with large allowable end-to-end delays are established. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Real Time Communication / Quality of Service / Connection Admission Control / Earliest Due Date First Scheduling / Worst-case Link Delay |
| Paper # | NS2005-141 |
| Date of Issue |
| Conference Information | |
| Committee | NS |
|---|---|
| Conference Date | 2005/12/8(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Network Systems(NS) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A High-speed Method for Calculating Worst-case Link Delays in EDD Connection Admission Control Scheme : In the case that many connections with large allowable end-to-end delay are established |
| Sub Title (in English) | |
| Keyword(1) | Real Time Communication |
| Keyword(2) | Quality of Service |
| Keyword(3) | Connection Admission Control |
| Keyword(4) | Earliest Due Date First Scheduling |
| Keyword(5) | Worst-case Link Delay |
| 1st Author's Name | Ryusuke MIYAKE |
| 1st Author's Affiliation | The Graduate School of Natural Science and Technology, Okayama Univ.() |
| 2nd Author's Name | Tokumi YOKOHIRA |
| 2nd Author's Affiliation | The Graduate School of Natural Science and Technology, Okayama Univ. |
| Date | 2005-12-15 |
| Paper # | NS2005-141 |
| Volume (vol) | vol.105 |
| Number (no) | 470 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |