发布求助
文献互助 智能选刊 最新文献

IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference最新文献

筛选
英文 中文
Non-Cooperative Design of Translucent Networks 半透明网络的非合作设计
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.447
B. Châtelain, Shie Mannor, F. Gagnon, D. Plant
{"title":"Non-Cooperative Design of Translucent Networks","authors":"B. Châtelain, Shie Mannor, F. Gagnon, D. Plant","doi":"10.1109/GLOCOM.2007.447","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.447","url":null,"abstract":"This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presented and used as a reference to evaluate the game theoretic algorithm performances. Both formulations include primary and link-disjoint protection paths pre-calculation and take into account the system maximal optical reach distance. Numerical results show that the game theoretic formulation considerably decreases the optimization time and provides near optimal solutions, in term of required number of regenerator nodes.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132387112","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}
引用次数: 13
Service Delivery Platform for Telecom-Enterprise-Internet Combined Services 电信-企业-互联网融合服务交付平台
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.28
H. Ohnishi, Y. Yamato, M. Kaneko, T. Moriya, M. Hirano, H. Sunaga
{"title":"Service Delivery Platform for Telecom-Enterprise-Internet Combined Services","authors":"H. Ohnishi, Y. Yamato, M. Kaneko, T. Moriya, M. Hirano, H. Sunaga","doi":"10.1109/GLOCOM.2007.28","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.28","url":null,"abstract":"In this paper, we discuss the requirements of a service delivery platform (SDP) and present our SDP. An SDP is an overlay platform that provides interfaces that enable third-party application developers to easily create various applications for the next-generation network (NGN). However, SDP is now just a concept and many vendors and network carriers have proposed different systems for SDP. We evaluated the basic functions of our SDP and confirmed its feasibility.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"434 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132412023","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}
引用次数: 43
A Scalable Decoder Architecture for IEEE 802.11n LDPC Codes IEEE 802.11n LDPC码的可扩展解码器架构
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.620
M. Rovini, Giuseppe Gentile, F. Rossi, L. Fanucci
{"title":"A Scalable Decoder Architecture for IEEE 802.11n LDPC Codes","authors":"M. Rovini, Giuseppe Gentile, F. Rossi, L. Fanucci","doi":"10.1109/GLOCOM.2007.620","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.620","url":null,"abstract":"This paper describes a scalable IP of a decoder for LDPC codes compliant to IEEE 802.1 In and running the well- known layered decoding algorithm. The decoder architecture is arranged in clusters of serial processing units, which are configurable to process all the codes in the standard and, at the same time, to support multiple frame decoding. An optimization methodology of the iteration latency is also described, which relates to the order of the messages updated by the processors, as well as to the sequence of layers the decoder goes through. The logic synthesis on 65 nm CMOS technology with low- power standard-cell library, shows that the proposed design is suitable for portable devices, the throughput ranging from 180 to 410 Mbps, and the power consumption being below 235 mW.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130010341","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}
引用次数: 36
A Differential Binary Message-Passing LDPC Decoder 差分二进制消息传递LDPC解码器
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.300
N. Mobini, A. Banihashemi, S. Hemati
{"title":"A Differential Binary Message-Passing LDPC Decoder","authors":"N. Mobini, A. Banihashemi, S. Hemati","doi":"10.1109/GLOCOM.2007.300","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.300","url":null,"abstract":"In this paper, we propose a binary message-passing algorithm for decoding low-density parity-check (LDPC) codes. The algorithm substantially improves the performance of purely hard-decision iterative algorithms with a small increase in the memory requirements and the computational complexity. We associate a reliability value to each nonzero element of the code's parity-check matrix, and differentially modify this value in each iteration based on the sum of the extrinsic binary messages from the check nodes. For the tested random and finite-geometry LDPC codes, the proposed algorithm can achieve performance as close as 1.3 dB and 0.7 dB to that of belief propagation (BP) at the error rates of interest, respectively. This is while, unlike BP, the algorithm does not require the estimation of channel signal to noise ratio. Low memory and computational requirements and binary message-passing make the proposed algorithm attractive for high-speed low-power applications.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130114796","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}
引用次数: 39
Opportunistic Access with Random Subchannel Backoff (OARSB) for OFDMA Uplink OFDMA上行链路随机子信道回退(OARSB)的机会接入
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.614
Yu-jung Chang, Feng-Tsun Chien, C.-C. Jay Kuo
{"title":"Opportunistic Access with Random Subchannel Backoff (OARSB) for OFDMA Uplink","authors":"Yu-jung Chang, Feng-Tsun Chien, C.-C. Jay Kuo","doi":"10.1109/GLOCOM.2007.614","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.614","url":null,"abstract":"A distributed medium access control (MAC) algorithm for uplink OFDMA networks under the IEEE 802.16 framework is proposed and analyzed in this work. We present a simple yet efficient algorithm to enhance the system throughput by integrating opportunistic medium access and collision resolution through random subchannel backoff. Consequently, the resulting algorithm is called the opportunistic access with random subchannel backoff (OARSB) scheme. OARSB not only achieves distributed coordination among users but also reduces the amount of information exchange between the base station and users. The throughput and delay performance analysis of OARSB is conducted using a Markov chain model. The superior performance of OARSB over an existing scheme is demonstrated by analysis as well as computer simulation.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134417740","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}
引用次数: 8
SMARTNET: An Efficient Multicast Architecture for IP-Based Mobile Convergence Networks 基于ip的移动融合网络的高效组播结构SMARTNET
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.379
Wontae Kim, Insoo Park, Yong-Jin Park
{"title":"SMARTNET: An Efficient Multicast Architecture for IP-Based Mobile Convergence Networks","authors":"Wontae Kim, Insoo Park, Yong-Jin Park","doi":"10.1109/GLOCOM.2007.379","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.379","url":null,"abstract":"We propose a novel multicast architecture named SMARTNET in this paper. On deploying the legacy multicast routing protocols to mobile core networks, there are some efficiency issues including traffic overhead from unnecessary sources, heavy group control messages, and performance degradation of multicast routers by large amount of multicast session states. Since SMARTNET uses stateless multicast mechanism based on XCast, it does not need to maintain multicast session states and there is no heavy control overhead like flooding after prune of DVMRP. It can dramatically reduce multicast packet overhead from unnecessary sources by means of source filtering. And light-weight multicast group control protocol of SMARTNET is designed to have interoperability with IGMPv3 from mobile nodes. Finally we evaluate and approve the performance of the proposed architecture with well-designed network simulations.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133906419","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}
引用次数: 0
An Exact Solution to an Approximated Model of RED RED近似模型的精确解
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.350
C. Bauer, H. Yousefi’zadeh, H. Jafarkhani
{"title":"An Exact Solution to an Approximated Model of RED","authors":"C. Bauer, H. Yousefi’zadeh, H. Jafarkhani","doi":"10.1109/GLOCOM.2007.350","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.350","url":null,"abstract":"In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping behavior of the RED algorithm. Using a notion from the theory of random walks, we then derive an exact-closed form expression that characterizes the loss characteristics of a RED queue. We validate the derived formula by a numerical comparison with the recursive equations.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134298124","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}
引用次数: 0
Protograph LDPC Codes Design Based on EXIT Analysis 基于出口分析的原型LDPC码设计
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.616
G. Liva, M. Chiani
{"title":"Protograph LDPC Codes Design Based on EXIT Analysis","authors":"G. Liva, M. Chiani","doi":"10.1109/GLOCOM.2007.616","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.616","url":null,"abstract":"In this paper, a novel extrinsic information transfer (EXIT) analysis is presented for protograph-based and multi- edge type low-density parity-check (LDPC) codes. A protograph defines a subset of an LDPCC ensemble (identified by the degree distributions of the bipartite graph), introducing further constraints about the edge connections. For many codes belonging to this class, the conventional approach based on EXIT charts cannot be applied. The proposed EXIT analysis takes into account edge connections, permitting the decoding convergence evaluation for protograph-based LDPC codes, allowing the design of highly-structured capacity approaching LDPC codes.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127580092","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}
引用次数: 247
Statistical Traffic Envelopes for Markov-Modulated Poisson Packet Sources 马尔可夫调制泊松包源的统计流量包
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.499
P. Giacomazzi
{"title":"Statistical Traffic Envelopes for Markov-Modulated Poisson Packet Sources","authors":"P. Giacomazzi","doi":"10.1109/GLOCOM.2007.499","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.499","url":null,"abstract":"In this paper, we develop a method for using traffic sources modelled as a Markov modulated Poisson processes (MMPP) in the framework of the recently developed theory of the statistical traffic and service envelopes, referred to as the statistical approach. The statistical approach is a powerful and general framework for providing straightforwardly an approximated evaluation of the delay and buffer tail distributions in network schedulers. However, the input of the statistical approach is the statistical traffic envelope, which is not available for generic MMPP sources. We provide two statistical traffic envelopes, named two-moments and upper-bounding bucket, for a generic MMPP source, so as to use the rich collection of MMPP models of voice, audio, data and video sources available in the literature within the framework of the statistical approach. In this way, we can avoid the computational complexity of traditional Markov analysis with MMPP traffic, due to the exploding number of states as the number of MMPP sources grows. The tighter approximation is provided by the two-moments envelope while with the upper-bounding bucket envelope we can obtain simple closed-form solutions.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130790112","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}
引用次数: 10
Performance Comparison of Scheduling Algorithms for Multimedia Traffic Over High-Rate WPANs 高速广域网多媒体流量调度算法的性能比较
IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference Pub Date : 2007-12-26 DOI: 10.1109/GLOCOM.2007.406
Fabio Lorquando, A. Zanella
{"title":"Performance Comparison of Scheduling Algorithms for Multimedia Traffic Over High-Rate WPANs","authors":"Fabio Lorquando, A. Zanella","doi":"10.1109/GLOCOM.2007.406","DOIUrl":"https://doi.org/10.1109/GLOCOM.2007.406","url":null,"abstract":"In this paper we investigate the potentialities offered by IEEE 802.15.3 framework for supporting multimedia services. More specifically, we analyze the performance of some classical scheduling policies in presence of intensive heterogeneous realtime and multimedia traffic, in order to identify the most effective strategy for the considered scenarios. The analysis has been performed by using a complete 802.15.3 C++ simulator, where we have realized the different scheduling strategies upon an entirely standard-compliant round robin polling procedure. Results show that, in most cases, EDF approach offers better performance, though its margin with respect to the other strategies strictly depends on the specific scenario considered.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130868379","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}
引用次数: 0
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信