Particle model to optimize resource allocation and task assignment

This paper presents a novel generalized particle model for the parallel optimization of the resource allocation and task assignment in complex environment of enterprise computing. The generalized particle model (GPM) transforms the optimization process into the kinematics and dynamics of massive particles in a force-field. The GPM approach has many advantages in terms of the high-scale parallelism, multi-objective optimization, multi-type coordination, multi-degree personality, and the ability to handle complex factors. Simulations show the effectiveness and suitability of the proposed GPM approach to optimize the enterprise computing.     

Radio resource allocation problems for OFDMA cellular systems

Orthogonal frequency division multiple-access (OFDMA) manages to efficiently exploit the inherent multi-user diversity of a cellular system by performing dynamic resource allocation. Radio resource allocation is the technique that assigns to each user in the system a subset of the available radio resources (mainly power and bandwidth) according to a certain optimality criterion on the basis of the experienced link quality. In this paper we address the problem of resource allocation in the downlink of a multi-cellular OFDMA system. The allocation problem is formulated with the goal of minimizing the transmitted power subject to individual rate constraint for each user. Exact and heuristic algorithms are proposed for the both the single-cell and the multi-cell scenario. In particular, we show that in the single-cell scenario the allocation problem can be efficiently solved following a network flow approach. In the multi-cell scenario we assume that all cells use the same frequencies and therefore the allocation problem is complicated by the presence of strong multiple access interference. We prove that the problem is strongly NP-hard, and we present an exact approach based on an MILP formulation. We also propose two heuristic algorithms designed to be simple and fast. All algorithms are tested and evaluated through an experimental campaign on simulated instances. Experimental results show that, although suboptimal, a Lagrangian-based heuristic consisting in solving a series of minimum network cost flow problems is attractive for practical implementation, both for the quality of the solutions and for the small computational times.     

A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds

Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to offer services that satisfy the QoS requirements of individual users while guaranteeing at the same time an efficient utilization of network resources.In this paper we introduce a new service model that provides per-flow bandwidth guarantees, where users subscribe for a guaranteed rate; moreover, the network periodically individuates unused bandwidth and proposes short-term contracts where extra-bandwidth is allocated and guaranteed exclusively to users who can exploit it to transmit at a rate higher than their subscribed rate.To implement this service model we propose a dynamic provisioning architecture for intra-domain Quality of Service networks. We develop a set of dynamic on-line bandwidth allocation algorithms that take explicitly into account traffic statistics and users’ utility functions to increase users’ benefit and network revenue.Further, we propose a mathematical formulation of the extra-bandwidth allocation problem that maximizes network revenue. The solution of this model allows to obtain an upper bound on the performance achievable by any on-line bandwidth allocation algorithm.We demonstrate through simulation in realistic network scenarios that the proposed dynamic allocation algorithms are superior to static provisioning in providing resource allocation both in terms of total accepted load and network revenue, and they approach, in several network scenarios, the ideal performance provided by the mathematical model.     

多Agent系统问题求解的广义粒子模型方法

提出一种多Agent系统分布式问题求解的新的广义粒子模型,将复杂环境下多Agent系统资源分配和任务规划的优化问题转变为广义粒子模型中的粒子运动学和动力学问题.广义粒子模型可以描述和处理的复杂环境包括多Agent系统中的Agent之间存在的随机、并发、多类型的交互行为.各Agent有不同的个性、自治性、生命周期、拥塞程度和故障几率等.本文讨论了广义粒子模型和多Agent系统分布式问题求解的关系,提出了广义粒子模型的数学物理模型和多Agent系统分布式问题求解算法,并且证明了它们的正确性、收敛性、稳定平衡性等基本性质.通过复杂环境下多Agent系统资源分配和任务规划问题的实验和比较,证实了广义粒子模型方法的有效性及其特点.     

Fair and efficient dynamic bandwidth allocation for multi-application networks

The large diversity of applications and requirements posed to current network environments make the resource allocation problem difficult to work out. This paper proposes a dynamic algorithm based on weighted fair queueing (WFQ) to promote fairness (in the Rawlsian sense) and efficiency (in the Paretian sense) in the allocation of bandwidth for multi-application networks. Utility functions are used to characterize application requirements and provide the informational basis from where the algorithm operates. Aggregation techniques are employed to ensure scalability in the network core. Simulation results confirm a significant improvement of our approach over traditional bandwidth allocation algorithms (maxmin and proportional fairness). The algorithm also provides low errors (below 10% when compared to the zero-delay centralized approach) whenever response time does not exceed 1000 times the timescale involving flow arrivals and departures.     

基于双维序路由策略的低能耗NoC网络分配

在片上网络(NoC)的网络分配与任务映射相配合的路径分配中,单维序路由策略会限制可行解空间。为此,提出一种基于双维序路由策略的网络分配方法。在路径分配步骤中采用双维序路由法,设计以带宽、延时和无死锁为约束条件、以降低动态及静态能耗为优化目标的遗传算法。实验结果表明,该方法可以扩大任务映射的可行解空间,求解最小所需带宽比单维序法平均减少6.3%,且在各种带宽场合时均能求得更低能耗解。     

基于用户和分级QoS的动态带宽分配的研究

传统用户带宽固定不变的管理办法,存在即使网络出口带宽空闲,用户也不能获得更高带宽的问题,网络出口带宽得不到充分利用。提出了一种基于用户和分级QoS的动态带宽分配控制算法（Dynamic Bandwidth Allocation based on User and Multi-level QoS）,该算法根据网络出口带宽的使用状态,以及用户的QoS等级动态地调整用户带宽。实验结果表明,该算法能够在保证网络有效运行的状态下,最大限度地为用户提供带宽,有利于充分利用网络出口带宽。     

基于广义细胞自动机的网络带宽优化

Nowadays,bandwidth allocation schemes in a TCP/IP or ATM network are congestion avoidance oriented.Few scheme has taken global optimization into account,for global optimization problem can not be easily solved by conventional mathematical method due to the complexity and large-scale of massive information system,such as Internet.We present a novel bandwidth allocation scheme based on generalized cellular automaton (GCA).Firstly we introduce how to map network topology into GCA model,then we propose how cells and macro cells interact in our solution.Our simulation results show the scheme leads to global optimization rapidly.     

一种基于卫星网络的虚拟网络功能快速映射算法

针对卫星网络中卫星载重有限,不允许大规模部署物理硬件,导致其网络功能欠缺且网络管理和配置不灵活的问题,文中提出了基于软件定义网络(Software Defined Networking,SDN)/网络功能虚拟化(Network Function Virtualization,NFV)协同部署的卫星网络新架构。它通过SDN数控分离思想对网络进行动态管控,利用NFV技术在SDN的数字平面虚拟出网络功能,使网络功能能够从硬件设备中解耦出来,从而提高网络的灵活性。为了解决此框架中虚拟网络功能(Virtual Network Function,VNF)映射到底层物理网络上的时延过大且无法满足高动态卫星网络实时性的问题,进一步提出了Viterbi和图形模式匹配(Graph Pattern Matching,GPM)相结合的动态映射方法(Viterbi and GPM Dynamic Placement Approach,VG-DPA)。该算法将映射过程建模为隐马尔可夫服务链,采用Viterbi算法预计算满足软硬件限制的映射路径,然后根据预计算结果通过GPM来制定VNF编排策略。该算法解决了卫星网络中将所需的VNF映射到底层物理网络中时延过大的问题。实验结果表明,VG-DPA与传统的RAND和OMD算法相比能在很大程度上降低时延,减少资源消耗。     

基于比例积分控制器的分布式动态带宽分配算法

针对公平、有效分配地理上呈分布式的控制系统带宽的问题,提出了一种分布式的动态带宽分配算法。首先把这种带宽分配问题构建为一个凸优化问题,使全部控制系统的效用最大化;再采用分布式带宽分配算法思想,使得控制系统基于网络反馈的拥塞信息改变其采样周期,得到可利用的最大采样速率或最大传输速率;然后把控制系统和链路之间的相互作用建模为一个时延动态系统,并采用比例积分(PI)控制器作为链路队列控制器来实现算法。仿真结果表明,所提带宽分配算法不仅能够使全部设备的传输速率在10 s内收敛到全部设备均等共享的链路带宽值;同时对于PI控制器来说,其队列稳定在期望设置点50个数据包左右,而且能够准确、稳定地跟踪输入信号,使全部控制系统的性能最大化。     

A new high performance approach: merging optimal multicast sessions for supporting multisource routing

Each single source multicast session (SSMS) transmits packets from a source node s _i to a group of destination nodes t _i , i=1,2,…,n. An SSMS’s path can be established with a routing algorithm, which constructs multicast path between source and destinations. Also, for each SSMS, the routing algorithm must be performed once. When the number of SSMS increases to N≥2, the routing algorithm must be separately performed N≥2 times because the number of source nodes increase to N≥2 (for each SSMS the routing algorithm must be performed once). This causes that time of computation and bandwidth consumption to grow. To remove this problem, in this paper, we will present a new approach for merging different SSMSs to make a new multicast session, which is performed only with one execution of a routing algorithm. The new approach, merging different sessions together, is based on the optimal resource allocation and Constraint Based Routing (CBR). We will show that as compared to other available routing algorithms, it improves time of computation and bandwidth consumption and increases data rate and network efficiency. The new approach uses CBR and merges more than one single source multicast session (SSMS) problem to one multisource multicast session (MSMS) problem. By solving one MSMS problem instead of solving more than one SSMS, we can obtain an optimal solution that is more efficient than optimal solutions of SSMS problems.     

A new generalized particle approach to parallel bandwidth allocation

This paper presents a new generalized particle (GP) approach to dynamical optimization of network bandwidth allocation, which can also be used to optimize other resource assignments in networks. By using the GP model, the complicated network bandwidth allocation problem is transformed into the kinematics and dynamics of numerous particles in two reciprocal dual force-fields. The proposed model and algorithm are featured by the powerful processing ability under a complex environment that involves the various interactions among network entities, the market mechanism between the demands and service, and other phenomena common in networks, such as congestion, metabolism, and breakdown of network entities. The GP approach also has the advantages in terms of the higher parallelism, lower computation complexities, and the easiness for hardware implementation. The properties of the approach, including the correctness, convergency and stability, are discussed in details. Simulation results attest to the effectiveness and suitability of the proposed approach.     

大规模通信网络带宽优化分配问题研究

提出一种大规模通信网络带宽分配的新方法．作者将大系统理论中的分解—协调方法运用于解决大规模通信网络带宽分配的优化问题，大型网络的优化问题被分解成一些互相关联的小型子网的优化问题．整个带宽优化分配问题的解决分为三个阶段：分解、协调优化及合并优化．计算结果表明，与现有算法相比，分解—协调大规模带宽管理算法(DCLPBM)既保证了很高的计算精度，又降低了时间与空间复杂度．由于算法中用到的协调机制较简单，DCLPBM易于推广到分布式计算环境，从以网络来治理网络的角度看，它具有较广的前景．     

Dynamic bandwidth allocation for 3G wireless systems—A fuzzy approach

3G Wireless systems are to support multiple classes of traffic with widely different characteristics and quality of service (QoS) requirements. A major challenge in this system is to guarantee the promised QoS for the admitted users, while maximizing the resource allocation through dynamic resource sharing. In the case of multimedia call, each of the services has its own distinct QoS requirements concerning probability of blocking (P_B), service access delay (SAD), and access delay variation (ADV). The 3G wireless system attempts to deliver the required QoS by allocating appropriate resources (e.g. bandwidth, buffers), and bandwidth allocation is a key in achieving this. Dynamic bandwidth allocation policies reported so far in the literature deal with audio source only. They do not consider QoS requirements. In this work, a fuzzy logic (FL)-based dynamic bandwidth allocation algorithm for multimedia services with multiple QoS (P_B, SAD, ADV, and the arrival rate) requirements are presented and analyzed. Here, each service can declare a range of acceptable QoS levels (e.g. high, medium, and low). As QoS demand varies, the proposed algorithm allocates the best possible bandwidth to each of the services. This maximizes the utilization and fair distribution of resources. The proposed allocation method is validated in a variety of scenarios. The results show that the required QoS can be obtained by appropriately tuning the fuzzy logic controller (FLC).     

Dynamic bandwidth allocation for Internet telephony

Internet telephony is promising for long-distance calls because of its low service charge and value-added functions. To provide Internet telephony to the general public, a service provider can operate a telephone gateway in each servicing city to bridge the local telephone network and the Internet, so that users can use telephones or fax machines to access this gateway for services. In this paper, we propose a dynamic bandwidth allocation scheme for two purposes: (1) each telephone gateway can fully utilize the available bandwidth to serve more telephone and fax sessions and (2) it can respond to the changing environments. We exploit three properties for dynamic bandwidth allocation. First, in a telephone session, each user usually alternates between speaking and listening. When a user is not speaking, she does not send any voice stream and hence the bandwidth can be dynamically released from this session for the other sessions. Second, voice traffic is elastic because it can be further compressed at the cost of a lower quality. Third, fax traffic is flexible because it can be temporarily delayed. We exploit these three properties to allocate bandwidth to telephone and fax sessions dynamically. When a telephone gateway adopts dynamic bandwidth allocation, it can serve more telephone and fax sessions while providing acceptably good quality-of-service (QoS), and it can give more stable QoS when the available bandwidth varies.     

Dynamic Reconfiguration of Optically Interconnected Networks with Time-Division Multiplexing

Routing performance of optical interconnection networks is limited by both switch complexity and network connectivity. One way to overcome these limitations is to allocate the network bandwidth in a time-division multiplexed (TDM) fashion. With this technique, an appropriate subset of input-to-output connections can be established during a time slot and all possible connections can be established over several time slots. Emulating a fully connected network, however, requires a large multiplexing degree, and thus introduces latencies which may be prohibitive. As a solution, we propose a technique called reconfiguration with time-division multiplexing (RTDM). With RTDM, only a subset, as required by applications, of all possible connections needs to be multiplexed in the network by letting the network go through a sequence of configurations. Network reconfiguration with TDM can be done either statically or dynamically. Static RTDM is applied when communication requirements of an application are known a priori. This paper deals mainly with dynamic RTDM, which requires run time control to accommodate dynamic connection requests. We show that reconfiguration overhead can be amortized over a sequence of configurations. In particular, we describe how the complexity of a dynamic reconfiguration control algorithm can be reduced through pipelined processing of requests. Our simulations show that dynamic RTDM allows for fair and fast allocation of network resources to connection requests. As a result, network service time decreases and communication efficiency increases.     

A multi-agent approach for dynamic channel allocation

We propose a multi‐agent approach for dynamic channel allocation (MA‐DCA) in mobile cellular networks. Our approach assumes that each cell in a cellular network works as an agent that negotiates its bandwidth (channel) requirements with its neighbors to minimize its call drop probability. Using stochastic simulation, we compare our MA‐DCA approach with simple fixed channel allocation (FCA) and dynamic channel borrowing approaches for different call arrival rates, cellular network sizes and number of available channels. The results of our experiments show that the proposed MA‐DCA approach performs better than dynamic channel borrowing and FCA approaches.     

Interlayer Jitter Index for the Transmission of Layered Video Stream over the Internet

A novel scheme of dynamic bandwidth allocation and buffer dimensioning based on the video playback tunnel and the jitter_index tunnel is proposed to guarantee the synchronization between the basic layer video stream and the enhancement layer video streams in the transmission of layered video streams over the Internet. The performance of the proposed scheme is evaluated using a set of real-life video traces with the focus on the effects of bandwidth, traffic burstiness and network traffic loading on the statistics of jitter_index between the basic layer and enhancement layers. The numerical results show that the proposed dynamic bandwidth allocation and buffer dimensioning scheme is able to significantly reduce the effect of interlayer jitters in the transmission of multiple layer-coded video streams over the Internet.     

异构无线网络密集部署场景下高效网络接入及频谱分配

如何在异构网络重叠覆盖场景下实现动态耦合频谱资源高效分配以满足用户流量需求是下一代无线通信网络的重要挑战。综合考虑网络域频谱属性差异化及用户域需求多样化问题，以用户获得总带宽最大化为目标，将频谱资源分配建模为非线性多约束条件0-1整数规划问题，并设计了两种求解方法。首先，设计了一种基于改进匈牙利算法的化简方法，该方法通过对约束条件进行化简，将复杂模型转化为标准形式0-1规划，并通过对匈牙利算法进行改进，有效求解了该复杂的频谱分配问题；其次，设计了一种改进的遗传算法，把主网络干扰约束及次用户需求融合进适应度评估中，以修正不符合要求的基因，并利用精英主义思想保留优秀个体，以进化迭代到优秀个体。最后通过实验对提出的方法与粒子群优化方法的性能进行对比分析，实验结果显示化简方法具有较大的效率优势，而改进遗传算法可得到更大的带宽。