Peer-to-peer-based resource discovery in global grids: a tutorial

An efficient resource discovery mechanism is one of the fundamental requirements for grid computing systems, as it aids in resource management and scheduling of applications. Resource discovery activity involves searching for the appropriate resource types that match the user's application requirements. Various kinds of solutions to grid resource discovery have been suggested, including centralized and hierarchical information server approaches. However, both of these approaches have serious limitations in regard to scalability, fault tolerance, and network congestion. To overcome these limitations, indexing resource information using a decentralized (e.g., peer-to-peer (P2P)) network model has been actively proposed in the past few years. This article investigates various decentralized resource discovery techniques primarily driven by the P2P network model. To summarize, this article presents a: summary of the current state of the art in grid resource discovery, resource taxonomy with focus on the computational grid paradigm, P2P taxonomy with a focus on extending the current structured systems (e.g., distributed hash tables) for indexing d-dimensional grid resource queries,1 a detailed survey of existing work that can support rf-dimensional grid resource queries, and classification of the surveyed approaches based on the proposed P2P taxonomy. We believe that this taxonomy and its mapping to relevant systems would be useful for academic and industry-based researchers who are engaged in the design of scalable grid and P2P systems.     

基于“IPv6+”的应用感知网络（APN6）

互联网应用对网络带宽、时延、抖动、分组丢失率等方面的需求各不相同,而网络和应用的解耦导致网络无法有效感知应用的需求,因此难以为应用提供相应的服务质量SLA保障。提出一个基于IPv6的应用感知网络框架——APN6,通过将应用的需求信息封装在数据分组中,使网络能感知应用及其需求,便于网络进行流量调度和资源调整。设计了一种安全接入控制方案以解决 APN6 接入场景中存在的应用信息的伪造与篡改问题,确保APN6只对合法用户提供相应服务。     

Signaling architectures and recovery time scaling for grid applications in IST Project MUPBED

It is now evident to the research community that local computational resources cannot keep up in an economical way with the demands generated by some users/applications. Therefore, distributed computing and the concept of a computational grid are now emerging. Novel transport network concepts are needed to support such visions, and high-speed intelligent optical networking may be the required infrastructure that will enable global grids. Emerging utility grid applications like business continuity and disaster recovery have strong requirements on the dynamic optical networks connecting the distributed grid resources. Supporting grid networking with an intelligent optical network (ION) infrastructure will allow utility grid applications the necessary flexibility with the required QoS (e.g., high bandwidth, reliability, limited delay). Emerging QoS requirements, such as scalable recovery time, highly depend on the ION's signaling architecture. This article gives simple analytical models for the implementation options of optical control plane signaling, shows simulation models for different resilience strategies, and offers some illustrative numerical comparisons to support the aforementioned efforts. This research area is also discussed, among others, in the European research project Multi-Partner European Testbeds for Research Networking (MUPBED).     

Network Coding for the Internet and Wireless Networks

In today's practical communication networks such as the Internet, information delivery is performed by routing. A promising generalization of routing is network coding. The potential advantages of network coding over routing include resource (e.g., bandwidth and power) efficiency, computational efficiency, and robustness to network dynamics. This tutorial article provides an overview of the theory, practice, and applications of network coding.     

An End-to-End Bandwidth Allocation Algorithm for Ad Hoc Networks

Bandwidth-guaranteed QoS service in ad hoc networks is a challenging task due to several factors such as the absence of the central control, the dynamic network topology, the hidden terminal problem and the multihop routing property. An end-to-end bandwidth allocation algorithm was proposed in [Lin and Liu, 15] to support the QoS service in ad hoc networks. However, without exploring the global resource information along the route, the performance of that algorithm is quite limited. In addition, it also incurs significant control overhead. We develop a new algorithm for end-to-end bandwidth calculation and assignment in ad hoc networks which utilizes the global resource information along the route to determine the available end-to-end bandwidth. Our method also employs the topology-transparent scheduling technology to reduce the control overhead. The proposed algorithm can be efficiently utilized in a distributed manner. Both theoretical analysis and simulation results show that our end-to-end bandwidth allocation scheme can significantly improve the network capacity compared with the existing method.     

基于拓扑感知的可重构服务承载网动态重构算法

可重构信息通信基础网络通过构建服务承载网的方式为业务提供自适应的承载服务。针对高效利用有限底层资源的问题,提出一种基于资源关键度进行动态映射的服务承载网构建算法。算法将通过节点或链路的最短路径数作为资源关键度的衡量指标,区别对待底层资源;并实时动态感知关键资源的使用状况,依据不同业务需求对服务承载网进行自适应调整。仿真结果表明,算法在构建成功率、收益花费比和资源均衡度等方面均具有良好性能。     

基于代数连通度优化的空间信息网络分布式拓扑控制方法

针对空间信息网络中节点高速运动导致的网络拓扑结构难以长期稳定的问题,本文提出了基于代数连通度优化的网络动态拓扑控制方法,通过少量链路调整来维持网络拓扑的稳定性.为减小空间信息网络节点持续相对运动对网络拓扑结构稳定性造成的不利影响,针对网络初始化和网络重构场景,采用图论中的拉普拉斯矩阵特征值优化思想,构建了星上资源约束条件下的加权代数连通度最大化模型.为降低计算复杂度来实现网络拓扑的捷变控制,提出了基于连通矩阵弱摄动的动态网络拓扑控制策略.研究结果表明,提出的算法能够通过内点法,可高效地得到次优解,且次优解与全局最优解十分接近.     

A fuzzy modeling based dynamic resource allocation strategy in service grid

One of the major challenges in service grid is to guarantee the promised quality of service (QoS) for all the admitted users or applications, while maximizing the resource utilization through dynamic resource sharing. An efficient resource allocation method should ensure the service QoS and balance the load among service grid nodes which are often highly dynamic, heterogeneous and linked by wide-area network. In this paper, a new dynamic resource allocation method is presented and analyzed based on fuzzy modeling to solve the adaptation between heterogeneous applications with multiple QoS requirements and grid resource. Simulations in service grid with heterogeneous QoS requirements reveal that the proposed dynamic resource allocation method can distribute most suitable resource among the different service quickly and sensitively as the service QoS demand varies under the constraint of achieving maximum utilization of grid resources.     

Computational network federations: a middleware architecture for network-based computing

Computational Network Federations (CNFs) enable an arbitrary set of heterogeneous hosts which are connected via any type of network to form dynamic virtual distributed systems that cooperate to execute an application, or serve as generalized application service platforms to end users. CNFs motivate a view of the Internet as a vast unified host: a repository of information, application services, and an omnipresent supercomputing resource regardless of the type of access device or access methodology. CNFs provide a powerful way of virtualizing generalized enterprise networks (or even the Internet), and an economic and resilient model for deploying enterprise applications, (such as CRM) and peer-2-peer services (e.g., chatrooms). This paper describes a middleware architecture that enables network-based computing, communications, and services through a unified, access, and platform-independent approach. CNFs borrow from the capabilities of grid computing and aim toward intelligent computational service networks that are ubiquitous, secure, and adaptive to user and access-method idiosyncrasies. CNFs encompass a set of abstractions and interfaces that provide: 1) a unified service-oriented view of the network to the user; 2) a homogeneous host abstraction to applications; and 3) a shared-memory abstraction to software developers. This paper outlines the architecture of CNFs and describes in more detail i-DVM, a distributed multithreaded meta-OS that forms the core of a CNF and implements the virtual machine abstraction and location transparency.     

QoS provisioning dynamic connection-admission control for multimedia wireless networks using a Hopfield neural network

This paper presents a quality-of-service (QoS) provisioning dynamic connection-admission control (CAC) algorithm for multimedia wireless networks. A multimedia connection consists of several substreams (i.e., service classes), each of which presets a range of feasible QoS levels (e.g., data rates). The proposed algorithm is mainly devoted to finding the best possible QoS levels for all the connections (i.e., QoS vector) that maximize resource utilization by fairly distributing wireless resources among the connections while maximizing the statistical multiplexing gain (i.e., minimizing the blocking and dropping probabilities). In the case of congestion (overload), the algorithm uniformly degrades the QoS levels of the existing connections (but only slightly) in order to spare some resources for serving new or handoff connections, thereby naturally minimizing the blocking and dropping probabilities (it amounts to maximizing the statistical multiplexing gain). The algorithm employs a Hopfield neural network (HNN) for finding a QoS vector. The problem itself is formulated as a multi-objective optimization problem. Hardware-based HNN exhibits high (computational) speed that permits real time running of the CAC algorithm. Simulation results show that the algorithm can maximize resource utilization and maintain fairness in resource sharing, while maximizing the statistical multiplexing gain in providing acceptable service grades. Furthermore, the results are relatively insensitive to handoff rates.     

基于多层次的网格体系结构及关键技术研究

基于多层次网络结构,以"服务"为中心,构建了从信息获取、集成、处理到应用的完整的7层体系结构,提出了从数据库层、算法工具层、分析逻辑层到应用系统层4层资源管理逻辑模型,着重研究资源管理、资源交易等关键技术,实现重型机械领域的资源共享和信息服务。     

A wireless broadband ad-hoc ATM local-area network

We describe the theory, design and ongoing prototyping of a wireless ATM LAN/PBX capable of supporting mobile users with multi-Mb/s access rates and multi-Gb/s aggregate capacities. Our proposed LAN Consists of network nodes called Portable Base Stations (PBS) providing microcell coverage. The PBSs are designed to be low-cost, compact and high-speed and can be relocated conveniently. We employ a concept ofad-hoc networking in the layout of the PBS-to-PBS interconnection. That is, the PBSs can be distributed in an arbitrary topology to form a backbone network and can be reconfigured with relative ease. The PBS-to-PBS backbone links are high-speed (Gb/s) for supporting high system capacity. Although they can either be wired or wireless, our emphasis is on wireless implementations. The user-to-PBS links, on the other hand, are primarily for mobile access (e.g., 2–20 Mb/s) and therefore are wireless. Wired connections from stationary users to PBSs are also possible. Typical mobile users are assumed to be laptops or notebook computers. Services supported include conventional data applications (e.g., over TCP/IP or SPX/IPX) as well as multimedia (video, voice and data) applications with QoS (Quality-of-Service) guarantees. A wireless ATM concept is proposed so as to provide seamless internetworking with other wired ATM local and wide-area net-works. Algorithms and control in our network are highly distributed for simple implementations and ease of mobility management. A new wireless VP/VC concept and a Homing Algorithm are described to provide ATM cell routing and connections in the network. PBS hardware and software architectures are discussed. Call management, network management and signaling are designed for simplicity, high performance and modular implementations. A fast network restoration scheme is proposed to cope with the potential link or node failures in the ad-hoc network. Error control is addressed taking the unreliable wireless links into consideration. Finally, a prototyping project called BAHAMA (Broadband Ad Hoc ATM Anywhere) for demonstrating this network concept is briefly outlined.     

Backup reprovisioning with partial protection for disaster-survivable software-defined optical networks

As networks grow in size, large-scale failures caused by disasters may lead to huge data loss, especially in an optical network employing wavelength-division multiplexing (WDM). Providing 100 % protection against disasters would require massive and economically unsustainable bandwidth overprovisioning, as disasters are difficult to predict, statistically rare, and may create large-scale failures. Backup reprovisioning schemes are proposed to remedy this problem, but in case of a large-scale disaster, even the flexibility provided by backup reprovisioning may not be enough, given the sudden reduction in available network resource, i.e., resource crunch. To mitigate the adverse effects of resource crunch, an effective resource reallocation is possible by exploiting service heterogeneity, specifically degraded-service tolerance, which makes it possible to provide some level of service, e.g., reduced capacity, to connections that can tolerate degraded service, versus no service at all. Software-Defined Networking (SDN) is a promising approach to perform such dynamic changes (redistribution of network resources) as it simplifies network management via centralized control logic. By exploiting these new opportunities, we propose a Backup Reprovisioning with Partial Protection (BRPP) scheme supporting dedicated-path protection, where backup resources are reserved but not provisioned (as in shared-path protection), such that the amount of bandwidth reserved for backups as well as their routings are subject to dynamic changes, given the network state, to increase utilization. The performance of the proposed scheme is evaluated by means of SDN emulation using Mininet environment and OpenDaylight as the controller.     

An econometric model for resource management in competitive wireless data networks

This article investigates the role and importance of the economic aspects that are vital to the success of wireless services deployment and provider selection by users in a competitive environment. We show how some of the econometric measures can meaningfully capture the user decisions/actions (e.g., churning) that can potentially be utilized by the providers in managing radio resources (e.g., bandwidth) in wireless data networks. In particular, by modeling the interaction between a service provider and its customers (or users) as a non-cooperative game, we propose a novel cross-layer resource management framework for integrated admission and rate control in CDMA networks. Analytical and simulation results demonstrate how the proposed framework can help minimize customer churning and maximize revenue for the wireless operators, yet optimizing customer satisfaction by providing differentiated quality of service to different classes of users.     

Comprehensive design methodology for control and data planes in wavelength-routed optical networks

We propose a comprehensive design methodology for control and data planes of wavelength-routed optical networks (WRONs) employing mixed-line-rate (MLR) transmission for cost-effective resource provisioning. The proposed approach attempts to minimize the maximum lightpath capacity demand in Gbps (representing the measure of lightpath congestion) in network for a given traffic matrix by using a mix of a heuristic scheme and linear programming (LP). In the first step of the proposed three-step design, some lightpaths are set up on a set of judiciously selected fiber links (with point-to-point lightpaths between neighboring nodes), on a specific wavelength throughout the network, and an appropriate fraction of the same set of lightpaths is utilized for carrying control information, forming therefore the control plane (CP) of the WRON. The remaining bandwidth of these lightpaths is utilized to carry the data traffic along with all other designed lightpaths of the WRON using appropriate algorithm, forming the overall data plane (DP) of the WRON. In the second step, traffic routing is carried out through LP to minimize lightpath congestion in the network. In the third step, we utilize the results of LP to assign rates to lightpaths, such that the cost (considering only the transceiver cost) of the network is minimized. This design leads to congestion-aware MLR network with due consideration to cost-effectiveness without compromising the network restoration response against link failures. We carry out simulation studies employing possible CPs using both symmetric (CP topology being same as the physical topology) as well as asymmetric (using fewer fiber links than the symmetric case) topology. The results of our simulations indicate that the proposed design of CP with symmetric/asymmetric topology and in-band transmission with sub-lightpath capacity can bring down network congestion and cost with respect to symmetric out-of-band transmission (using fully reserved lightpaths for CP), without any perceptible sacrifice in respect of the network restoration time. Failure can occur either in CP or DP, or in both the planes. We investigate the effect of design of CP with symmetric/asymmetric topology on network restoration time for single- and double-link failures. We further present DP design methodology with hybrid restoration scheme, i.e., combination of dedicated (1:1) path protection and path restoration. We analyze the effect of symmetric CP topology and degree of protection on the congestion of the network. Some lightpaths, that support more traffic, are protected against failures, while the others are left for path restoration in the event of failures. As more lightpaths are protected, the congestion and power consumption of network increase. We provide an analysis of the factors that come into play while altering the degree of protection and observe how the choice for the degree of protection in DP can be arrived at using an appropriate design methodology.     

Topology discovery in heterogeneous IP networks: the NetInventory system

Knowledge of the up-to-date physical topology of an IP network is crucial to a number of critical network management tasks, including reactive and proactive resource management, event correlation, and root-cause analysis. Given the dynamic nature of today's IP networks, keeping track of topology information manually is a daunting (if not impossible) task. Thus, effective algorithms for automatically discovering physical network topology are necessary. Earlier work has typically concentrated on either 1) discovering logical (i.e., layer-3) topology, which implies that the connectivity of all layer-2 elements (e.g., switches and bridges) is ignored, or 2) proprietary solutions targeting specific product families. In this paper, we present novel algorithms for discovering physical topology in heterogeneous (i.e., multi-vendor) IP networks. Our algorithms rely on standard SNMP MIB information that is widely supported by modern IP network elements and require no modifications to the operating system software running on elements or hosts. We have implemented the algorithms presented in this paper in the context of the NetInventory topology-discovery tool that has been tested on Lucent's own research network. The experimental results clearly validate our approach, demonstrating that our tool can consistently discover the accurate physical network topology with reasonably small running-time requirements even for fairly large network configurations.     

Pervasive grid for large-scale power systems contingency analysis

Optimal control and management of power systems require extensive analyses of phenomena that can compromise their operation in order to evaluate their impact on the security and reliability levels of the electrical networks. For complex networks, this process, known as power systems contingencies analysis, requires large computational efforts, whereas computation times should be less than a few minutes for the information to be useful. Even though many architectures based on conventional parallel and distributed systems have been widely proposed in the literature, they are characterized by low extensibility, reusability, and scalability, and so, they require a sensible hardware upgrade when more computational resources are necessary. This event is not infrequent in power systems where the constant growth of the electrical network complexity and the need for larger security and reliability levels of the plant infrastructures lead to the need of more detailed contingency analysis in shorter times. To address this problem, this paper proposes a pervasive grid approach to define a user-friendly software infrastructure for data acquisition from electrical networks and for data processing in order to simulate possible contingencies in a real electrical network. The grid infrastructure adopts a brokering service, based on an economy-driven model, to satisfy the quality of service constraints specified by the user (i.e., a time deadline to simulate the contingencies). This paper also discusses the deployment of the infrastructure on a network of heterogeneous clusters and PCs to compute the contingency analysis of a realistic electrical network. The experimental results obtained demonstrate the effectiveness of the proposed solution and the potential role of grid computing in supporting intensive computations in power systems.     

A LP-based Admission Control Using Artificial Neural Networks for Integrated Services in Mobile Networks

In mobile networks the traffic fluctuation is unpredictable dueto mobility and varying resource requirements of multimedia applications.Henceit is essential to maintain the traffic within the network capacity to providethe service guarantees to running applications. Thispaper proposes an Admission Control (AC) scheme in a single mobile cellularenvironment supporting real-time and non-real-time application traffic. In thecase of a real-time and non-real-time multimedia applications, eachapplication has its own distinct range of acceptable Quality of Service (QoS)requirements(e.g., packet loss, delay, jitter, etc.). The network provides the service bymaintaining the application specified QoS range. We propose a LinearProgrammingResource Reduction (LP-RR) principle for admission control by maintainingQoSguarantees to existing applications and to increase the percentage ofadmissionto real-time and non-real-time applications. Artificial Neural Networks (ANNs)are used to solve linear programming problem, which facilitates an on-lineadmissioncontrol decision in the practical systems.The simulation results demonstrate that the proposed AC schemeperforms well in terms of admitted applications and maintains lower percentageof rejection to hand-off and new applications of different traffic classes.The suggested principle also shown that it is appropriate for the fairresourceallocation with improved resource utilization.     

Design of an optimized traffic-aware routing algorithm using integer linear programming for software-defined networking

The number of internet users and connected devices has dramatically expanded due to the recent technological boom and the benefits that the internet of things offers to ease our lives. Network scheduling, quality of service, resource allocation, and security issues are now being addressed via software-defined networking (SDN). SDN has several benefits over traditional networks, including global centralized control, managing network traffic, and separating the forwarding and control plane. The work done in this paper aims to design and implement a traffic-aware routing framework based on routing optimization presented as an integer linear programming (ILP) to improve heterogeneous traffic flows' quality of service (QoS) in a simulated SDN environment. With the knowledge that the routing problem is a nondeterministic polynomial-time-hard problem, the proposed scheme aims to decrease the computational routing time to make the ILP-based routing system more suitable for real-time processing. The simulation results illustrate that the proposed framework reduces the computational time by 23% and 49% for Abilene and Goodnet topology, respectively. Additionally, with 1000 flows in the network, the suggested scheme reduces the number of network flows that violate the QoS by 9% and 22% (with Abilene topology) and 16% and 51% (with Goodnet topology) as compared to the existing shortest path delay and sway methods, respectively.     

Management of networks and services in a composite radio context

This article adopts the assumption that different wireless access technologies (e.g., UMTS, HIPERLAN2, and DVB-T) can be cooperating components of a composite radio infrastructure. The coordinated management of services and network in this heterogeneous context is a complex task. This article presents a service and network resource management platform for wireless systems that operate in a composite radio context. Aspects addressed are the requirements, high-level platform design, functionality of the components that conduct monitoring, resource brokerage, service management, and network resource optimization. Indicative results are presented and concluding remarks provided.