检索结果-内蒙古大学图书馆

Optimised proportional fair algorithm for long-term evolution-advanced system with multiple component carriers

IET COMMUNICATIONS 2012年第11期6卷 1579-1586页

作者： Nguyen, S. C. Sandrasegaran, K. Univ Technol Sydney Fac Engn & IT CRIN Sydney NSW 2007 Australia

Long-term evolution-advanced (LTE-A), the true 4G technology of third Generation Partnership Project family, has a new feature that aggregates multiple LTE carriers so that users can be served on multiple component carriers (CCs). This characteristic plays an important role to increase data rate multiple times for LTE-A users with corresponding multiple CCs. However, current proposed packet scheduling (PS) algorithms ignore this effect in the effort of providing new solution that increases system performance. The modified proportional fair algorithms proposed in this study can provide optimised algorithm for PS mechanism in LTE-A system as well as other technologies that use multiple carriers.

关键词： packet scheduling algorithms third Generation Partnership Project family multiple CC Long Term Evolution PS mechanism optimised algorithm modified proportional fair algorithms Mobile radio systems 3G mobile communication 3GPP 4G mobile communication data rate multiple times multiple LTE carriers 4G technology long-term evolution-advanced system multiple component carriers LTE-A users

来源：评论

学校读者我要写书评

暂无评论

Green Resource Allocation for OFDMA Wireless Cellular Networks

Green Resource Allocation for OFDMA Wireless Cellular Networ...

引用

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Strinati, Emilio Calvanese Greco, Paolo CEA LETI MINATEC F-38054 Grenoble France

ISBN: (纸本)9781424480166

packet scheduling algorithms are viewed as one of the key mechanisms for increasing the diversity order, robustness and effectiveness of a wireless multi-user communication system. Traditional packet scheduling are mainly designed to increase the system capacity. In this paper we present a novel scheduling algorithm that improves the scheduling energy efficiency in OFDMA based wireless cellular networks. Our goal is to reduce the overall downlink energy consumption while adapting the target of spectral efficiency to the actual load of the system and meeting the Quality of Service (QoS). Our analysis reveals how the proposed approach permits to achieve notable energy gain over traditional scheduling algorithm especially in not saturated scenarios.

关键词： OFDM modulation OFDMA QoS cellular radio frequency division multiple access green resource allocation packet scheduling algorithms quality of service quality of service resource allocation scheduling wireless cellular networks wireless multiuser communication system

来源：评论

学校读者我要写书评

暂无评论

Stability of a frame-based oldest-cell-first maximal weight matching algorithm

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2008年第1期56卷 21-26页

作者： Li, Xike Elhanany, Itamar Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA

Input-queued cell switches employing the oldest-cell-first(OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is stable for admissible traffic conditions when executed with a scheduling speedup of 2. However, as link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. To address the scalability issue, we describe a Frame-Based Maximal Weight Matching (FMWM) algorithm, employing OCF as queue weights, in which a new scheduling decision is issued once every several cell times. Between scheduling decisions, the configuration of the crossbar switch remains unchanged. We further extend the analysis to address the case of multiple classes of service, and prove that the algorithm is stable with an internal buffer transfer speedup of 2, thereby significantly relaxing the timing constraints imposed on the scheduling process.

关键词： packet scheduling algorithms stability analysis switching architectures

来源：评论

学校读者我要写书评

暂无评论

Fundamental trade-offs in aggregate packet scheduling

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2005年第12期16卷 1166-1177页

作者： Duan, ZH Zhang, ZL Hou, YWT Florida State Univ Dept Comp Sci Tallahassee FL 32306 USA Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA Virginia Tech Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA

In this paper, we investigate the fundamental trade-offs in aggregate packet scheduling for support of guaranteed delay service. In our study, we consider two classes of aggregate packet scheduling algorithms: the static earliest time first (SETF) and dynamic earliest time first ( DETF). Through these two classes of aggregate packet scheduling ( and together with the simple FIFO packet scheduling algorithm), we show that, with additional timestamp information encoded in the packet header for scheduling purposes, we can significantly increase the maximum allowable network utilization level, while, at the same time, reducing the worst-case edge-to-edge delay bound. Furthermore, we demonstrate how the number of the bits used to encode the timestamp information affects the trade-off between the maximum allowable network utilization level and the worst-case edge-to-edge delay bound. In addition, the more complex DETF algorithms have far superior performance than the simpler SETF algorithms. These results illustrate the fundamental trade-offs in aggregate packet scheduling algorithms and shed light on their provisioning power in support of guaranteed delay service.

关键词： packet scheduling algorithms aggregate packet scheduling algorithms quality of services (QoS) performance analysis

来源：评论

学校读者我要写书评

暂无评论

Stability of a frame-based maximal weight matching algorithm with transfer speedup

引用

IEEE COMMUNICATIONS LETTERS 2005年第10期9卷 942-944页

作者： Li, XK Elhanany, I Univ Tennessee Dept Elect & Comp Engn Knoxville TN 37996 USA

It has been shown that maximal size matching algorithms for input-queued switches are stable under any admissible traffic conditions with a scheduling speedup of 2. However, as link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. In this letter we describe a Frame-Based Maximal Weight Matching (FMWM) algorithm in which a new scheduling decision is issued once every several cell times. Between scheduling decisions, the configuration of the crossbar switch remains unchanged. We prove that the FMWM algorithm is stable with an internal buffer transfer speedup of 2, thereby significantly relaxing the timing constraints on the scheduling process. Simulation results illustrate the impact of the algorithm on the average cell delay for different traffic scenarios.

关键词： packet scheduling algorithms switching architectures Lyapunov stability analysis

来源：评论

学校读者我要写书评

暂无评论

Stability of frame-based maximal weight matching algorithms with reconfiguration. delays

Stability of frame-based maximal weight matching algorithms ...

引用

IEEE Workshop on High Performance Switching and Routing (HPSR 2005)

作者： Li, X Elhanany, I Univ Tennessee Dept Elect & Comp Engn Knoxville TN 37996 USA

ISBN: (纸本)0780389247

It has been shown that maximal weight matching algorithms for input-queued switches are stable under any admissible traffic conditions with a speedup of 2. As link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. In Frame-Based Maximal Weight Matching (FMWM), a new scheduling decision is generated once every several packet times, as opposed to on a packet-by- packet basis. Between new scheduling decisions, the configuration of the crossbar switch remains unchanged ' We show that the FMWM algorithm is also stable with a speedup of 2 and obtain the speedup required for stability in systems with non-negligible reconfiguration delays. Simulation results illustrate the impact of the frame size on the delay experienced by arriving packets under different traffic scenarios.

关键词： packet scheduling algorithms switching architectures stability analysis

来源：评论

学校读者我要写书评

暂无评论

DISA: A robust scheduling algorithm for scalable crosspoint-based switch fabrics

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2003年第4期21卷 535-545页

作者： Elhanany, I Sadot, D Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel

This paper presents and analyzes a high-performance, robust, and scalable scheduling algorithm for input-queued switches called distributed sequential allocation (DISA). In contrast to pointer-based arbitration schemes, the proposed algorithm is based on a synchronized output reservation process, whereby each input selects a designated output while taking into consideration both local transmission requests and the availability of global resources. The distinctiveness of the algorithm lies in its ability to offer high performance when multiple cells are transmitted within each switching interval. Relaxed switching-time requirements allow for the incorporation of commercially available crosspoint switches. The result is a pragmatic and scalable solution for high port-density switching platforms. The efficiency of the scheme and its robustness in the presence of admissible traffic, without the need for speedup, is established through analysis and computer simulations. Performance results are shown for various traffic scenarios including nonuniform destination distribution, correlated arrivals and multiple classes of service.

关键词： input-queued switches packet scheduling algorithms quality-of-service (QoS) switch fabric traffic modeling

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of a robust scheduling algorithm for scalable input-queued switches

Performance analysis of a robust scheduling algorithm for sc...

引用

IEEE International Conference on Communications (ICC)

作者： Elhanany, I Sadot, D Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel

ISBN: (纸本)0780378024

In this paper a high-performance, robust and scalable scheduling algorithm for input-queued switches, called distributed sequential allocation (DISA), is presented and analyzed. Contrary to pointer-based arbitration schemes, the algorithm proposed. is based on a synchronized channel reservation cycle whereby each input selects a designated output, considering both its local requests as well as global channel availability information. The distinctiveness of the algorithm is in its ability to offer high-performance when multiple cells are transmitted within each switching intervals. The subsequent relaxed switching-time requirement allows for the utilization of commercially available crosspoint switches, yielding a pragmatic and scalable solution for high port-density switching platforms. The efficiency of the algorithms and its robustness is established through analysis and computer simulations addressing diverse traffic scenarios.

关键词： packet scheduling algorithms switch fabric input-queued switches non-uniform destination distribution

来源：评论

学校读者我要写书评

暂无评论

Analysis and simulation of WF²Q+ based schedulers:: comparisons, compliance with theoretical bounds and influence on end-to-end delay jitter

引用

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING 2001年第5期37卷 579-599页

作者： Ciulli, N Giordano, S Consorzio Pisa Ric META Ctr I-56125 Pisa Italy Univ Pisa Dept Informat Engn I-56125 Pisa Italy

The statistical multiplexing of non-fixed-size packet flows over a network interface is implemented by different algorithms., which attempt to approximate the GPS "fluid model". One of the most effective proposals is WF(2)Q. which is optimal but complex, and resulted in different implementations: WF(2)Q+ and S-SPFQ. The former is not exactly specified by any algorithm and allows a number of implementations: this article aims to clarify the differences among them., with theoretical and simulative approaches. We implemented a discrete-event simulator which has been used to verify how these implementations match the WF2Q properties. The article ends with a discussion on the impact of the scheduler fairness property on delay-jitter. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： packet scheduling algorithms fairness algorithms comparisons algorithms simulations delay jitter

来源：评论

学校读者我要写书评

暂无评论

Deterministic delay bounds for VBR video in packet-switching networks: Fundamental limits and practical trade-offs

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1996年第3期4卷 352-362页

作者： Wrege, DE Knightly, EW Zhang, H Liebeherr, J UNIV CALIF BERKELEY DEPT ELECT ENGN & COMP SCI BERKELEY CA 94720 USA CARNEGIE MELLON UNIV SCH COMP SCI PITTSBURGH PA 15213 USA

Compressed digital video is one of the most important traffic types in future integrated services networks. However, a network service that supports delay-sensitive video imposes many problems since compressed video sources are variable bit rate (VBR) with a high degree of burstiness. In this paper, we consider a network service that can provide deterministic guarantees on the minimum throughput and the maximum delay of VBR video traffic. A common belief is that due to the burstiness of VBR traffic, such a service will not be efficient and will necessarily result in low network utilization. We investigate the fundamental Limits and trade-offs in providing deterministic performance guarantees to video and use a set of 10 to 30 min. long MPEG-compressed video traces for evaluation. Contrary to conventional wisdom, we are able to show that, in many cases, a deterministic service can be provided to video traffic while maintaining a reasonable level of network utilization. We first consider an ideal network environment that employs the most accurate deterministic, time-invariant video traffic characterizations, the optimal earliest-deadline-first packet schedulers, and exact admission control conditions. The utilization achievable in this situation provides the fundamental limits of a deterministic service. We then investigate the utilization limits in a network environment that takes into account practical constraints, such as the need for simple and efficient policing mechanisms, packet scheduling algorithms, and admission control tests.

关键词： scheduling packet Switching Delays Digital Communication Data Compression Visual Communication Channel Capacity Telecommunication Congestion Control Telecommunication Traffic Video Coding Telecommunication Networks Deterministic Delay Bounds VBR Video packet Switching Networks Fundamental Limits Practical Trade Offs Compressed Digital Video Integrated Services Networks Delay Sensitive Video Variable Bit Rate Burstiness Network Service Minimum Throughput Maximum Delay Video Traffic Low Network Utilization Performance Guarantees Optimal Earliest Deadline First packet Schedulers MPEG Compressed Video Traces Admission Control Conditions Policing Mechanisms packet scheduling algorithms Admission Control Tests Delay Video Compression Telecommunication Traffic scheduling Algorithm Communication System Traffic Control Admission Control Intserv Networks Bit Rate Throughput Testing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：