| Presentation | 2005-05-27 Improvement of a Method for Calculating Worst-case Link Delays in EDD Connection Admission Control Scheme Ryuusuke 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 in stants (checkpoints). In our previous calculation method, high speed calculation is attained by decreasing a upper bound value of checkpoints. However, the method can not calculate at high speed when networks are temporarily in congested state. The purpose of the paper is to improve the previous method. The upper bound value of the previous method depends on the slope and the intercept of a linear function called a covering function, and its value drastically increases for the small increase of the slope and slowly increases for the small increase of the intercept. Because the previous method uses a covering function whose slope is large in the temporal congested state, the calculation time becomes large. The improved method uses a covering function whose slope is minimum and whose intercept somewhat larger than the previous method, and consequently the upper bound value of checkpoints become smaller. The improved method therefore can attain high speed calculation in the temporal congested state. Numerical examples show that the improved method drastically decrease the calculation time in the temporal congested state. |
| 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-37 |
| Date of Issue |
| Conference Information | |
| Committee | NS |
|---|---|
| Conference Date | 2005/5/19(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) | Improvement of a Method for Calculating Worst-case Link Delays in EDD Connection Admission Control Scheme |
| 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 | Ryuusuke 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-05-27 |
| Paper # | NS2005-37 |
| Volume (vol) | vol.105 |
| Number (no) | 86 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |