Pub Date : 2011-11-15DOI: 10.1109/LANMAN.2011.6076922
Pasquale Gurzi, K. Steenhaut, A. Nowé, Peter Vrancx
In today's Internet the commercial aspect of routing is gaining more and more importance. Commercial agreements between ISPs (i.e. transit and peering agreements) influence the inter-domain routing policies which are now driven by monetary aspects as well as global resource and performance optimization. To allow scalability and protect business critical topology information, hierarchical routing and topology aggregation became a fundamental issue in modern inter-domain networks. In this paper, we introduce a pricing mechanism that takes into account the effects of load dependent internal costs on the domain income and allows ISPs to set link prices during the topology aggregation process. We adapt a Continuous Action Reinforcement Learning Automata (CARLA), to operate in this framework as a tool used by ISP operators to learn the best price according to the network state. The reinforcement signal is proportional only to the domain's utility (i.e. profit) and thus does not need any central authority or sensitive information exchange among domains. Simulation results show that one ISP using CARLA can significantly improve its utility compared to other ISPs that statically choose their link prices. When two ISPs employ the same CARLA they can reach an equilibrium strategy while still improving their utilities.
{"title":"Learning a pricing strategy in multi-domain DWDM networks","authors":"Pasquale Gurzi, K. Steenhaut, A. Nowé, Peter Vrancx","doi":"10.1109/LANMAN.2011.6076922","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076922","url":null,"abstract":"In today's Internet the commercial aspect of routing is gaining more and more importance. Commercial agreements between ISPs (i.e. transit and peering agreements) influence the inter-domain routing policies which are now driven by monetary aspects as well as global resource and performance optimization. To allow scalability and protect business critical topology information, hierarchical routing and topology aggregation became a fundamental issue in modern inter-domain networks. In this paper, we introduce a pricing mechanism that takes into account the effects of load dependent internal costs on the domain income and allows ISPs to set link prices during the topology aggregation process. We adapt a Continuous Action Reinforcement Learning Automata (CARLA), to operate in this framework as a tool used by ISP operators to learn the best price according to the network state. The reinforcement signal is proportional only to the domain's utility (i.e. profit) and thus does not need any central authority or sensitive information exchange among domains. Simulation results show that one ISP using CARLA can significantly improve its utility compared to other ISPs that statically choose their link prices. When two ISPs employ the same CARLA they can reach an equilibrium strategy while still improving their utilities.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122519919","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076944
Oscar Olvera-Irigoyen, A. Kortebi, L. Toutain, David Ros
A number of studies show that most of current probing tools, for available bandwidth, exhibit low accuracy, and slow convergence in Home Networks. Some reasons of this behavior include the high queuing variability of probing flows, which is induced by multiple-access mechanisms, time-variant capacity links of hybrid paths, and the instability of beta probing tools. Considering these constrains of the measurement process and the limitations of probing-tools, this paper proposes using Iperf in a lightweight mode to obtain maximum throughput of non-disruptive TCP flows to estimate the available bandwidth. Our experimental results show that Iperf doubles the accuracy of the estimates compared with IGI/PTR, Pathchirp and Wbest, on representative hybrid paths. We also show that due to the low bandwidth delay products (BDP), of home network paths, we can keep low overhead using TCP flows with convenient probing/polling intervals, which reduces the intrusiveness associated to the default Iperf usage.
{"title":"Available bandwidth probing in hybrid home networks","authors":"Oscar Olvera-Irigoyen, A. Kortebi, L. Toutain, David Ros","doi":"10.1109/LANMAN.2011.6076944","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076944","url":null,"abstract":"A number of studies show that most of current probing tools, for available bandwidth, exhibit low accuracy, and slow convergence in Home Networks. Some reasons of this behavior include the high queuing variability of probing flows, which is induced by multiple-access mechanisms, time-variant capacity links of hybrid paths, and the instability of beta probing tools. Considering these constrains of the measurement process and the limitations of probing-tools, this paper proposes using Iperf in a lightweight mode to obtain maximum throughput of non-disruptive TCP flows to estimate the available bandwidth. Our experimental results show that Iperf doubles the accuracy of the estimates compared with IGI/PTR, Pathchirp and Wbest, on representative hybrid paths. We also show that due to the low bandwidth delay products (BDP), of home network paths, we can keep low overhead using TCP flows with convenient probing/polling intervals, which reduces the intrusiveness associated to the default Iperf usage.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"394 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115993618","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076932
Umang Patel, Trisha Biswas, R. Dutta
Wireless networks are susceptible to localized disruptions, due to the shared nature of the medium. Radio jamming, the most common type of localized disruption causes wireless link failures. Jamming mitigation has been traditionally addressed in the physical and MAC layers. Such approaches come with added complexity and often require specialized hardware. We investigate whether a generally applicable routing layer approach, based on multipath routing coupled with power control, can mitigate the effects of jamming. We propose (1) proactive protection and (2) reactive protection techniques for jamming mitigation in wireless multihop networks with fixed nodes. For reactive protection, we propose a distributed geographic routing algorithm that finds alternative route to the destination, starting from the first node with failed link on the original path. We evaluate the performance of this algorithm using OPNET simulations.
{"title":"A routing approach to jamming mitigation in wireless multihop networks","authors":"Umang Patel, Trisha Biswas, R. Dutta","doi":"10.1109/LANMAN.2011.6076932","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076932","url":null,"abstract":"Wireless networks are susceptible to localized disruptions, due to the shared nature of the medium. Radio jamming, the most common type of localized disruption causes wireless link failures. Jamming mitigation has been traditionally addressed in the physical and MAC layers. Such approaches come with added complexity and often require specialized hardware. We investigate whether a generally applicable routing layer approach, based on multipath routing coupled with power control, can mitigate the effects of jamming. We propose (1) proactive protection and (2) reactive protection techniques for jamming mitigation in wireless multihop networks with fixed nodes. For reactive protection, we propose a distributed geographic routing algorithm that finds alternative route to the destination, starting from the first node with failed link on the original path. We evaluate the performance of this algorithm using OPNET simulations.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121917000","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076925
A. Metnani, B. Jaumard
Traffic grooming consists of packing low rate streams onto a high speed lightpath in order to effectively use the network resources. Under dynamic traffic, rerouting of ongoing connections has been envisioned as a means, to be used very wisely, to reduce the connection blocking rate and to optimize the network resources. In a context of traffic with QoS constraints, only the delay tolerant ongoing connections are rerouted. In this paper, we design three new heuristics, one relying on a mathematical ILP (Integer Linear Program) model and two low complexity ones to carefully reroute ongoing connection requests in order to accommodate the new incoming connection requests, while minimizing connection disturbance. While the ILP model allows the full exploration of a limit on the overall number of reroutings, both heuristics are designed as low complexity heuristics in order to limit the number of rerouting per establishment of a new incoming connection request. Comparative computational results show that the two low complexity heuristics provide much better results in terms of the best compromise between maximizing the throughput and minimizing the number of disturbances of the already established connection requests.
{"title":"Connection rerouting in GRWA networks","authors":"A. Metnani, B. Jaumard","doi":"10.1109/LANMAN.2011.6076925","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076925","url":null,"abstract":"Traffic grooming consists of packing low rate streams onto a high speed lightpath in order to effectively use the network resources. Under dynamic traffic, rerouting of ongoing connections has been envisioned as a means, to be used very wisely, to reduce the connection blocking rate and to optimize the network resources. In a context of traffic with QoS constraints, only the delay tolerant ongoing connections are rerouted. In this paper, we design three new heuristics, one relying on a mathematical ILP (Integer Linear Program) model and two low complexity ones to carefully reroute ongoing connection requests in order to accommodate the new incoming connection requests, while minimizing connection disturbance. While the ILP model allows the full exploration of a limit on the overall number of reroutings, both heuristics are designed as low complexity heuristics in order to limit the number of rerouting per establishment of a new incoming connection request. Comparative computational results show that the two low complexity heuristics provide much better results in terms of the best compromise between maximizing the throughput and minimizing the number of disturbances of the already established connection requests.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131362462","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076924
Rebecca Lovewell, J. Kaur
The packet-scale paradigm is a novel framework for achieving ultra-high speed congestion control. Due to its reliance on finely-controlled inter-packet gaps, the paradigm is expected to be sensitive to transient burstiness in traffic encountered on bottleneck links. This paper uses a first-principles approach to study the impact of cross traffic burstiness on the efficiency of the packet-scale paradigm. It relies on a simple periodic on-off model for cross traffic and studies the interaction of the burstiness timescale, round-trip times, and the smoothing filters adopted by the paradigm. The analysis is validated against ns-2 simulations with a prototype. Our analysis helps gain fundamental insights on the impact of several factors.
{"title":"Impact of cross traffic burstiness on the packet-scale paradigm","authors":"Rebecca Lovewell, J. Kaur","doi":"10.1109/LANMAN.2011.6076924","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076924","url":null,"abstract":"The packet-scale paradigm is a novel framework for achieving ultra-high speed congestion control. Due to its reliance on finely-controlled inter-packet gaps, the paradigm is expected to be sensitive to transient burstiness in traffic encountered on bottleneck links. This paper uses a first-principles approach to study the impact of cross traffic burstiness on the efficiency of the packet-scale paradigm. It relies on a simple periodic on-off model for cross traffic and studies the interaction of the burstiness timescale, round-trip times, and the smoothing filters adopted by the paradigm. The analysis is validated against ns-2 simulations with a prototype. Our analysis helps gain fundamental insights on the impact of several factors.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130391913","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}
Network management and automated configuration of large-scale networks is one of the crucial issues for Internet Service Providers (ISPs). Since wrong configurations might lead to an enormous amount of customer traffic to be lost, highly experienced network administrators are typically the ones who are trusted for the management and configuration of a running ISP network. We frame the management and experimentation of a network as a “game” for training network administrators without having to risk the network operation. The interactive environment treats the trainee network administrators as players of a game and tests them with various network failures or dynamics. To prototype the concept of “network management as a game”, we modified NS-2 to establish an interactive simulation engine and connected the modified engine to a graphical user interface for traffic animation and interactivity with the player. We present initial results from our game applied to a small set of players.
{"title":"Network management game","authors":"Engin Arslan, M. Yuksel, M. H. Gunes","doi":"10.1145/2427036.2427045","DOIUrl":"https://doi.org/10.1145/2427036.2427045","url":null,"abstract":"Network management and automated configuration of large-scale networks is one of the crucial issues for Internet Service Providers (ISPs). Since wrong configurations might lead to an enormous amount of customer traffic to be lost, highly experienced network administrators are typically the ones who are trusted for the management and configuration of a running ISP network. We frame the management and experimentation of a network as a “game” for training network administrators without having to risk the network operation. The interactive environment treats the trainee network administrators as players of a game and tests them with various network failures or dynamics. To prototype the concept of “network management as a game”, we modified NS-2 to establish an interactive simulation engine and connected the modified engine to a graphical user interface for traffic animation and interactivity with the player. We present initial results from our game applied to a small set of players.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130705863","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076921
Amitangshu Pal, A. Nasipuri
We present an analytical model to evaluate the performance of the IEEE 802.11 Distributed Coordination Function (DCF) with and without the RTS/CTS handshake in radio-over-fiber (RoF) wireless LANs. The model captures the effects of contending nodes as well as hidden terminals under non-saturated traffic conditions assuming large buffer sizes. The effect of fiber propagation delay is considered. The proposed models are validated using computer simulations. Comprehensive performance evaluations of RoF networks obtained from the proposed model as well as simulations are presented.
{"title":"Performance analysis of IEEE 802.11 distributed coordination function in presence of hidden stations under non-saturated conditions with infinite buffer in radio-over-fiber wireless LANs","authors":"Amitangshu Pal, A. Nasipuri","doi":"10.1109/LANMAN.2011.6076921","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076921","url":null,"abstract":"We present an analytical model to evaluate the performance of the IEEE 802.11 Distributed Coordination Function (DCF) with and without the RTS/CTS handshake in radio-over-fiber (RoF) wireless LANs. The model captures the effects of contending nodes as well as hidden terminals under non-saturated traffic conditions assuming large buffer sizes. The effect of fiber propagation delay is considered. The proposed models are validated using computer simulations. Comprehensive performance evaluations of RoF networks obtained from the proposed model as well as simulations are presented.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127583961","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076926
Hui Wang, G. Rouskas
We address the issue of ensuring the integrity and privacy of communications in optical networks. To this end, we extend the traffic grooming concept to encompass flow isolation considerations through a multi-class traffic model. We develop, solve, and compare ILP formulations that ensure that only traffic components within the same class are groomed onto (share) the same wavelength. Our approach provides flow isolation guarantees with an increase in overall cost as a tradeoff.
{"title":"Flow isolation in optical networks","authors":"Hui Wang, G. Rouskas","doi":"10.1109/LANMAN.2011.6076926","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076926","url":null,"abstract":"We address the issue of ensuring the integrity and privacy of communications in optical networks. To this end, we extend the traffic grooming concept to encompass flow isolation considerations through a multi-class traffic model. We develop, solve, and compare ILP formulations that ensure that only traffic components within the same class are groomed onto (share) the same wavelength. Our approach provides flow isolation guarantees with an increase in overall cost as a tradeoff.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166474","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076940
V. Aggarwal, R. Jana, Jeffrey Pang, Kadangode K. Ramakrishnan, N. K. Shankaranarayanan
The end to end system data performance over a 3G cellular network depends on many factors such as the number of users, interference, multipath propagation, radio resource management techniques as well as the interaction between these mechanisms and the transport protocol's flow and congestion mechanisms. Using controlled experiments in a public cell site, we investigate the interaction between TCP and the 3G UMTS/HSPA network's resource allocation, and its effect on fairness in the throughput achieved across multiple (up to 26) TCP flows in a loaded cell sector. Our field measurement results indicate that TCP fairness fluctuates significantly when the air interface (radio link) is the bottleneck. We also observe that TCP fairness is substantially better when the backhaul link (a fixed wired link) is the bottleneck, instead of the air interface. We speculate that the fairness of TCP flows is adversely impacted by the mismatch between the resource allocation mechanisms of TCP's flow and congestion control and that of the Radio Access Network (RAN).
{"title":"Characterizing fairness for 3G wireless networks","authors":"V. Aggarwal, R. Jana, Jeffrey Pang, Kadangode K. Ramakrishnan, N. K. Shankaranarayanan","doi":"10.1109/LANMAN.2011.6076940","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076940","url":null,"abstract":"The end to end system data performance over a 3G cellular network depends on many factors such as the number of users, interference, multipath propagation, radio resource management techniques as well as the interaction between these mechanisms and the transport protocol's flow and congestion mechanisms. Using controlled experiments in a public cell site, we investigate the interaction between TCP and the 3G UMTS/HSPA network's resource allocation, and its effect on fairness in the throughput achieved across multiple (up to 26) TCP flows in a loaded cell sector. Our field measurement results indicate that TCP fairness fluctuates significantly when the air interface (radio link) is the bottleneck. We also observe that TCP fairness is substantially better when the backhaul link (a fixed wired link) is the bottleneck, instead of the air interface. We speculate that the fairness of TCP flows is adversely impacted by the mismatch between the resource allocation mechanisms of TCP's flow and congestion control and that of the Radio Access Network (RAN).","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115394461","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 : 2011-11-15DOI: 10.1109/LANMAN.2011.6076942
Christoph Ide, Bjoern Dusza, C. Wietfeld
The performance evaluation of mobile communication systems for time varying environments poses a major challenge. To address this issue, in this paper we propose an approach which extends a common laboratory environment by a fading channel emulator. Hereby, we analyze OFDM based links under complex and realistic radio channel conditions including upper layer protocols. By means of this setup, the influence of velocity on the data rate and Packet Error Rate (PER) of a Mobile WiMAX system is investigated for various Signal to Noise Ratios (SNR) assuming vehicular and pedestrian channel models defined by the ITU. As a result, we analyzed the performance of Mobile WiMAX for Adaptive Modulation and Coding (AMC) dependent on the QoS target, the channel model, the user velocity and the SNR. Hereby, we assumed two partially contrary QoS targets, high data rate and target PER.
{"title":"Mobile WiMAX performance measurements with focus on different QoS targets","authors":"Christoph Ide, Bjoern Dusza, C. Wietfeld","doi":"10.1109/LANMAN.2011.6076942","DOIUrl":"https://doi.org/10.1109/LANMAN.2011.6076942","url":null,"abstract":"The performance evaluation of mobile communication systems for time varying environments poses a major challenge. To address this issue, in this paper we propose an approach which extends a common laboratory environment by a fading channel emulator. Hereby, we analyze OFDM based links under complex and realistic radio channel conditions including upper layer protocols. By means of this setup, the influence of velocity on the data rate and Packet Error Rate (PER) of a Mobile WiMAX system is investigated for various Signal to Noise Ratios (SNR) assuming vehicular and pedestrian channel models defined by the ITU. As a result, we analyzed the performance of Mobile WiMAX for Adaptive Modulation and Coding (AMC) dependent on the QoS target, the channel model, the user velocity and the SNR. Hereby, we assumed two partially contrary QoS targets, high data rate and target PER.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123008058","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
扫码关注我们
求助内容：
应助结果提醒方式：