Name
Abstract | ||
|---|---|---|
In this paper, we describe the structure of the access network and we propose bandwidth guarantee scheme for subscriber and service. The scheme uses two kinds of the classification table, which are called ”service classification table” and ”subscriber classification table.” Using the classification table, we can identify the flow of the subscriber and service. Also, we compute the number of hash table entry to minimize the loss ratio of flows using the M/G/k/k queueing model. Finally, we apply to deficit round robin (DRR) scheduling through virtual queueing per subscriber instead of aggregated class. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11557654_13 | HPCC |
Keywords | Field | DocType |
virtual queueing,classification table,access network,bandwidth guarantee scheme,bandwidth guarantee method,aggregated class,subscriber classification table,hash table entry,loss ratio,deficit round robin,service classification table,hash table | Telecommunications network,Deficit round robin,Scheduling (computing),Computer science,Computer network,Real-time computing,Queueing theory,Bandwidth (signal processing),Hash function,Access network,Distributed computing,Hash table | Conference |
Volume | ISSN | ISBN |
3726 | 0302-9743 | 3-540-29031-1 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hea-Sook Park | 1 | 28 | 6.52 |
| Kap-dong Kim | 2 | 4 | 1.43 |
| Hae-Sook Kim | 3 | 0 | 1.01 |
| C. Youn | 4 | 40 | 20.95 |