共查询到20条相似文献，搜索用时 15 毫秒
1.
While link allocation policies in multi-rate circuit switched loss models have drawn much attention in recent years, it is still an open question how to share the link capacity between service classes in a fair manner. In particular, when an ATM link is offered calls from service classes with/without strict QoS guarantees one is interested in link capacity sharing policies that maximize throughput and keep the per-class blocking probabilities under some GoS constraints. In this paper we propose a model and associated computational technique for an ATM transmission link to which CBR/VBR and ABR classes offer calls. We also propose a simple link allocation rule which takes into account blocking probability constraints for the CBR/VBR calls and a throughput constraint for the ABR calls and attempts to minimize the blocking probability of ABR calls. Numerical examples demonstrate the effectiveness of the policy and of the applied computational technique. 相似文献
2.
Gábor Fodor 《International Journal of Communication Systems》2007,20(2):207-233
We consider an interference‐limited code division multiple access (CDMA) network, in which some of the service classes are explicit rate controlled. Such rate‐controlled service classes include adaptive ones whose holding time does not depend on the sending rate, while the holding time of elastic services becomes longer when their sending rate is slowed down. We develop a Markov model that allows us to study the impact of employing service differentiation (prioritization) during admission control and rate control on the classwise blocking probabilities and throughputs. The admission control takes into account the interference from adjacent cells as a log‐normally distributed random variable and employs service class and state‐dependent (soft) blocking in addition to hard blocking. The state‐dependent rate control algorithm takes into account the minimum and maximum requested rates of admitted sessions in a fairness policy‐dependent manner. Our conclusion is that work conserving bandwidth sharing policies may have a major impact on the moments of the time spent in the system by elastic services, but only a minor one on the classwise blocking probabilities. When the admission control algorithm takes into account the neighbour cell caused interference, the blocking probability of all classes increases somewhat, but the throughput of the accepted sessions increases. Blocking prioritization in the soft blocking model affects the classwise total blocking probabilities but has little impact on the throughput of adaptive and elastic traffic. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
3.
RLC (radio link control) is a layer 2 protocol of LTE used for reliable transmission of data packets in communication networks. This protocol operates in three modes, namely, transparent mode (TM), unacknowledged mode (UM), and acknowledged mode (AM). In this paper, analytical models are developed to study the flow of data streams in all the three modes of the RLC protocol. Stochastic reward net (SRN) is adopted as a modeling technique as it easily captures various aspects of this protocol such as protocol data unit (PDU) transmission, assigning header with each PDU, requesting for status report, retransmission of PDU(s), management of PDU losses due to expiration of various timers (quick repeat timer, poll timer, status timer). Throughput, average delay and probability of PDU loss are evaluated as the performance measures using the SRN models. Based on these performance measures, a comparative study between the UM and AM is presented which depicts that the modes are performing their key functions decently. Analytical results are also validated via simulation. 相似文献
4.
通过对联通主要供货商的2.1GHz WCDMA RRU设备进行阻塞指标测试和干扰测试,验证了1.9GHz TD-LTE确实对2.1GHz WCDMA设备存在非常严重的干扰,WCDMA设备的吞吐量损失超过95%.最后,结合联通WCDMA网络情况给出避免干扰的解决方案. 相似文献
5.
Chia‐Cheng Hu 《Wireless Communications and Mobile Computing》2012,12(2):206-218
Previous quality‐of‐service (QoS) routing protocols in mobile ad hoc networks (MANETs) determined bandwidth‐satisfied routes for QoS applications. Since the multi‐rate enhancements have been implemented in MANETs, QoS routing protocols should be adapted to exploit them fully. However, existing works suffer from one bandwidth‐violation problem, named the hidden route problem (HRP), which may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Without considering the bandwidth consumption to ongoing flows is the reason the problem is introduced. This work proposes a routing protocol that can avoid HRP for data rate selection and bandwidth‐satisfied route determination with an efficient cross‐layer design based on the integration of PHY and MAC layers into the network layer. To use bandwidth efficiently, we aim to select the combination of data rates and a route with minimal bandwidth consumption to the network, instead of the strategy adopted in the most previous works by selecting the combination with the shortest total transmission time. Using bandwidth efficiently can increase the number of flows supported by a network. Copyright 2010 John Wiley & Sons, Ltd. 相似文献
6.
Jyh‐Horng Wen Jee‐Wey Wang Jyh‐Yeuan Chang 《International Journal of Communication Systems》2000,13(5):405-421
The integration of voice and data services over PACS systems using a movable boundary scheme is studied. First, we use the theory of discrete‐time Markov chain to analyse the system; then, an approximate analysis using the continuous‐time Markov chain model is conducted. For the initial access of voice calls we consider two distinct schemes: at most one idle slot being marked available, and all the idle slots being marked available. Numerical results show that the performance difference for voice calls between both schemes is trivial, but the former scheme offers a performance advantage for data calls over the latter scheme. Besides, the performance obtained by the continuous‐time Markov model is very close to that obtained by the discrete‐time Markov model. This finding suggests the effectiveness of the usage of the continuous‐time Markov model, which can dramatically simplify the analysis. Copyright © 2000 John Wiley & Sons, Ltd. 相似文献
7.
We consider a multi‐rate system where stream and elastic flows receive service. Both the stream and the elastic classes are associated with peak rate limitation. In contrast to the constant bit rate stream flows, the elastic flows tolerate bandwidth compression while in service. Because of the occasional bandwidth compression, the holding time of elastic flows depends on their perceived throughput. Although this model is Markovian under quite non‐restrictive assumptions, the model's state space grows exponentially with the number of traffic classes. The model is not quasi‐reversible, and therefore, it cannot be evaluated by efficient recursive formulae. We propose a method whereby the original state space is mapped to a two‐dimensional one, independently of the number of the stream and the elastic traffic classes. The special structure of the two‐dimensional model allows us to develop an efficient method that approximates the average throughputs of elastic flows. The state space reduction together with the proposed approximation provides a powerful tool for the performance analysis of this model as it allows the approximation of the average throughputs of elastic flows reasonably accurately in large models as well. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
8.
Der‐Jiunn Deng Bin Li Lianfen Huang Chih‐Heng Ke Yueh‐Min Huang 《Wireless Communications and Mobile Computing》2009,9(8):1102-1112
IEEE 802.11 protocol supports adaptive rate mechanism, which selects the transmission rate according to the condition of the wireless channel, to enhance the system performance. Thus, research of multi‐rate IEEE 802.11 medium access control (MAC) performance has become one of the hot research topics. In this paper, we study the performance of multi‐rate IEEE 802.11 MAC over a Gaussian channel. An accurate analytical model is presented to compute the system saturation throughput. We validate our model in both single‐rate and multi‐rate networks through various simulations. The results show that our model is accurate and channel error has a significant impact on system performance. In addition, our numerical results show that the performance of single‐rate IEEE 802.11 DCF with basic access method is better than that with RTS/CTS mechanism in a high‐rate and high‐load network and vice versa. In a multi‐rate network, the performance of IEEE 802.11 DCF with RTS/CTS mechanism is better than that with basic access method in a congested and error‐prone wireless environment. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
9.
Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
10.
In this paper, we address the issue of multi‐user receiver design in realistic multi‐cellular and multi‐rate CDMA systems based on performance analysis. We consider the multi‐user detection (MUD) technique, denoted interference subspace rejection (ISR), because it offers a wide range of canonic suppression modes that range in performance and complexity between interference cancellers and linear receivers. To further broaden our study, we propose a modified ISR scheme called hybrid ISR to cope better with multi‐rate transmissions. The performance analysis, which is based on the Gaussian assumption (GA) and validated by simulations, takes into account data estimation errors, carrier frequency mismatch, imperfect power control, identification errors of time‐varying multipath Rayleigh channels and intercell interference. This analysis enables us to optimize the selection of the MUD mode for multi‐rate transmissions in different operating conditions. The effectiveness of interference cancellation is indeed investigated under different mobile speeds, numbers of receiving antennas, near‐far situations, channel estimation errors, and out‐cell to in‐cell interference ratios. This investigation suggests that the out‐of‐cell interference, the residual in‐cell interference, the noise enhancement as well as low mobility favor the simplest MUD modes as they offer the best performance/complexity tradeoffs. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
11.
Shabnam Sodagari Sven G. Biln 《Transactions on Emerging Telecommunications Technologies》2011,22(8):515-521
We present a framework and pertinent formulations for a coalition of secondary cognitive radios that are willing to lease inactive spectrum band from a primary system through auctioning and to share the received bandwidth and the associated cost among themselves using multiple access techniques. We cast this scenario to submodular class of games and show how a link can be established between the truthful auctioning mechanism and the cost‐sharing algorithm. Simulation results verify that the deployed cost‐sharing technique leads to encouraging the secondary cognitive radios to truthfully announce their bids. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
12.
13.
Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed. 相似文献
14.
15.
16.
VanDung Nguyen Tran Trong Khanh Xuan‐Qui Pham Ga‐Won Lee Eui‐Nam Huh 《International Journal of Communication Systems》2020,33(1)
The existing adaptive multichannel medium access control (MAC) protocols in vehicular ad hoc networks can adjust themselves according to different vehicular traffic densities. These protocols can increase throughput and guarantee a bounded transmission delay for real‐time safety applications. However, the optimized control channel interval is computed based on the maximum throughput while ignoring the strict safety packet transmission delay requirements. In this paper, we analyze the effects of the throughput and strict safety packet transmission delay with adaptive multichannel MAC protocols, such as connectivity‐aware MAC (CA MAC), adaptive multi‐priority distributed MAC (APDM), multi‐priority supported p‐persistent MAC (MP MAC), and variable control channel interval MAC (VCI) protocols. The performance and analysis results show that: (a) under a low data rate condition, CA MAC does not guarantee a strict safety packet transmission delay; (b) APDM not only satisfies the safety packet transmission requirement, but also provides the lowest safety packet transmission delay; (c) under a high data rate condition, we suggest APDM for use as an adaptive MAC protocol because it allows for high throughput for nonsafety packets and preserves low safety packet transmission delay; (d) under a low data rate condition with various data packet sizes, we suggest MP MAC for high throughput, which satisfies the safety packet transmission requirement; and (e) under low vehicle density and low data rate conditions, VCI can support high throughput. A balance between transmission delay and throughput must be considered to improve the optimal efficiency, reliability, and adaptability. 相似文献
17.
Vassilios G. Vassilakis Ioannis D. Moscholios Michael D. Logothetis 《International Journal of Communication Systems》2012,25(7):849-873
Firstly, we reviewed two extensions of the Erlang multi‐rate loss model, whereby we can assess the call‐level QoS of telecom networks supporting elastic traffic: (i) the extended Erlang multi‐rate loss model, where random arriving calls of certain bandwidth requirements at call setup can tolerate bandwidth compression while in service; and (ii) the connection‐dependent threshold model, where arriving calls may have several contingency bandwidth requirements, whereas in‐service calls cannot tolerate bandwidth compression. Secondly, we proposed a new model, the extended connection‐dependent threshold model. Calls may have alternative bandwidth requirements at call setup and can tolerate bandwidth compression while in service. We proposed a recurrent formula for the efficient calculation of link occupancy distribution and consequently call blocking probabilities, link utilization, and throughput per service class. Furthermore, in the proposed model, we incorporated the bandwidth reservation policy, whereby we can (i) equalize the call blocking probabilities of different service classes, (ii) guarantee specific QoS per service class, and (iii) implement different maximum bandwidth compression/expansion rate per service class so that the network supports both elastic and stream traffic. The accuracy of the new model is verified by simulation. Moreover, the proposed model performs better than the existing models. Finally, we generalize the proposed model by incorporating service classes with either random or quasi‐random arrivals. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
18.
Yongxuan Lai Zhengkun Chen Weicong Wu Tianli Ma 《Wireless Communications and Mobile Computing》2015,15(16):1991-2003
19.
针对当前已有圆极化微带天线有效带宽窄、尺寸大等缺陷的现状,设计了一种应用于2.4GHz无线传感网络的宽带圆极化微带天线.采用AnsoftHFSS建立了天线的模型,并对其主要结构参数进行了仿真分析,最终推导出了天线的最优结构参数.最优结构参数下的仿真结果显示,天线的-10dB阻抗带宽达到了63.5%,3dB轴比(axialratio,AR)带宽达到了17.5%.同时,采用矢量网络分析仪对天线实物进行了回波损耗测试,测试结果与仿真结果吻合.最后,将设计的天线加载到CY2420通信节点上进行通信性能的测试,测试结果表明:加载了该宽带圆极化微带天线的节点在150m处的平均丢包率为0.36%,且天线任意方向下的丢包率基本相同.从测试结果可以看出该天线具有良好的圆极化特性和实用特性. 相似文献
20.
为了提高系统性能并最大限度降低算法实现复杂度,本文提出了一种新的高清视频联网系统中丢包率的更优近似分析方法,重点研究包长度对丢包率的影响。首先使用马尔可夫链模型估算数据包的误码率,进而得出数据包网络时延的概率分布,最后计算出基于包长度的丢包率的理论表达式。仿真结果表明,通过减小发包大小可以有效降低丢包率,同时基于包长度的丢包率的理论分析方法可以有效地运用到高清视频联网系统的分析研究中。 相似文献