ASIA unversity:Item 310904400/8701
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 94286/110023 (86%)
造访人次 : 21718892      在线人数 : 259
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/8701


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/8701


    题名: Utilization optimization for ovsf single-code allocation in WCDMA networks
    作者: Chen, Jui-Chi
    贡献者: Department of Computer Science and Information Engineering
    关键词: Blocking probability;Breeder reactors;Cellular neural networks;Cellular telephone systems;Chlorination;Computer networks;Context sensitive grammars;Network protocols;Optimization;Risk assessment;Sensor networks;OVSF code;Telecommunications;Utilization optimization;WCDMA
    日期: 2008
    上传时间: 2010-04-07 13:27:30 (UTC+0)
    出版者: Asia University
    摘要: Resources such as Wideband Code Division Multiple Access (WCDMA) Orthogonal Variable Spreading Factor (OVSF) codes are considered scarce and valuable in modern cellular networks, therefore operators must use them efficiently. The author proposes an evaluation model for predicting OVSF single-code allocation performance in WCDMA networks. In this paper, two performance measures-call blocking probability (CBP) and bandwidth utilization (BU)-are adopted to solve a utilization optimization problem. Specifically, a given traffic statistic and a specified maximum CBP constraint are applied to maximize BU in a Node-B. Operators can use the results to deploy their codes flexibly and to improve profitability.
    關聯: Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an 31:1077-1081
    显示于类别:[資訊工程學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    0KbUnknown495检视/开启
    411.doc34KbMicrosoft Word306检视/开启


    在ASIAIR中所有的数据项都受到原著作权保护.


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