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

2010 IEEE 71st Vehicular Technology Conference

作者： Lim, Bo-mi Ahn, Kyungsul Kim, Haelyong Park, Hyuncheol Gil, Gye-Tae Korea Adv Inst Sci & Technol Informat & Commun Engn 119 Munjiro Daejeon 305701 South Korea KT R&D Grp Daejeon South Korea

ISBN: (纸本)9781424425198

In this paper, we deal with user scheduling algorithms for a codebook based precoding of a multiuser multiple-input multiple-output (MIMO) downlink system considered in IEEE 802.16m and 3rd Generation Partnership Project Long-Term Evolution (3GPP LTE) standardization. We especially focus on per-user unitary rate control (PU2RC) and semi-orthogonal user selection schemes. Also, we examine the disadvantage of the codebook based precoding with these schemes - a loss of sum-capacity when the codebook size is larger than the number of total users who request the communication service to a base station. Finally, we propose two user scheduling algorithms to improve the sum-capacity when the number of total users is smaller than the codebook size. First, we introduce feedback information retransmission algorithm in which each user sends a new codeword again depending on a request of the base station. Second, we address the adaptive feedback algorithm where users transmit one or two codeword indices called preferred matrix index (PMI) depending on their channel condition. The improvement of the sum-capacity is verified through the simulation.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel Data Center Network Architecture with Zero in-Network Queuing 13

A Novel Data Center Network Architecture with Zero in-Networ...

引用

13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Javidi, Tara Wang, Chang-Heng Akta, Tugcan Univ Calif San Diego Dept Elect & Comp Engn San Diego CA 92103 USA

ISBN: (纸本)9783901882746

In-network queuing in the Internet-style networks enables the distributed operation and scalability across the network at the cost of excessive delay and tardy flow completion times. Data center networking, in contrast, are proposed to depart from this classical approach and avoid in-network queuing all together. In this new class of network solutions serving inter-data center traffic, a densely packed fairly local area network of stationary end hosts are often managed by a single entity, allowing for fine-grained management and scheduling of flows across the data center. The overall objective of this work is to develop a framework, from first principles, which relies on the unique attributes of data centers to propose a transformative novel networking architecture with increased level of efficiency and significantly smaller latency. By separating the control and data planes, the proposed hybrid architecture avoids in-network queuing and results in significantly lower delay. The critical technical challenge is to design end-end circuit switching mechanisms that account for monitoring as well as circuit reconfiguration delays. Furthermore, the design has to minimize the computational complexity of the scheduling algorithm as well as the cost of monitoring across the network. In this context, this paper underlines a family of recent technologies and networking advances as promising enablers and discusses the most significant set of challenges.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

CHASE: Component High Availability-Aware Scheduler in Cloud Computing Environment 8

CHASE: Component High Availability-Aware Scheduler in Cloud ...

引用

IEEE 8th International Conference on Cloud Computing

作者： Jammal, Manar Kanso, Ali Shami, Abdallah Western Univ ECE Dept London ON Canada Ericsson Ericsson Res Montreal PQ Canada

ISBN: (纸本)9781467372879

Cloud computing promises flexible integration of the compute capabilities for on-demand access through the concept of virtualization. However, uncertainties are raised regarding the high availability of the cloud-hosted applications. High availability is a crucial requirement for multi-tier applications providing business services for a broad range of enterprises. This paper proposes a novel component high availability-aware scheduling technique, CHASE, which maximizes the availability of applications without violating service level agreements with the end-users. Using CHASE, prior criticality analysis is conducted on applications to schedule them based on their impact on their execution environment and business functionality. This paper presents the advantages and shortcomings of CHASE compared to an optimal solution, OpenStack Nova scheduler, high availability-agnostic, and redundancy-agnostic schedulers. The evaluation results demonstrate that the proposed solution improves the availability of the scheduled components compared to the latter schedulers. CHASE prototype is also defined for runtime scheduling in OpenStack environment.

关键词： High availability applications components virtual machines outage tolerance scheduling algorithms recovery time criticality OpenStack filters

来源：评论

学校读者我要写书评

暂无评论

High Availability-Aware Optimization Digest for Applications Deployment in Cloud

High Availability-Aware Optimization Digest for Applications...

引用

IEEE International Conference on Communications (ICC)

作者： Jammal, Manar Kanso, Ali Shami, Abdallah Univ Western Ontario ECE Dept London ON Canada Ericsson Ericsson Res Montreal PQ Canada

ISBN: (纸本)9781467364324

Cloud computing is continuously growing as a business model for hosting information and communication technology applications. Although on-demand resource consumption and faster deployment time make this model appealing for the enterprise, other concerns arise regarding the quality of service offered by the cloud. One major concern is the high availability of applications hosted in the cloud. This paper demonstrates the tremendous effect that the placement strategy for virtual machines hosting applications has on the high availability of the services provided by these applications. In addition, a novel scheduling technique is presented that takes into consideration the interdependencies between applications components and other constraints such as communication delay tolerance and resource utilization. The problem is formulated as a linear programming multi-constraint optimization model. The evaluation results demonstrate that the proposed solution improves the availability of the scheduled components compared to OpenStack Nova scheduler.

关键词： High availability cloud applications delay tolerance scheduling algorithms virtual machines failure scope

来源：评论

学校读者我要写书评

暂无评论

MIDAS: A Data Aggregation scheduling Scheme for Variable Aggregation Rate WSNs

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2015年第10期11卷

作者： Long, Jun He, An Zhang, Jinhuan Zhang, Hao Cent South Univ Sch Informat Sci & Engn Changsha 410083 Peoples R China Cent South Univ Forestry & Technol Sch Comp & Informat Engn Changsha 410083 Hunan Peoples R China

Data aggregation scheduling for variable aggregation rate model has wide application and should take network lifetime and energy efficiency into consideration. In this paper, the time-slot scheduling problem for the variable aggregation rate model is presented, and a time-slot scheduling integrating consideration of minimizing the energy consumption named Makeup Integer based Data Aggregation scheduling (MIDAS) is proposed. The proposed MIDAS scheme integrates two core phases, namely, data aggregation set construction and aggregation set based scheduling algorithm. The key idea of MIDAS is to minimize the number of receiving and sending data packets in hotspot and to reduce the number of aggregated packets in network for better scheduling performance in network lifetime. Furthermore, it is also essential to increase energy utilization efficiency of the nodes in the middle layer by exploiting the remaining energy of peripheral nodes. A series of experiments are simulated to demonstrate that the proposed scheme has significantly increased the network lifetime and the energy utilization efficiency under the different aggregation rates and different network scales. Comparing with the SDAS, the lifetime can be increased by as much as 25%. The energy utilization efficiency can be improved by as much as 30%.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Passivity of linear parameter varying systems with intermittent non-passive behavior 54

Passivity of linear parameter varying systems with intermitt...

引用

54th IEEE Conference on Decision and Control (CDC)

作者： Sivaranjani, S. Gupta, Vijay Seiler, Peter Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA Univ Minnesota Dept Aerosp Engn & Mech Minneapolis MN 55455 USA

ISBN: (纸本)9781479978861

We analyze passivity of Linear Parameter Varying (LPV) systems in which certain regions of the parameter trajectory may be non-passive. It is shown that system passivity can be maintained if the system remains in passive parameter regions "sufficiently often". Analytical conditions that ensure system passivity are derived in terms of the fractions of times spent in passive and non-passive regions of the parameter trajectory. An online algorithm to schedule controllers to maintain a desired level of passivity based on parameter measurements is also proposed.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Charging Algorithm for Electric Vehicles in Smart Grids 81

An Adaptive Charging Algorithm for Electric Vehicles in Smar...

引用

81st IEEE Vehicular Technology Conference (VTC Spring)

作者： Bilh, Abdoulmenim Naik, Kshirasagar El-Shatshat, Ramadan Univ Waterloo Dept Elect & Comp Engn 200 Univ Ave West Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781479980888

Integration of renewable energy sources and Electric Vehicles (EVs) into smart grids comes with significant challenges. The uncertainty of the short-term forecasted energy from renewable sources increases the variability of the net-load in the grid. Also, EVs' charging could exacerbate the load peak in the grid if charging is not coordinated. In this work, firstly, we study the impact of the variability of renewable sources on the short-term forecast of the net-load in the electric grid, and a model of the net-load forecast error is developed. Secondly, a novel online charging algorithm for EVs is proposed not only to shift EVs' load from the system peak period to more desirable period, but also to decrease the variability of the net-load in the grid. Simulation results show that our algorithm outperforms the traditional scheduling algorithms which optimize the overall load in the system based on short-term load forecast.

关键词： Electric vehicles Smart grids charging maximum loads CHARGING(ACCOUNTTNG) Loading systems load forecasting Power grids Grid computing scheduling algorithms short duration Renewable energy renewable energy sources Energy sources

来源：评论

学校读者我要写书评

暂无评论

More Load, More Differentiation - a Design Principle for Deadline-Aware Congestion Control 34

More Load, More Differentiation - a Design Principle for Dea...

引用

34th IEEE Conference on Computer Communications (INFOCOM)

作者： Zhang, Han Shi, Xingang Yin, Xia Ren, Fengyuan Wang, Zhiliang Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Tsinghua Univ Inst Network Sci & Cyberspace Beijing Peoples R China Tsinghua Natl Lab Informat Sci & Technol TNLIST Beijing Peoples R China

ISBN: (纸本)9781479983810

Data center network has become an important facility for hosting various online services and applications, and thus its performance and underlying technologies are attracting more and more interests. In order to achieve better network performance, recent studies have proposed to tailor data center network traffic management in different aspects, devising various routing and transport schemes. In particular, for applications that must serve users in a timely manner, strict deadlines for their internal traffic flows should be met, and are explicitly taken into consideration in some latest flow rate control or scheduling algorithms in data center networks. In this paper, we advocate that when designing such deadline-aware rate control schemes, a simple principle should be followed: flows with different deadlines should be differentiated in their bandwidth allocation/occupation, and the more traffic load, the more differentiation should be made. We derive sufficient and necessary conditions for a flow rate control scheme to follow this principle, and present a simple congestion control algorithm called Load Proportional Differentiation (LPD) as its application. We have evaluated LPD under different topologies and load scenarios, both by simulation and in real testbed. Our results show that LPD nearly always outperforms (DTCP)-T-2, a latest deadline-aware rate control scheme, and often reduces the number of flows missing their deadlines by more than 50%. We also give some other applications of this principle, for example, in reducing flow completion time.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Inter-Flow Consistency: A Novel SDN Update Abstraction for Supporting Inter-Flow Constraints 3

Inter-Flow Consistency: A Novel SDN Update Abstraction for S...

引用

IEEE Conference Communications and Network Security CNS

作者： Liu, Weijie Bobba, Rakesh B. Mohan, Sibin Campbell, Roy H. Univ Illinois Champaign IL 61801 USA Oregon State Univ Corvallis OR 97331 USA

ISBN: (纸本)9781467378765

Software Defined Networks (SDNs) have opened up a new era for networking by decoupling the control and data planes. With a centralized controller, the process of updating networks becomes much more convenient when compared to traditional networks. However, even with SDNs, transitional network states during network updates may still cause problems. Such states may result in a breakdown of isolation guarantees or other critical constraints and this could lead to incorrect behavior or even security vulnerabilities. In this paper, we propose a novel abstraction for network updates, inter-flow consistency, that can account for relationships and constraints among different flows during updates. We present a generic inter-flow consistency constraint, version isolation, and a special case, spatial isolation. We propose update scheduling algorithms based on dependency graphs and a data structure that captures dependencies among different update operations & network elements. We also implemented a prototype system on a Mininet OpenFlow network and Ryu SDN controller to evaluate our approach. Experimental results show that our approach is able to enforce inter-flow consistency constraints with reasonable overheads and that overheads for version isolation are higher than for spatial isolation. Furthermore, when only spatial isolation constraints are in use, overheads on update times for flows that have no isolation constraints are very small (around 1%).

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Reliable Transmissions in Fair STDMA Underwater Sensor Networks 2

Reliable Transmissions in Fair STDMA Underwater Sensor Netwo...

引用

2nd International Conference on Computing for Sustainable Global Development (INDIACom)

作者： Luque-Nieto, Miguel A. Moreno-Roldan, Jose M. Poncela, Javier Otero, Pablo Univ Malaga Dept Commun Engn Malaga Spain

ISBN: (纸本)9789380544168

Nowadays, marine scientists have a growing interest to know what happens in the ocean water column. One potential technology is to use underwater acoustic sensor networks that providing continuous sea environmental data. Although a number of MAC techniques can be used in these networks, Spatial-TDMA is one of the most efficient in terms of energy, which is a critical parameter in underwater networks. In addition to, the high propagation delay of acoustic waves in the water makes the reliability of the transmissions an important dare to overcome. In this article, we consider both concepts applying toa multi-hop network topology (many-to-one network). Spatial TDMA is the slot planning used for scheduled the node transmissions, and this is done with a fair bandwidth assignation. We propose an algorithm to find the shortest frame in a transmission cycle using graph cliques. Finally, we evaluate the capabilities of using the CRC-32 detecting code adopted in 802.3 standard to estimate a suitable length for payload field in the data transmissions.

关键词： Cliques Hamming Distance Polynomial Codes scheduling algorithms Sensor Networks Time Division Multiplexing Access Underwater Acoustic Communications

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：