Joint relay selection and resource allocation in cooperative device-to-device communications

Device-to-device (D2D) communications allow proximate cellular user equipments (UEs) to communicate with each other directly under the control of base station (BS). In this paper, considering the selection relaying (SR) rule which allows a subset of potential relays to forward the source’s data to the corresponding destination, we first establish a multi-relay system model where a D2D UE can act as not only a source but also a potential relay for another D2D link, and then analyze the cooperation behaviors among selfish UEs. Next a simple strategy is proposed to deal with the relay selection problem, and then the fair and efficient resource sharing problem among cooperating D2D UEs is formulated as a bargaining game. Since the game function is non-convex, we turn to an iterative method by introducing an auxiliary function to get the proportional fair resource allocation results. The system efficiency and fairness are proved by numeral simulation results.     

Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks

In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been proposed for QoS wireline-wireless networking. The basic notion in PFQ is that the bandwidth allocated to a session is proportional to a positive weight _i . Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitations on the range of QoS that can be supported. We develop PFQ with deterministic time-varying weight assignments, and we propose a low-overhead algorithm capable of supporting arbitrary piecewise linear service curves which achieve delay-bandwidth decoupling. Unlike existing service-curve based algorithms, our time-varying PFQ scheme does not exhibit the punishment phenomenon, and allows sessions to exploit the extra bandwidth in under-loaded networks.     

Pensions modelling

Valuable insights into the problem of how to fund defined benefitpension schemes can be obtained by analysis using the standardBlack–Scholes/Merton option pricing model, consideringthe pension fund finances jointly with those of the sponsoringcompany. The nature of the fund assets and liabilities is completelydifferent, and this lies behind current controversies aboutthe appropriate discount rate, valuation, financial accountingand preferential status for pension fund claimants in insolvency.     

A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms

Fair queueing in the wireless domain poses significant challenges due to unique issues in the wireless channel such as location-dependent and bursty channel errors. In this paper, we present a wireless fair service model that captures the scheduling requirements of wireless scheduling algorithms, and present a unified wireless fair queueing architecture in which scheduling algorithms can be designed to achieve wireless fair service. We map seven recently proposed wireless fair scheduling algorithms to the unified architecture, and compare their properties through simulation and analysis. We conclude that some of these algorithms achieve the properties of wireless fair service including short-term and long-term fairness, short-term and long-term throughput bounds, and tight delay bounds for channel access.     

电子商务安全公平交易系统设计与实现

针对因特网环境下电子商务交易过程存在的安全隐患,设计一套安全的客户对客户进行电子商务（C2C,Customer to Customer）环境下的电子商务交易安全解决方案。该方案首先给出电子商务交易的组成结构;然后分析电子商务交易协议;最后给出电子商务交易流程。该方案可以为注册用户之间进行电子商务交易提供安全、公平的交易环境,保证交易过程中的敏感信息不被泄露、破解或误用。在发生交易纠纷时,能够提供交易全过程中详细、准确信息纪录,为公平的交易仲裁提供支持。     

The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm

1　IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1～ 2 ] ,andtheotherisforthequalityofservice[3～6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo…     

一种具有小尺度公平的无线分组调度算法

本文在调度判决时考虑到用户的访问时延限制,比例公平调度算法基础上提出了M-PF算法。本文建立了无线分组调度系统模型,通过仿真对新算法在小尺度服务时间保证、大尺度服务时间公平和系统吞吐量等方面的性能进行分析,研究了系统参数对算法性能的影响。结果证明,新算法在保证系统吞吐量和大尺度公平性的同时可以提供更好的小尺度服务时间保证。     

基于物体的编码方法中的多物体速率控制

Ｍ Ｐ Ｅ Ｇ４［１～３］中提出了 Ｖ Ｏ（ Ｖｉｄｅｏ Ｏｂｊｅｃｔ）的概念,产生了多物体速率控制的问题。对于某一个 Ｖ Ｏ,在给定的固定速率限制下在各帧间分配数码率的建议算法在 Ｍ Ｐ Ｅ Ｇ４ 草案中已经提出。但是到目前为止,给定总带宽、在多个 Ｖ Ｏ 间合理分配数码率的算法,在 Ｍ Ｐ Ｅ Ｇ４ 草案中还是空白。本文提出了一种“等失真公平”分配算法来解决多物体间的数码率分配问题。     

部署QoS提高城域网承载多种业务的能力

本文结合青岛城域网的特点,讨论了部署QoS的相关问题,为下一步在城域网中承载多种业务提供了切合实际的参考.     

一种改进的CSFQ算法的设计与仿真

针对CSFQ算法存在的对TCP流的抑制及缓存策略等问题,提出采用ARED作为缓存管理的CSFQ改进算法A-CSFQ,并在多瓶颈链路下对其性能进行仿真。仿真结果表明,改进算法在保持CSFQ其他优点的基础上,显著减弱了对TCP流的抑制作用,提高了其对TCP流的公平性。