共查询到20条相似文献,搜索用时 15 毫秒
1.
IEEE802.17弹性分组环是宽带城域网的新型技术。凭着本地公平算法、空间重利用、带宽统计复用、正常状态双环均传输业务等特点从而和传统环网相比,弹性分组环在带宽利用方面具有较大的优势。公平算法对弹性分组环发挥其带宽利用优势具有极其重要的作用,而目前的基于节点公平算法不能完全发挥弹性分组环的优势。文章在更能发挥弹性分组环带宽利用优势的基于流的公平策略的基础上,建立相应的算法方案,并进行计算机仿真验证。实验结果验证了理论分析。 相似文献
2.
Adrian Lahanas Vassilis Tsaoussidis 《International Journal of Communication Systems》2004,17(2):101-117
In this work we first describe an asynchronous‐feedback model which corresponds to the diverse roundtrip times (RTTs) of competing flows within the same communication channel. We show that even when the feedback of the receivers/network is asynchronous, the duration of a congestion epoch represents ‘common knowledge’ for the competing flows. Based on this property, we propose a diverse linear increase scheme in proportion to the RTT of each flow and we adjust periodically the windows of the competing flows accordingly, in order to enhance fairness of asynchronous‐feedback environments. We name this scheme τ‐AIMD and show that fairness of flows in asynchronous systems is improved since the increase‐rate diversity of long and short RTT flows is largely canceled. We use the max–min notion of fairness to show that τ‐AIMD can constitute the foundation for other window‐based, end‐to‐end algorithms that target a good balance between efficiency and fairness. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
3.
TCP Vegas exhibits fairness problems even for flows with the same round‐trip time (RTT). We propose an enhanced Vegas with three revisions, replacing BaseRTT with RTT, detecting how fast acknowledgements return and the acceleration of the return speed. The impacts of each of the three proposed revisions are not ignorable. The proposed novel Vegas with the three revisions, called EVA, achieves better fairness under various network conditions. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
4.
The transmission control protocol (TCP) is one of the most important Internet protocols. It provides reliable transport services between two end‐hosts. Since TCP performance affects overall network performance, many studies have been done to model TCP performance in the steady state. However, recent researches have shown that most TCP flows are short‐lived. Therefore, it is more meaningful to model TCP performance in relation to the initial stage of short‐lived flows. In addition, the next‐generation Internet will be an unified all‐IP network that includes both wireless and wired networks integrated together. In short, modelling short‐lived TCP flows in wireless networks constitutes an important axis of research. In this paper, we propose simple wireless TCP models for short‐lived flows that extend the existing analytical model proposed in [IEEE Commun. Lett. 2002; 6 (2):85–88]. In terms of wireless TCP, we categorized wireless TCP schemes into three types: end‐to‐end scheme, split connection scheme, and local retransmission scheme, which is similar to the classification proposed in [IEEE/ACM Trans. Networking 1997; 756–769]. To validate the proposed models, we performed ns‐2 simulations. The average differences between the session completion time calculated using the proposed model and the simulation result for three schemes are less than 9, 16, and 7 ms, respectively. Consequently, the proposed model provides a satisfactory means of modelling the TCP performance of short‐lived wireless TCP flows. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
5.
Network coding is a novel field of information theory and coding theory. It is a breakthrough over the traditional store‐and‐forward routing methods by allowing coding of two or more packets together. From an information flow aspect, multiple flows could be overlapped in a routing scheme. Hence the theoretical upper bound of multicast capacity could be achieved by network coding. In this project, a complete routing and coding scheme is constructed to realize the maximum multicast transportation task. In order to implement the scheme, the paths of multiple max‐flows are determined. Edges are divided into overlapped and normal type based on the merged max‐flows. The transmitting data are represented using packets in a specific format. Multicast, forward and coding operations are defined to transmit data at the nodes. The nodes are classified according to the type of operation. A dynamic coding and routing algorithm is proposed to route packets gradually from source node to destinations in topological sorting order by the three operations on the path of merged max‐flows. We show that the use of simple XOR operations can satisfy most of the network topologies. The running time of the algorithm presented here is less than 1 second for most of the benchmark and random datasets. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
6.
The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly difficult. Since faults are inevitable, quick detection, identification, and recovery are crucial to make the systems more robust and their operation more reliable. This paper proposes a novel event correlation scheme for fault identification in communication networks. This scheme is based on the algebraic operations of sets. The causality graph model is used to describe the cause‐and‐effect relationships between network events. For each disorder, and each manifestation, a unique prime number is assigned. The use of the greatest common devisor (GCD) makes the correlation process simple and fast. A simulation model is developed to verify the effectiveness and efficiency of the proposed scheme. From simulation results, we notice that this scheme not only identifies multiple disorders at one time but also is insensitive to noise. The time complexity of the correlation process is close to a function of n, where n is the number of observed manifestations, with order O(n2); therefore, the on‐line fault identification is easy to achieve. Copyright © 1999 John Wiley & Sons, Ltd. 相似文献
7.
Nash bargaining solution based joint time‐frequency‐code‐power resource management algorithm for TD‐LTE systems
下载免费PDF全文
![点击此处可从《International Journal of Communication Systems》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Liqiang Zhao Yuanyuan Wang Kun Yang Jiangtao Yi Hailin Zhang 《International Journal of Communication Systems》2014,27(10):1752-1765
This paper presents a joint time‐frequency‐code‐power resource management algorithm based on the Nash bargaining solution in time‐division long term evolution systems. First, a joint radio resource allocation scheme at the time, frequency, code and power domain simultaneously is provided for the time‐division long term evolution system. Second, the proposed algorithm is modeled as a cooperative game under the constraints of each user's minimal rate requirement and available resources, for example, the maximal transmitting power. To reduce the computational complexity, the joint resource allocation algorithm is divided into time‐frequency‐code and power domain resource allocation. Also, we could approach the Pareto optimal rate as closely as possible by iterations. Simulation results show that compared with the other resource allocation algorithms, the proposed algorithm has achieved a good tradeoff between the overall system throughput and fairness among different users. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
8.
Cryptanalysis and security enhancement of a robust two‐factor authentication and key agreement protocol
下载免费PDF全文
![点击此处可从《International Journal of Communication Systems》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Qi Xie Na Dong Duncan S. Wong Bin Hu 《International Journal of Communication Systems》2016,29(3):478-487
Two‐factor user authentication scheme allows a user to use a smart card and a password to achieve mutual authentication and establish a session key between a server and a user. In 2012, Chen et al. showed that the scheme of Sood et al. does not achieve mutual authentication and is vulnerable to off‐line password guessing and smart card stolen attacks. They also found that another scheme proposed by Song is vulnerable to similar off‐line password guessing and smart card stolen attacks. They further proposed an improved scheme. In this paper, we first show that the improved scheme of Chen et al. still suffers from off‐line password guessing and smart card stolen attacks, does not support perfect forward secrecy, and lacks the fairness of session key establishment. We then propose a new security‐enhanced scheme and show its security and authentication using the formal verification tool ProVerif, which is based on applied pi calculus. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
9.
In this paper, we propose a scheme to allocate resource blocks for the Long Term Evolution (LTE) downlink based on the estimation of the effective bandwidths of traffic flows, where users’ priorities are adaptively computed using fuzzy logic. The effective bandwidth of each user traffic flow that is estimated through the parameters of the adaptive β-Multifractal Wavelet Mode modeling, is used to attain their quality of service (QoS) parameters. The proposed allocation scheme aims to guarantee the QoS parameters of users respecting the constraints of modulation and code schemes (modulation and coding scheme) of the LTE downlink transmission. The proposed algorithm considers the average channel quality and the adaptive estimation of effective bandwidth to decide about the scheduling of available radio resources. The efficiency of the proposed scheme is verified through simulations and compared to other algorithms in the literature in terms of parameters such as: system throughput, required data rate not provided, fairness index, data loss rate and network delay. 相似文献
10.
Fair Multiuser Channel Allocation for OFDMA Networks Using Nash Bargaining Solutions and Coalitions 总被引:5,自引:0,他引:5
《Communications, IEEE Transactions on》2005,53(8):1366-1376
In this paper, a fair scheme to allocate subcarrier, rate, and power for multiuser orthogonal frequency-division multiple-access systems is proposed. The problem is to maximize the overall system rate, under each user's maximal power and minimal rate constraints, while considering the fairness among users. The approach considers a new fairness criterion, which is a generalized proportional fairness based on Nash bargaining solutions and coalitions. First, a two-user algorithm is developed to bargain subcarrier usage between two users. Then a multiuser bargaining algorithm is developed based on optimal coalition pairs among users. The simulation results show that the proposed algorithms not only provide fair resource allocation among users, but also have a comparable overall system rate with the scheme maximizing the total rate without considering fairness. They also have much higher rates than that of the scheme with max-min fairness. Moreover, the proposed iterative fast implementation has the complexity for each iteration of only$O(K^2Nlog_2 N+K^4)$ , where$N$ is the number of subcarriers and$K$ is the number of users. 相似文献
11.
We propose a novel explicit rate‐based congestion avoidance scheme. The scheme is similar to ATM available bit rate (ABR) services but its complexity is largely reduced to enable implementation in IP networks. In our proposed scheme, sources can adapt their sending rate according to network status. Adaptation of sending rates converges to max–min fairness with minimal rate guarantee. Furthermore, routers do not maintain per flow state; they use FIFO packet scheduling enhanced by an explicit rate feedback mechanism with estimations, including number of active flows, number of bounded flows and total bounded rate, based on a simple algorithm motivated by Bloom filter. We present and discuss simulations on the performance under various network conditions. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
12.
In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real‐time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink in a cellular packet network, where the time axis is divided into a finite number of slots within a frame, and the frequency axis is segmented into subchannels that consist of multiple subcarriers. In addition, to compensate for fast and slow channel variation, we employ a link adaptation technique such as adaptive modulation and coding. From the simulation results, our proposed packet scheduling scheme can support QoS differentiations while guaranteeing short‐term fairness as well as long‐term fairness for various real‐time traffic. 相似文献
13.
Removing redundant TCP functionalities in wired‐cum‐wireless networks with IEEE 802.11e HCCA support
下载免费PDF全文
![点击此处可从《International Journal of Communication Systems》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Jorge Navarro‐Ortiz Pablo Ameigeiras Juan J. Ramos‐Munoz Juan M. Lopez‐Soler 《International Journal of Communication Systems》2014,27(11):3352-3367
The TCP was originally designed for wired networks, assuming transmission errors were negligible. Actually, any acknowledgment time‐out unconditionally triggers the congestion control mechanism, even in wireless networks in which this assumption is not valid. Consequently, in wireless networks, TCP performance significantly degrades. To avoid this degradation, this paper proposes the so‐called split TCP and UDP. In this approach, the access point splits the TCP connection and uses a customized and lighter transport protocol for the wireless segment. It takes advantage of the IEEE 802.11e Hybrid Coordination Function Controlled Channel Access (HCCA) mechanisms to remove redundant TCP functionalities. Specifically, the HCCA scheduler allows disabling of the congestion control in the wireless link. Similarly, the IEEE 802.11e error control service makes possible to eliminate TCP acknowledgments, therefore reducing the TCP protocol overhead. Finally, the usage of an HCCA scheduler permits providing fairness among the different data flows. The proposed split scheme is evaluated via extensive simulations. Results show that split TCP and User Datagram Protocol outperforms the analyzed TCP flavors—specifically designed for wireless environments—and the split TCP solution, achieving up to 95% of end‐user throughput gain. Furthermore, the proposed solution is TCP friendly because TCP flows are not degraded by the presence of flows by using this approach. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
14.
Mohsen Karimzadeh Kiskani Zheng Wang Hamid R. Sadjadpour Jose A. Oviedo Jose Joaquin Garcia‐Luna‐Aceves 《Wireless Communications and Mobile Computing》2015,15(14):1837-1850
A new approach for multiantenna broadcast channels in cellular networks based on multiuser diversity concept is introduced. The technique called opportunistic interference management achieves dirty paper coding capacity asymptotically with minimum feedback required. When there are K antennas at the base station with M mobile users in the cell, the proposed technique only requires K integer numbers related to channel state information between mobile users and base station. The encoding and decoding complexity of this scheme is the same as that of point‐to‐point communications, which makes the implementation of this technique easy. An antenna selection scheme is proposed at the base station to reduce the minimum required mobile users significantly at the expense of reasonable increase in feedback. In order to guarantee fairness, a new algorithm is presented that incorporates opportunistic interference management into existing Global System for Mobile communications (GSM) standard. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
15.
An explicit and fair window adjustment method to enhance TCP efficiency and fairness over multihops Satellite networks 总被引:1,自引:0,他引:1
Transmission control protocol (TCP) is the most widely used transport protocol in today's Internet. Despite the fact that several mechanisms have been presented in recent literature to improve TCP, there remain some vexing attributes that impair TCPs performance. This paper addresses the issue of the efficiency and fairness of TCP in multihops satellite constellations. It mainly focuses on the effect of the change in flows count on TCP behavior. In case of a handover occurrence, a TCP sender may be forced to be sharing a new set of satellites with other users resulting in a change of flows count. This paper argues that the TCP rate of each flow should be dynamically adjusted to the available bandwidth when the number of flows that are competing for a single link, changes over time. An explicit and fair scheme is developed. The scheme matches the aggregate window size of all active TCP flows to the network pipe. At the same time, it provides all the active connections with feedbacks proportional to their round-trip time values so that the system converges to optimal efficiency and fairness. Feedbacks are signaled to TCP sources through the receiver's advertised window field in the TCP header of acknowledgments. Senders should accordingly regulate their sending rates. The proposed scheme is referred to as explicit and fair window adjustment (XFWA). Extensive simulation results show that the XFWA scheme substantially improves the system fairness, reduces the number of packet drops, and makes better utilization of the bottleneck link. 相似文献
16.
《Networking, IEEE/ACM Transactions on》2006,14(5):1031-1044
This paper examines some issues that affect the efficiency and fairness of the Transmission Control Protocol (TCP), the backbone of Internet protocol communication, in multi-hops satellite network systems. It proposes a scheme that allows satellite systems to automatically adapt to any change in the number of active TCP flows due to handover occurrence, the free buffer size, and the bandwidth–delay product of the network. The proposed scheme has two major design goals: increasing the system efficiency, and improving its fairness. The system efficiency is controlled by matching the aggregate traffic rate to the sum of the link capacity and total buffer size. On the other hand, the system min-max fairness is achieved by allocating bandwidth among individual flows in proportion with their RTTs. The proposed scheme is dubbed Recursive, Explicit, and Fair Window Adjustment (REFWA). Simulation results elucidate that the REFWA scheme substantially improves the system fairness, reduces the number of packet drops, and makes better utilization of the bottleneck link. The results demonstrate also that the proposed scheme works properly in more complicated environments where connections traverse multiple bottlenecks and the available bandwidth may change over data transmission time. 相似文献
17.
首先讨论了RPR网络中的公平性原则,然后结合该原则引入了一种适合于RPR网络的公平分配方案,基于该方案提出了一种能满足RPR环网性能要求的公平分配算法。该算法通过采用控制的方法为共享某链路的各数据流合理地分配带宽资源,从而达到:(1)各流的速率达到稳定;(2)链路缓存的占有量稳定到一个目标值;(3)链路带宽得到充分利用且实现公平分配。同时该算法能顺次协同地处理完网络中的各个链路,从而能够实现整个RPR环网的公平性与高的链路带宽利用率,达到RPR协议所要求的目标。给出了该算法的代码描述并对其作出稳定性分析,然后通过仿真对其性能进行了验证。 相似文献
18.
Wen‐Kuang Kuo 《International Journal of Network Management》2008,18(3):209-228
As demand for broadband multimedia wireless services increases, improving quality of service (QoS) of the widely deployed IEEE 802.11 wireless LAN (WLAN) has become crucial. To support the QoS required by a wide range of applications, the IEEE 802.11 working group has defined a new standard: IEEE 802.11e. In this paper, we propose a measurement‐based dynamic media time allocation (MBDMTA) scheme combined with a concatenating window scheme to support real‐time variable bit rate (rt‐VBR) video and best‐effort (BE) data transmission using IEEE 802.11e enhanced distributed channel access (EDCA). To provide the QoS guarantee for rt‐VBR video, the proposed MBDMTA scheme dynamically assigns channel time to the rt‐VBR video based on the estimate of the required network resources. On the other hand, the concatenating window scheme controls the contention window (CW) ranges of different priority flows such that real‐time services always have higher channel access probability, thus achieving the capability of preemptive priorities. In addition, the concatenating window scheme preserves fairness among flows of the same class and attains high channel utilization under different network conditions. Simulation results demonstrate that the throughput and delay performance improve significantly for the transmission of rt‐VBR video and BE traffic as compared to those for the 802.11e EDCA specification. It is also revealed that combining the two proposed schemes provides seamless integration and reliable transmission of digital video and data service within the 802.11e EDCA framework. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
19.
Shu‐Ming Tseng 《International Journal of Communication Systems》2007,20(11):1285-1298
We propose a fuzzy parallel interference cancellation (PIC) multiuser detection/vector channel estimation (VCE) scheme in Rayleigh fading channels. The VCE is based on a first‐order auto‐regressive model and an expectation‐maximization algorithm. The signal‐to‐interference ratio and signal‐to‐noise ratio are estimated from the vector channel model's parameters, and we adapt the weight of each interference cancellation path via fuzzy inference mechanism. The proposed fuzzy PIC and VCE cooperate in a way such that some of the fuzzy PIC input parameters come from the channel predictor and the fuzzy PIC makes the channel predictor be more accurate at the next PIC stage. Computing weights via fuzzy adaptive method adds insignificant complexity because it involves only table lookup. The simulation results show that the proposed fuzzy PIC/VCE scheme performs better than the improved PIC/vector channel estimation scheme with optimal parameter in fast‐varying Rayleigh fading channels. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
20.
In order to extend fair queueing algorithms to wireless networks, we propose a channel error and handoff compensation scheme. A compensation is performed by a compensation server and a priority swapping mechanism. The proposed compensation scheme provides a short‐term fairness guarantee for an error‐free session, long‐term fairness guarantee for an erroneous session, fast handoff and traffic‐specific quality of service control. Copyright 2002 John Wiley & Sons, Ltd. 相似文献