Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188546
Ko-Shung Chen, Chao-Ping Yu, N. Huang
As WDM-based optical networks are becoming the right choice for the next-generation Internet networks to transport high-speed IP traffic, the leading role of wireless ATM (WATM) networks will be undoubtedly replaced with wireless WDM (WWDM) networks for providing high quality of services to mobile users. Meanwhile, multicasting has played an increasingly important role in many conventional and emerging applications, such as teleconferencing and distributed games. In this paper, a constrained optical tree migration scheme (COTMS) is proposed to support multicast services in WWDM networks. COTMS is an enhancement of our previous work, called CTMS, for adapting to the characteristic of WDM-based backbone networks. CTMS can properly deal with the constrained tree migration problem for generic wireless networks, and COTMS inherits the efficiencies of CTMS entirely. Simulation results show that COTMS can markedly reduce the resources used per multicast tree, thus achieving both low handoff-dropping/join-blocking rate and high resource utilization. More importantly, we demonstrate how COTMS incorporating crossover optical switch discovery can be used to support real-time traffic for heterogeneous (i.e., unicast and multicast) connections in a uniform and unified manner. The proposed scheme is also suitable for routing over fully mobile (ad hoc) networks in which multiple frequencies are used for data communications.
{"title":"Migrating constrained optical tree in wireless WDM systems","authors":"Ko-Shung Chen, Chao-Ping Yu, N. Huang","doi":"10.1109/GLOCOM.2002.1188546","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188546","url":null,"abstract":"As WDM-based optical networks are becoming the right choice for the next-generation Internet networks to transport high-speed IP traffic, the leading role of wireless ATM (WATM) networks will be undoubtedly replaced with wireless WDM (WWDM) networks for providing high quality of services to mobile users. Meanwhile, multicasting has played an increasingly important role in many conventional and emerging applications, such as teleconferencing and distributed games. In this paper, a constrained optical tree migration scheme (COTMS) is proposed to support multicast services in WWDM networks. COTMS is an enhancement of our previous work, called CTMS, for adapting to the characteristic of WDM-based backbone networks. CTMS can properly deal with the constrained tree migration problem for generic wireless networks, and COTMS inherits the efficiencies of CTMS entirely. Simulation results show that COTMS can markedly reduce the resources used per multicast tree, thus achieving both low handoff-dropping/join-blocking rate and high resource utilization. More importantly, we demonstrate how COTMS incorporating crossover optical switch discovery can be used to support real-time traffic for heterogeneous (i.e., unicast and multicast) connections in a uniform and unified manner. The proposed scheme is also suitable for routing over fully mobile (ad hoc) networks in which multiple frequencies are used for data communications.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"490 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134462898","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188999
S. Chamberland
We tackle the design problem of the logical overlay network used by the reliable label switched paths (ILSPs) in Internet protocol (IP) networks. The design problem consists to find the minimum capacity on each link and the routing metrics that ensure the successful rerouting of the reliable LSPs for all failure scenarios of interest to the network planner. The objective is to minimize the cost of the network overlay. A mixed nonlinear bi-level mathematical programming model is proposed for the problem and a tabu-search heuristic algorithm is designed to find "good" solutions of the model. Numerical results show that quasi-optimal solutions can be found with the proposed algorithm.
{"title":"An efficient heuristic for designing logical overlay networks for the reliable label switched paths in IP networks","authors":"S. Chamberland","doi":"10.1109/GLOCOM.2002.1188999","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188999","url":null,"abstract":"We tackle the design problem of the logical overlay network used by the reliable label switched paths (ILSPs) in Internet protocol (IP) networks. The design problem consists to find the minimum capacity on each link and the routing metrics that ensure the successful rerouting of the reliable LSPs for all failure scenarios of interest to the network planner. The objective is to minimize the cost of the network overlay. A mixed nonlinear bi-level mathematical programming model is proposed for the problem and a tabu-search heuristic algorithm is designed to find \"good\" solutions of the model. Numerical results show that quasi-optimal solutions can be found with the proposed algorithm.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127428950","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188486
Christophe Jelger, Thomas Noël
Mobile IPv6 (MIPv6), the IPv6 version of Mobile IP which is currently being developed by the Internet Engineering Task Force (IETF), is a protocol that describes how a mobile node can change its point of attachment to the Internet. While MIPv6 focuses on unicast communications, it also proposes two basic methods, known as bi-directional tunneling and remote subscription, to handle multicast communications with mobile nodes. In the mean time, the deployment of Source-Specific Multicast (SSM) is of great consideration, mainly for scalability reasons as it is a strong candidate that could be used to support inter-domain multicast routing. In the particular case of mobile IPv6 SSM sources, the mechanisms proposed in MIPv6 to support multicast communications introduce a number of problems that strongly degrade the SSM routing mode of operation. The intend of this document is to describe protocol enhancements that can be used to solve the problems introduced by mobile SSM sources when used with the current version of MIPv6. The extensions, mechanisms and mode of operation of the protocol proposed in this paper are denoted as MSSMSv6 (Mobile SSM Sources for IPv6).
移动IPv6 (MIPv6)是目前由互联网工程任务组(IETF)开发的移动IP的IPv6版本，是一种描述移动节点如何改变其连接到互联网的点的协议。虽然MIPv6侧重于单播通信，但它也提出了两种基本方法，即双向隧道和远程订阅，来处理与移动节点的多播通信。与此同时，源特定组播(SSM)的部署非常值得考虑，主要是出于可扩展性的原因，因为它是支持域间组播路由的强有力候选。在移动IPv6 SSM源的特殊情况下，MIPv6中提出的支持多播通信的机制引入了许多问题，这些问题严重降低了SSM路由操作模式。本文档的目的是描述可用于解决移动SSM源在与当前版本的MIPv6一起使用时引入的问题的协议增强。本文提出的协议扩展、机制和运行模式记为MSSMSv6 (Mobile SSM Sources for IPv6)。
{"title":"Supporting mobile SSM sources for IPv6","authors":"Christophe Jelger, Thomas Noël","doi":"10.1109/GLOCOM.2002.1188486","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188486","url":null,"abstract":"Mobile IPv6 (MIPv6), the IPv6 version of Mobile IP which is currently being developed by the Internet Engineering Task Force (IETF), is a protocol that describes how a mobile node can change its point of attachment to the Internet. While MIPv6 focuses on unicast communications, it also proposes two basic methods, known as bi-directional tunneling and remote subscription, to handle multicast communications with mobile nodes. In the mean time, the deployment of Source-Specific Multicast (SSM) is of great consideration, mainly for scalability reasons as it is a strong candidate that could be used to support inter-domain multicast routing. In the particular case of mobile IPv6 SSM sources, the mechanisms proposed in MIPv6 to support multicast communications introduce a number of problems that strongly degrade the SSM routing mode of operation. The intend of this document is to describe protocol enhancements that can be used to solve the problems introduced by mobile SSM sources when used with the current version of MIPv6. The extensions, mechanisms and mode of operation of the protocol proposed in this paper are denoted as MSSMSv6 (Mobile SSM Sources for IPv6).","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115520208","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188133
J. Koo
We present performance analysis of an iterative group-wise parallel interference cancellation (IGPIC) algorithm for coherent detection of an asynchronous wideband DS-CDMA system in a single cell over multipath Rayleigh fading channels. The proposed IGPIC algorithm can improve the existing serial interference cancellation (SIC) algorithm that significantly degrades the detection performance for stronger users compared to weaker users. It also improves the group-wise serial interference cancellation (GSIC) algorithm that suffers from severe degradation of detection performance as the number of users in a group increases. In the proposed algorithm, users in a system am divided into several groups and interfering signals are subtracted out from the received signal as many times as the number of users in a group, iteratively. The iterative group-wise interference cancellation (IGIC) algorithm is also classified into the iterative group-wise serial interference cancellation (IGSIC) and the IGPIC algorithm. The results show that the performance of the IGPIC algorithm is superior to that of the IGSIC algorithm by 4 dB, right before the final cancellation in a group for 10 users at BER=1.0/spl times/10/sup -2/.
{"title":"Performance analysis of an iterative group-wise parallel interference cancellation for multiuser detection of coherent W-CDMA system","authors":"J. Koo","doi":"10.1109/GLOCOM.2002.1188133","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188133","url":null,"abstract":"We present performance analysis of an iterative group-wise parallel interference cancellation (IGPIC) algorithm for coherent detection of an asynchronous wideband DS-CDMA system in a single cell over multipath Rayleigh fading channels. The proposed IGPIC algorithm can improve the existing serial interference cancellation (SIC) algorithm that significantly degrades the detection performance for stronger users compared to weaker users. It also improves the group-wise serial interference cancellation (GSIC) algorithm that suffers from severe degradation of detection performance as the number of users in a group increases. In the proposed algorithm, users in a system am divided into several groups and interfering signals are subtracted out from the received signal as many times as the number of users in a group, iteratively. The iterative group-wise interference cancellation (IGIC) algorithm is also classified into the iterative group-wise serial interference cancellation (IGSIC) and the IGPIC algorithm. The results show that the performance of the IGPIC algorithm is superior to that of the IGSIC algorithm by 4 dB, right before the final cancellation in a group for 10 users at BER=1.0/spl times/10/sup -2/.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115861770","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188405
David Haley, A. Grant, John Buetefuer
Motivated by the potential to reuse the decoder architecture, and thus reduce circuit space, we explore the use of iterative encoding techniques which are based upon the graphical representation of the code. We design codes by identifying associated encoder convergence constraints and also eliminating some well known undesirable properties for sum-product decoding such as 4-cycles. In particular we show how the Jacobi method for iterative matrix inversion can be viewed as message passing and employed as the core of an iterative encoder. Example constructions of both regular and irregular LDPC codes that are encodable using this method are investigated.
{"title":"Iterative encoding of low-density parity-check codes","authors":"David Haley, A. Grant, John Buetefuer","doi":"10.1109/GLOCOM.2002.1188405","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188405","url":null,"abstract":"Motivated by the potential to reuse the decoder architecture, and thus reduce circuit space, we explore the use of iterative encoding techniques which are based upon the graphical representation of the code. We design codes by identifying associated encoder convergence constraints and also eliminating some well known undesirable properties for sum-product decoding such as 4-cycles. In particular we show how the Jacobi method for iterative matrix inversion can be viewed as message passing and employed as the core of an iterative encoder. Example constructions of both regular and irregular LDPC codes that are encodable using this method are investigated.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124281179","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188417
D. Arnold, E. Eleftheriou
An information-theoretic method is presented for computing information rates of magnetic recording channels with medium noise, assuming 0.5-Bernoulli as well as optimized Markov input processes. The method is based on the well-known conjectured Shamai-Laroia bound. The compound behavior of the magnetic recording channel is modelled by combining the Lorentzian read-back pulse, the microtrack channel model, and additive white Gaussian noise (AWGN). Numerical results are provided that show that from an information theoretic viewpoint in certain cases medium noise is preferable to AWGN.
{"title":"Computing information rates of magnetic recording channels in the presence of medium noise","authors":"D. Arnold, E. Eleftheriou","doi":"10.1109/GLOCOM.2002.1188417","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188417","url":null,"abstract":"An information-theoretic method is presented for computing information rates of magnetic recording channels with medium noise, assuming 0.5-Bernoulli as well as optimized Markov input processes. The method is based on the well-known conjectured Shamai-Laroia bound. The compound behavior of the magnetic recording channel is modelled by combining the Lorentzian read-back pulse, the microtrack channel model, and additive white Gaussian noise (AWGN). Numerical results are provided that show that from an information theoretic viewpoint in certain cases medium noise is preferable to AWGN.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"411 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114345557","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188163
Guocong Song, Ye Li
In this paper, joint physical-MAC layer optimization in OFDM systems using adaptive modulation and subcarrier allocation is investigated based on utility theory. Since utility qualifies the level of users' satisfaction derived from the radio resources they occupy, it is ideal for a network optimization metric. We formulate the cross-layer optimization problem as one that maximizes the sum of the utilities over all active users through rate adaptation and dynamic subcarrier allocation with the limited radio resource and time-varying wireless channel constraints. Two effective subcarrier allocation algorithms with low complexity are proposed to solve the constrained optimization problem. Simulation results demonstrate the significant improvement of utility-based cross-layer optimization in OFDM.
{"title":"Utility-based joint physical-MAC layer optimization in OFDM","authors":"Guocong Song, Ye Li","doi":"10.1109/GLOCOM.2002.1188163","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188163","url":null,"abstract":"In this paper, joint physical-MAC layer optimization in OFDM systems using adaptive modulation and subcarrier allocation is investigated based on utility theory. Since utility qualifies the level of users' satisfaction derived from the radio resources they occupy, it is ideal for a network optimization metric. We formulate the cross-layer optimization problem as one that maximizes the sum of the utilities over all active users through rate adaptation and dynamic subcarrier allocation with the limited radio resource and time-varying wireless channel constraints. Two effective subcarrier allocation algorithms with low complexity are proposed to solve the constrained optimization problem. Simulation results demonstrate the significant improvement of utility-based cross-layer optimization in OFDM.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117263367","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1189055
K. Kim, Hiroshi Okagawa, K. Shrikhande, L. Kazovsky
Optical carrier sense multiple access with collision avoidance (CSMA/CA) is a media access control (MAC) protocol proposed for future metropolitan area wavelength division multiplexing (WDM) ring networks with a fixed receiver and a tunable transmitter at access nodes. In this paper, we focus on the unslotted version of the optical CSMA/CA MAC which is a fully-distributed and asynchronous protocol. We present the results of design and performance evaluation of fairness control schemes based on longest queue first (LQF) scheduling and two random routing algorithms - full random routing (FRR) and partial random routing (PRR). Through extensive network-level simulation of a WDM ring network with 10 nodes and 10 wavelengths on a 100 km ring at 10 Gbit/s line rate, we demonstrate a combination of the LQF scheduling and the PRR with a retransmission counter provides good fairness (fairness index of 0.9995) with high bandwidth efficiency and small delay spread, under highly unbalanced traffic conditions.
CSMA/CA (Optical carrier sense multiple access with collision avoidance)是针对未来城域网波分复用(WDM)环网提出的一种媒体访问控制(MAC)协议，该网络在接入节点上具有固定的接收端和可调谐的发送端。本文主要研究CSMA/CA无槽版本的全分布式异步协议CSMA/CA MAC。给出了基于最长队列优先(LQF)调度和两种随机路由算法——完全随机路由(FRR)和部分随机路由(PRR)的公平性控制方案的设计和性能评价结果。通过对100 km环上10个节点、10个波长、10 Gbit/s线速率的WDM环网进行广泛的网络级仿真，我们证明了LQF调度和带重传计数器的PRR的组合在高度不平衡的业务条件下具有良好的公平性(公平性指数为0.9995)、高带宽效率和小延迟扩展。
{"title":"Unslotted optical CSMA/CA MAC protocol with fairness control in metro WDM ring networks","authors":"K. Kim, Hiroshi Okagawa, K. Shrikhande, L. Kazovsky","doi":"10.1109/GLOCOM.2002.1189055","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189055","url":null,"abstract":"Optical carrier sense multiple access with collision avoidance (CSMA/CA) is a media access control (MAC) protocol proposed for future metropolitan area wavelength division multiplexing (WDM) ring networks with a fixed receiver and a tunable transmitter at access nodes. In this paper, we focus on the unslotted version of the optical CSMA/CA MAC which is a fully-distributed and asynchronous protocol. We present the results of design and performance evaluation of fairness control schemes based on longest queue first (LQF) scheduling and two random routing algorithms - full random routing (FRR) and partial random routing (PRR). Through extensive network-level simulation of a WDM ring network with 10 nodes and 10 wavelengths on a 100 km ring at 10 Gbit/s line rate, we demonstrate a combination of the LQF scheduling and the PRR with a retransmission counter provides good fairness (fairness index of 0.9995) with high bandwidth efficiency and small delay spread, under highly unbalanced traffic conditions.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116278091","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1189038
F. Chiussi, A. Francini, G. Galante, Emilio Leonardi
We present the Distributed Frame-Definition Algorithm (DFDA), a novel scheduling policy for input-queued switches with virtual output queueing at the input line cards. The DFDA effectively supports the integration of traffic classes with diverse Quality-of-Service (QoS) requirements (as compelled by emerging QoS frameworks such as Differentiated Services), and scales well with the aggregate capacity of the switch because of the limited complexity of its distributed implementation. The input and output tine cards exchange a minimal amount of control information to define the periodic service schedule that regulates transit through the switch fabric. The composition of the service schedule dynamically adapts to the tight bandwidth requirements of real-time traffic and to the load fluctuations of best-effort traffic. We assess the performance of the DFDA through simulation, and compare it with the most popular scheduling algorithms for input-queued switches. Our experiments show that the DFDA generally sustains higher throughput than the schemes of the prior art.
{"title":"A novel highly-scalable matching policy for input-queued switches with multiclass traffic","authors":"F. Chiussi, A. Francini, G. Galante, Emilio Leonardi","doi":"10.1109/GLOCOM.2002.1189038","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1189038","url":null,"abstract":"We present the Distributed Frame-Definition Algorithm (DFDA), a novel scheduling policy for input-queued switches with virtual output queueing at the input line cards. The DFDA effectively supports the integration of traffic classes with diverse Quality-of-Service (QoS) requirements (as compelled by emerging QoS frameworks such as Differentiated Services), and scales well with the aggregate capacity of the switch because of the limited complexity of its distributed implementation. The input and output tine cards exchange a minimal amount of control information to define the periodic service schedule that regulates transit through the switch fabric. The composition of the service schedule dynamically adapts to the tight bandwidth requirements of real-time traffic and to the load fluctuations of best-effort traffic. We assess the performance of the DFDA through simulation, and compare it with the most popular scheduling algorithms for input-queued switches. Our experiments show that the DFDA generally sustains higher throughput than the schemes of the prior art.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116493993","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}
Pub Date : 2002-11-17DOI: 10.1109/GLOCOM.2002.1188074
A. Conti, D. Dardari, G. Pasolini, O. Andrisano
In this article the issue of Bluetooth and IEEE802.11b coexistence in a heterogeneous environment is addressed by means of an analytical approach. The methodology proposed carefully takes physical (i.e., thermal noise, propagation, interference, modulation formats and coding techniques) as well as medium access control (frequency hopping, packet structures, traffic loads) aspects into account. This model can be easily implemented when developing system simulators avoiding, thus, the need of extensive bit level Monte-Carlo simulations at the physical level. Furthermore, having preliminarily fixed a quality of service level, namely the target mean PEP, we derive the coexistence domain of the two considered systems in terms of relative distance.
{"title":"Bluetooth performance analysis under IEEE802.11 interference in a fading channel","authors":"A. Conti, D. Dardari, G. Pasolini, O. Andrisano","doi":"10.1109/GLOCOM.2002.1188074","DOIUrl":"https://doi.org/10.1109/GLOCOM.2002.1188074","url":null,"abstract":"In this article the issue of Bluetooth and IEEE802.11b coexistence in a heterogeneous environment is addressed by means of an analytical approach. The methodology proposed carefully takes physical (i.e., thermal noise, propagation, interference, modulation formats and coding techniques) as well as medium access control (frequency hopping, packet structures, traffic loads) aspects into account. This model can be easily implemented when developing system simulators avoiding, thus, the need of extensive bit level Monte-Carlo simulations at the physical level. Furthermore, having preliminarily fixed a quality of service level, namely the target mean PEP, we derive the coexistence domain of the two considered systems in terms of relative distance.","PeriodicalId":415837,"journal":{"name":"Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123466004","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：