Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

新一代智能城域光网络

本提出了一种标准化的光控制平面。阐明了开了用于光传输网的控制平面所遇到的选择与挑战。光控制平面被分解成邻居发现、服务发现、连接控制和拓扑、资源发现等几个基本的过程。不同的网络组织和分割导致了几个不同的自动配置模型：软性持久链路模型、用户接口模型和对等模型。这是构成以IP为中心的光传输网的控制和管理基础。同时也介绍了基于SDH光交换的新一代CIENA公司智能光网络，它具有大容量光交换能力和网络拓扑结构自动发现、端对端电路配置、带宽动态分配等功能及特点，将大大提高数据、电路业务的服务质量，新一代智能光网络是干线和城域网络交换传输最佳的选择。     

云计算下基于CRP算法的资源提供策略

云计算资源管理系统是用于接收来自云计算用户的资源请求,并且把特定的资源封装为服务提供给资源请求者。在云计算环境下,如何为资源请求者选择合适的资源是一个值得研究的课题。文中通过对云计算下现有的资源提供策略的分析,同时根据不同云提供者提供的计算资源的成本不同的特点,综合考虑资源的计算能力、可靠性和单位成本三点因素,提出了云计算下基于CRP算法的资源提供策略。这种资源提供策略既能提供满足用户资源请求的服务,也能降低云服务提供者的运营成本,从而获得更大收益。     

基于势能导向多下一跳路由的服务承载网构建方法

服务承载网络是基于服务构建的以满足服务端到端QoS保障为出发点的覆盖网络,是满足可重构柔性网络对业务需求支撑的有效的网络架构。基于可重构柔性网络体系框架,分析服务承载网构建的主要问题,提出了可重构柔性网络下服务承载网的构建原则,在此基础上给出了基于势能导向多下一跳路由的服务承载网构建算法,并对其进行了性能分析及仿真。仿真结果表明,该算法具有较高的构建成功率。     

Resource-aware hybrid scheduling algorithm in heterogeneous distributed computing

Today, almost everyone is connected to the Internet and uses different Cloud solutions to store, deliver and process data. Cloud computing assembles large networks of virtualized services such as hardware and software resources. The new era in which ICT penetrated almost all domains (healthcare, aged-care, social assistance, surveillance, education, etc.) creates the need of new multimedia content-driven applications. These applications generate huge amount of data, require gathering, processing and then aggregation in a fault-tolerant, reliable and secure heterogeneous distributed system created by a mixture of Cloud systems (public/private), mobile devices networks, desktop-based clusters, etc. In this context dynamic resource provisioning for Big Data application scheduling became a challenge in modern systems. We proposed a resource-aware hybrid scheduling algorithm for different types of application: batch jobs and workflows. The proposed algorithm considers hierarchical clustering of the available resources into groups in the allocation phase. Task execution is performed in two phases: in the first, tasks are assigned to groups of resources and in the second phase, a classical scheduling algorithm is used for each group of resources. The proposed algorithm is suitable for Heterogeneous Distributed Computing, especially for modern High-Performance Computing (HPC) systems in which applications are modeled with various requirements (both IO and computational intensive), with accent on data from multimedia applications. We evaluate their performance in a realistic setting of CloudSim tool with respect to load-balancing, cost savings, dependency assurance for workflows and computational efficiency, and investigate the computing methods of these performance metrics at runtime.     

Equilibrium analysis through separation of user and network behavior

Internet complexity makes reasoning about traffic equilibrium difficult, partly because users react to congestion. This difficulty calls for an analytic technique that is simple, yet have enough details to capture user behavior and flexibly address a broad range of issues.This paper presents such a technique. It treats traffic equilibrium as a balance between an inflow controlled by users, and an outflow controlled by the network (link capacity, congestion avoidance, etc.). This decomposition is demonstrated with a surfing session model, and validated with a traffic trace and NS2 simulations.The technique’s accessibility and breadth are illustrated through an analysis of several issues concerning the location, stability, robustness and dynamics of traffic equilibrium.     

Intelligent Network Provisioning for Dynamically Downloadable Applications in Beyond 3G Mobile Networks

Mobile communications beyond 3G will integrate different (but complementary) access technologies into a common platform to deliver value-added services and multimedia content in an optimum way. However, the numerous possible configurations of mobile networks complicated the dynamic deployment of mobile applications. Therefore, research is intensely seeking a service provisioning framework that is technology-independent, supports multiple wireless network technologies, and can interwork high-level service management tasks to network management operations. This paper presents an open value chain paradigm, a model for downloadable applications and a mediating platform for service provisioning in beyond 3G mobile settings. Furthermore, we introduce mechanisms that support a coupled interaction between service deployment and network configuration operations, focusing on the dynamic provisioning of QoS state to data path devices according to the requirements of dynamically downloadable mobile value-added services (VAS).

Hammerstein-Wiener nonlinear model based predictive control for relative QoS performance and resource management of software systems

Runtime management of Quality of Service (QoS) performance and resource provisioning is a vital issue in shared resource software environments. A useful performance management technique for such software systems is the relative guarantee feedback control scheme. The existing approaches for this class of control systems are mainly based on off-line linear or on-line model identification and control techniques, which tend to have performance issues in the presence of nonlinearities induced by this scheme. Instead of using such modeling techniques, this paper proposes a new approach for QoS performance management and resource provisioning by using an off-line identification of Hammerstein and Wiener nonlinear block structural model. Using the characteristic structure of the nonlinear model, a predictive feedback controller based on a gain schedule technique is incorporated in the design to achieve the performance objectives. The proposed approach is validated using experiments based on a prototype, demonstrating superior runtime QoS performance management and resource provisioning in a complex software system.     

Impacts of user-selfishness on cooperative content caching in social wireless networks

Cooperative caching can be an effective mechanism for reducing electronic content provisioning cost in Social Wireless Networks (SWNETs). These networks are formed by a collection of mobile data enabled devices physically gathering in settings such as university campus, malls, airport and other public places. In this paper, we first propose an optimal collaborative object caching policy in order to minimize the object provisioning cost in SWNETs with homogenous user requests and a peer-rebate model for promoting collaboration. Then using an analytical model we study the impacts of user selfishness on the provisioning cost and the earned rebate when certain nodes in an SWNET selfishly deviate from the optimal policy. User selfishness is motivated in order to either increase individually earned rebate or to reduce content provisioning cost. The analytical model is validated by experimental results from simulated SWNETs using the network simulator ns2.     

Approximation analysis of multi-class closed queueing maintenance networks with a parts inventory system and two-phase Coxian time distributions

We consider a maintenance network where a set of bases is supported by a replacement parts inventory system and a centrally located repair depot. The ordering policy for the parts is the (S, Q) inventory policy. We extended the previous results to the network, where processing times at each node follow a two-phase Coxian distribution. The proposed network was modeled as a multi-class closed queueing network with a synchronization station. To make the analysis of the network computationally tractable, we developed a two-phase approximation method. In the first phase of the method, the proposed network was analyzed with the previous algorithm based on a product-form approximation. In the second phase, a sub-network was again analyzed with the procedure of a product-form approximation method such that the state space of the sub-network was reduced. In the analysis of a sub-network, a recursive method was also used to solve balance equations by exploiting the special structure of the Markov chain. The new algorithm provided a good estimation of the performance measures of interest. In addition to being accurate, the new algorithm is simple and converges rapidly.