IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.最新文献

筛选
英文 中文
Decoupling end-to-end QoS provisioning from service provisioning at routers in the Diffserv network model 在Diffserv网络模型中,将端到端QoS配置与路由器上的服务配置解耦
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378253
Jie Yang, J. Ye, S. Papavassiliou, N. Ansari
{"title":"Decoupling end-to-end QoS provisioning from service provisioning at routers in the Diffserv network model","authors":"Jie Yang, J. Ye, S. Papavassiliou, N. Ansari","doi":"10.1109/GLOCOM.2004.1378253","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378253","url":null,"abstract":"In this paper, a novel concept of decoupling the end-to-end QoS provisioning from the service provisioning at routers in the Diffserv network is proposed to enhance the QoS granularity offered in the Diffserv model and improve both the network resource utilization and user benefits. To realize the concept, we implement a new endpoint admission control, referred to as explicit endpoint admission control, with the service vector concept at the user side, which allows a data flow to choose different services at different routers. At the router side, we propose a new packet marking scheme, by which the end host can obtain the performance of each service class at each router and determine the service vector. The achievable performance of the proposed approach is studied and the corresponding results demonstrate that the proposed mechanism can have better service differentiation capability and lower request dropping probability than the Intserv over Diffserv schemes while it still maintains the simplicity feature of the Diffserv network model.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121804039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Redesigning an active queue management system 重新设计一个主动队列管理系统
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378052
D. Agrawal, F. Granelli
{"title":"Redesigning an active queue management system","authors":"D. Agrawal, F. Granelli","doi":"10.1109/GLOCOM.2004.1378052","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378052","url":null,"abstract":"A robust proportional-integral-derivative (PID) controller is proposed for active queue management (AQM). A linear quadratic regulator (LQR) method is used to design the controller, named LQR-PID. LQR is a robust design technique as compared to classical gain-and-phase margin and dominant pole placement methods. The LQR-PID controller marks the packets according to queue length with a probability and notifies congestion to sources; in turn, sources adjust their send rate, thus maintaining queue length at the desired level in bottleneck routers. By maintaining queue length at the desired level, delay can be predicted and quality of service can be provided. Simulation results demonstrate the robustness and superiority of LQR-PID AQM as compared with other AQM schemes in the literature.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116903407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
An optimal and fair call admission control policy for seamless handoff in multimedia wireless networks with QoS guarantees 一种具有QoS保证的多媒体无线网络无缝切换的最优、公平的呼叫接纳控制策略
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1379104
N. Nasser, H. Hassanein
{"title":"An optimal and fair call admission control policy for seamless handoff in multimedia wireless networks with QoS guarantees","authors":"N. Nasser, H. Hassanein","doi":"10.1109/GLOCOM.2004.1379104","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1379104","url":null,"abstract":"Providing multimedia services with quality of service (QoS) guarantees in next generation wireless cellular networks poses great challenges due to the scarce radio bandwidth. Effective call admission control (CAC) is important for the efficient utilization of the limited bandwidth. In this paper we present an optimal Markov decision-based call admission control (MD-CAC) policy for the multimedia services that characterize the next generation of wireless cellular networks. A Markov decision process (MDP) is used to represent the CAC policy. The MD-CAC is formulated as a linear programming problem with the objectives of maximizing the system utilization while ensuring class differentiation and providing quantitative fairness guarantees among different classes of users. Through simulation, we show that the MD-CAC policy upholds the handoff call dropping probability required by each traffic class and provides fairness for all classes while maximizing the bandwidth utilization.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":" 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120830419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding 针对噪声信道的睡狼问题提出了一种新的编码方案:分离设计和联合解码
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1377911
R. Hu, R. Viswanathan, Jing Li
{"title":"A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding","authors":"R. Hu, R. Viswanathan, Jing Li","doi":"10.1109/GLOCOM.2004.1377911","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1377911","url":null,"abstract":"A new scheme for solving the Slepian-Wolf problem over noisy channels using serially concatenated codes is proposed. An outer low density parity check code is used to perform distributed source coding, and an inner convolutional code adds error protecting capability to the compressed data. A soft iterative joint source-channel decoder is performed, where the decoder side information is provided to the sub outer decoder instead of the sub inner decoder. The scheme is attractive since separate refining of compression rate (outer code) and error protection power (inner code) makes the design easy and the performance controllable, and joint iterative decoding exploits the power of the serial concatenated structure as much as possible. Simulations reveal encouraging joint decoding gain especially at low signal-to-noise ratios.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120940537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Hierarchical scheduling for DiffServ classes DiffServ类的分层调度
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378053
Mei Yang, Hanping Wang, E. Lu, S. Zheng
{"title":"Hierarchical scheduling for DiffServ classes","authors":"Mei Yang, Hanping Wang, E. Lu, S. Zheng","doi":"10.1109/GLOCOM.2004.1378053","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378053","url":null,"abstract":"Due to its simplicity and scalability, the differentiated services (DiffServ) model is expected to be widely deployed across the Internet. For each DiffServ compliant router, the scheduling algorithm is critical in implementing per hop behaviors (PHBs), according to which packets are forwarded. We propose a hierarchical DiffServ scheduling (HDS) algorithm to support DiffServ classes on input-queued switches. The proposed HDS algorithm features in a hierarchical scheduling scheme that consists of two levels of schedulers. One level is the central scheduler which is designed to maximize the switch throughput by computing a maximal size matching between input ports and output ports. The other level is formed by input port schedulers which provide differentiated services by serving cells belonging to different classes dynamically. Using such a hierarchical scheme, the implementation complexity and the amount of information needed to be transmitted between input ports and the central scheduler are dramatically reduced compared with existing maximal weight matching based DiffServ scheduling algorithms. The tradeoff of its slightly worse delay performance is acceptable.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127113765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
A proportional-fair power allocation scheme for fair and efficient multiuser OFDM systems 一种公平高效多用户OFDM系统的比例公平功率分配方案
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1379067
Hanbyul Seo, B. Lee
{"title":"A proportional-fair power allocation scheme for fair and efficient multiuser OFDM systems","authors":"Hanbyul Seo, B. Lee","doi":"10.1109/GLOCOM.2004.1379067","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1379067","url":null,"abstract":"In this paper we investigate adaptive resource allocation schemes in multiuser OFDM systems for fair share of resources and efficient operation. We employ the CDF-based scheduling (CS) algorithm for the subcarrier allocation, taking advantage of its distinctive feature of analyzability and multiuser diversity. Noting that conventional power allocation schemes do not exhibit efficient and fair operations in heterogeneous user channel environments, we present a new algorithm called proportional-fair power allocation (PFPA). This algorithm is designed to allocate transmission power in such a way that the resulting relative throughput-increment is identical for all subcarriers. The PFPA algorithm is shown to be equivalent to the power allocation of the asymptotically optimal algorithm which exhibits the largest achievable region in the asymptotic case. Numerical results reveal that the combined CS-PFPA algorithm improves the overall system capacity in terms of time-average throughput and provides efficient estimation of user performance. Further, the CS-PFPA algorithm can meet each user's requirements using a minimum amount of resources, so it renders an efficient and fair means for resource allocation in multiuser OFDM systems.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127284781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 62
Dynamic routing and wavelength assignment using learning automata technique [all optical networks] 使用学习自动机技术的动态路由和波长分配[全光网络]
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378326
Anwar Alyatama
{"title":"Dynamic routing and wavelength assignment using learning automata technique [all optical networks]","authors":"Anwar Alyatama","doi":"10.1109/GLOCOM.2004.1378326","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378326","url":null,"abstract":"Dynamic routing and wavelength assignment RWA is one of the most important issues in wavelength routed all optical networks. We introduce the learning automata technique for dynamic RWA in WDM networks without conversion under different load conditions. Learning automata are used to choose the shortest route from source to destination if more than one shortest route exist. Furthermore, learning automata are used to select which wavelength is to be used on the chosen route. We compare our wavelength assignment technique with some exhaustive wavelength assignment algorithms that scan all wavelengths on a predetermined shortest route. The use of the learning automata wavelength assignment technique reduces the call setup time by pursuing a small number of wavelengths. In addition, the technique is used to achieve fairness among different source/destination pairs. Simulation results are presented which indicate the benefits of using the learning automata technique for dynamic routing and wavelength assignment in WDM networks.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127471908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
SUCCESS-LCO: instant and cost-effective upgrade of existing passive optical networks by spectral shaping line codes SUCCESS-LCO:通过频谱整形线路代码对现有无源光网络进行即时和经济有效的升级
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378325
Y. Hsueh, M. Rogge, Wei-tao Shaw, Jaedon Kim, L. Kazovsky, Shu Yamamoto
{"title":"SUCCESS-LCO: instant and cost-effective upgrade of existing passive optical networks by spectral shaping line codes","authors":"Y. Hsueh, M. Rogge, Wei-tao Shaw, Jaedon Kim, L. Kazovsky, Shu Yamamoto","doi":"10.1109/GLOCOM.2004.1378325","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378325","url":null,"abstract":"Novel line codes combined with WDM techniques allow simple and cost-effective overlay of higher bitrate services in existing fiber optical access networks. The solution leaves the existing services and field-deployed fibers untouched. The design of the spectral shaping line codes is presented, along with the analyses for different code rates and processing window sizes. The computation can be simplified by employing vector quantization for the trigonometric functions. DC balance is achieved by forwarding the DC residual to the following window. The spectral shape can be manipulated in various ways to optimize the system performance. Experiments have been conducted to demonstrate and compare several different optimized line codes. For a specific tolerable interference level, the optimal line code can easily be determined which maximizes the data throughput. The service overlay by the line coding technique provides a very flexible and economic way to upgrade existing passive optical networks.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124824409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Dynamic threshold-based call admission framework for prioritized multimedia traffic in wireless cellular networks 基于动态阈值的无线蜂窝网络中优先级多媒体业务的呼叫接纳框架
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378041
N. Nasser, H. Hassanein
{"title":"Dynamic threshold-based call admission framework for prioritized multimedia traffic in wireless cellular networks","authors":"N. Nasser, H. Hassanein","doi":"10.1109/GLOCOM.2004.1378041","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378041","url":null,"abstract":"Next generation wireless cellular networks aim at supporting wireless multimedia services with different classes of traffic that are characterized by diverse quality of service (QoS) and bandwidth requirements. They will use micro/picocellular architectures in order to provide higher capacity. However, small-size cells increase the handoff rate drastically. As a result, it is a challenge to provide stable QoS in these networks. In this paper, we present a novel dynamic call admission control (DyCAC) framework for next generation wireless cellular networks. The framework consists of the following components: (i) a threshold-based bandwidth reservation policy; (ii) a threshold update processing module; and (iii) an admission controller module. In this work, each base station locally, independently of other base stations in the network, differentiates between new and handoff calls for each class of traffic by assigning a threshold to each class according to its QoS requirements. The threshold values change dynamically and periodically in order to respond to the varying traffic conditions. The main feature of the proposed framework is its ability to simultaneously achieve several design goals. Numerical results show that our proposed DyCAC framework can guarantee the connection-level quality of service of individual traffic classes while maximizing resource utilization. As well, DyCAC requires low communication overhead, and is highly scalable.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124898208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Outdoor IEEE 802.11g cellular network performance 室外IEEE 802.11g蜂窝网络性能
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378901
Elena López-Aguilera, J. Casademont, Josep Cotrina Navau
{"title":"Outdoor IEEE 802.11g cellular network performance","authors":"Elena López-Aguilera, J. Casademont, Josep Cotrina Navau","doi":"10.1109/GLOCOM.2004.1378901","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378901","url":null,"abstract":"Most studies about the performance of IEEE 802.11 are limited to a single cell environment. Nevertheless, the idea of designing an outdoor cellular network based on WLAN IEEE 802.11 is very attractive, due to the several advantages that this technology presents: the low cost of the equipment, its operation in unlicensed spectrum and its higher data rates. In this paper, we study the possibility of designing an outdoor cellular network based on the IEEE 802.11g standard. We present its performance under different load conditions and compare this behavior with the results obtained in an isolated single cell environment, without co-channel interference. Finally, going a step further, this paper explores the IEEE 802.11g cellular network performance for different cluster sizes, as a method to reduce the interference influence on network's performance.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126027751","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信