Sequential paging schemes considering two classes of paging traffic
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, Dong Jun | ko |
| dc.contributor.author | Cho, Dong-Ho | ko |
| dc.date.accessioned | 2013-02-28T05:37:40Z | - |
| dc.date.available | 2013-02-28T05:37:40Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1999-07 | - |
| dc.identifier.citation | ELECTRONICS LETTERS, v.35, no.14, pp.1138 - 1139 | - |
| dc.identifier.issn | 0013-5194 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/73044 | - |
| dc.description.abstract | Three sequential paging methods for serving two classes of paging traffic are considered. The first method involves treating the two classes of traffic equally, the second involves giving higher priority to call paging traffic over supplementary service traffic and the final method involves using different paging area sizes for each class of traffic. | - |
| dc.language | English | - |
| dc.publisher | IEE-INST ELEC ENG | - |
| dc.title | Sequential paging schemes considering two classes of paging traffic | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000082031900013 | - |
| dc.identifier.scopusid | 2-s2.0-0032674686 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 35 | - |
| dc.citation.issue | 14 | - |
| dc.citation.beginningpage | 1138 | - |
| dc.citation.endingpage | 1139 | - |
| dc.citation.publicationname | ELECTRONICS LETTERS | - |
| dc.identifier.doi | 10.1049/el:19990826 | - |
| dc.contributor.localauthor | Cho, Dong-Ho | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- EE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 7 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.