ASIA unversity:Item 310904400/8681
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 94286/110023 (86%)
造訪人次 : 21657034      線上人數 : 464
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/8681


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/8681


    題名: Partial loss probability of OVSF single-code assignment with space-limited batch arrival queues: M[2x]/M/c/c
    作者: Chen, Jui-Chi
    貢獻者: Department of Computer Science and Information Engineering
    關鍵詞: Bandwidth;Communication channels (information theory);Computer simulation;Probability;Profitability;Queueing networks;Band-width utilization;Loss probability;OVSF codes;Queuing models;WCDMA network
    日期: 2010-01
    上傳時間: 2010-04-07 13:27:18 (UTC+0)
    出版者: Asia University
    摘要: In a WCDMA Node-B, orthogonal variable spreading factor (OVSF) codes are both valuable and limited. Many efforts are being made to create OVSF code-assignment schemes that support a maximum number of users. Here the author (a) proposes a batch arrival and partial loss queuing model to evaluate OVSF single-code assignment system performance, and (b) derives expressions for calculating two important system performance measures (partial loss probability and bandwidth utilization) that respectively denote subscriber service quality and operator profit. Results from a simulation test suggest that the proposed model has utility in the construction of WCDMA networks.
    關聯: Journal of Information Science and Engineering 26 (1) :267-278
    顯示於類別:[資訊工程學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    120KbUnknown549檢視/開啟
    12.doc29KbMicrosoft Word371檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋