Multilayer Protection with Availability Guarantees in Optical WDM Networks

Survivability is a key concern in modern network design. This paper investigates the problem of survivable dynamic connection provisioning in general telecom backbone networks, that are mesh structured. We assume differentiated services where connections may have different availability requirements, so they may be provisioned differently with protection (if needed) based on their availability requirements and current network state. The problem of effectively provisioning differentiated-service requests, that has been widely investigated for connections routed at the physical layer, assumes peculiar features if we consider sub-wavelength requests at the logical layer that have to be protected (or more generically, whose availability target has to be guaranteed), but also have to be groomed for an efficient use of network resources. An integrated multilayer approach is necessary that considers requirements and grooming of connections at the logical layer as well as their routing and availability at the physical layer. Joint availability-guaranteed routing and traffic grooming may lead to a negative interaction, since the objective of the first problem (guaranteeing a given level of availability to the connections) clashes with the objective of the other problem (minimizing resource consumption). For a multilayer WDM mesh network, we propose new multilayer routing strategies that perform effective availability-guaranteed grooming of sub-wavelength connections. These strategies jointly considers connection availability satisfaction and resource optimization and are developed under two different practical hypotheses: guaranteed target, i.e., a connection is routed only if its availability target is satisfied, and best-effort target, a connection is always routed and, when the availability target cannot be guaranteed, the path with the best possible availability is provisioned. Numerical results are reported and discussed for the two approaches mentioned above. In both cases, the results show high effectiveness of our provisioning strategy.     

A Computational Economy for IN Load Control Using a Multi-Agent System

Intelligent Networks (IN) are used in telecommunication networks to provide services that require a decision-making network element. The Service Control Point (SCP) can be overloaded when the number of service requests exceeds the SCPs designed capacity. Traditional IN load control algorithms assume a single service network model or use a centralized controller to find a solution. In this paper we propose and investigate a market-based model, in the form of a computational economy, for solving the distributed IN load control problem for a multi-service network. We investigate two algorithms, one price-oriented and the other resource-oriented, for finding the competitive equilibrium for this economy. We conclude that the price-oriented approach generally performs better and allows a greater level of distributed-decision making but suffers from an infeasible solution in real-time systems. Furthermore, we study a realization of this model as a multi-agent system (MAS) and investigate the communication overhead associated with running auctions for services.     

Adaptive middleware supporting scalable performance for high-end network services

Network service-based computation is a promising paradigm for both scientific and engineering, and enterprise computing. The network service allows users to focus on their application and obtain services when needed, simply by invoking the service across the network. In this paper, we show that an adaptive, general-purpose run-time infrastructure in support of effective resource management can be built for a wide range of high-end network services running in a single-site cluster and in a Grid. The primary components of the run-time infrastructure are: (1) dynamic performance prediction; (2) adaptive intra-site resource management; and (3) adaptive inter-site resource management. The novel aspect of our approach is that the run-time system is able to dynamically select the most appropriate performance predictor or resource management strategy over time. This capability not only improves the performance, but also makes the infrastructure reusable across different high-end services. To evaluate the effectiveness and applicability of our approach, we have transformed two different classes of high-end applications—data parallel and distributed applications—into network services using the infrastructure. The experimental results show that the network services running on the infrastructure significantly reduce the overall service times under dynamically varying circumstances.     

Responsive,deterministic IEEE 802.5 token ring scheduling

This paper presents a novel approach for scheduling the IEEE 802.5 token ring. This approach not only guarantees deadlines for synchronous class messages, but also dramatically reduces asynchronous class response times. Further, highly responsive guaranteed service is introduced for alert class asynchronous messages. Conventional use of the IEEE 802.5 token ring standard guarantees synchronous communication services using Time Domain Multiplexing (TDM) techniques while relegating asynchronous class message services to background status. The result is poor responsiveness. Further, the TDM schedules tend to be fragile and difficult to modify and extend. This paper presents an algorithmic-based scheduling approach that supportsa priori schedulability determination for arbitrary synchronous message sets without the costly development, testing, and tuning of TDM schedules. This capability allows the IEEE 802.5 standard to support dynamic, adaptive, and reconfigurable run-time environments where the inflexibility of TDM would be prohibitive. Advanced real-time scheduling theory is applied to the IEEE 802.5 token ring standard and dramatically enhances asynchronous class messages' responsiveness while still maintaining guaranteed service for the synchronous class. The result is a highly responsive real-time ring that can form the backbone of predictable, stable, and extendible real-time systems.     

Designing, formalizing, and evaluating a flexible architecture for integrated service delivery: combining event-driven and service-oriented architectures

An influx of service providers collaborate in networks to meet their clients?? demands. Integrated service delivery (ISD) is a way to let networked service providers offer services to their clients by bundling selected services offered by each provider so that clients do not have to deal with each single provider anymore. Designing such a network is a complicated endeavor as independent organizations need to collaborate and should understand how their activities are dependent on each other. Communication of events is necessary to deal with unpredictable and complex processes in such a network. In contrast with conventional event-driven architecture and service-oriented architecture (SOA) approaches, the hybrid model of event-driven interactions and SOA offers the required flexibility to realize ISD. This flexibility is realized by integrating not only services but also the processes of the different service providers to supply such services. A design science approach has been applied resulting in a detailed and formalized design of an event-driven service-oriented architecture (EDSOA). The EDSOA has been illustrated to show how ISD is realized with support of the architecture in a scenario concerning an application for a temporary residence permit by an immigrant. An evaluative workshop has been conducted which reflected that the following criteria are most important for successful organizational adoption of the EDSOA: expected usefulness, fit with organizational standards, use of trusted technology, and ease of maintenance.     

Time-constrained services: a framework for using real-time web services in industrial automation

The use of web services in industrial automation, e.g. in fully automated production processes like car manufacturing, promises simplified interaction among the manufacturing devices due to standardized protocols and increased flexibility with respect to process implementation and reengineering. Moreover, the adoption of web services as a seamless communication backbone within the overall industrial enterprise has additional benefits, such as simplified interaction with suppliers and customers (i.e. horizontal integration) and avoidance of a break in the communication paradigm within the enterprise (i.e. vertical integration). The Time-Constrained Services (TiCS) framework is a development and execution environment that empowers automation engineers to develop, deploy, publish, compose, and invoke time-constrained web services. TiCS consists of four functional layers—tool support layer, real-time infrastructural layer, real-time service layer, and hardware layer—which contain several components to meet the demands of a web service based automation infrastructure. This article gives an overview of the TiCS framework. More precisely, the general design considerations and an architectural blueprint of the TiCS framework are presented. Subsequently, selected key components of the TiCS framework are discussed in detail: the SOAP4PLC engine for equipping programmable logic controllers with a web service interface, the SOAP4IPC engine for processing web services in real-time on industrial PCs, the WS-TemporalPolicy language for describing time constraints, and the TiCS Modeler for composing time-constrained web services into a time-constrained BPEL4WS workflow.     

URL: A unified reinforcement learning approach for autonomic cloud management

Cloud computing is emerging as an increasingly important service-oriented computing paradigm. Management is a key to providing accurate service availability and performance data, as well as enabling real-time provisioning that automatically provides the capacity needed to meet service demands. In this paper, we present a unified reinforcement learning approach, namely URL, to automate the configuration processes of virtualized machines and appliances running in the virtual machines. The approach lends itself to the application of real-time autoconfiguration of clouds. It also makes it possible to adapt the VM resource budget and appliance parameter settings to the cloud dynamics and the changing workload to provide service quality assurance. In particular, the approach has the flexibility to make a good trade-off between system-wide utilization objectives and appliance-specific SLA optimization goals. Experimental results on Xen VMs with various workloads demonstrate the effectiveness of the approach. It can drive the system into an optimal or near-optimal configuration setting in a few trial-and-error iterations.     

Towards integration of service and network management in TINA

The Telecommunications Information Networking Architecture (TINA) defines a framework to support the rapid and flexible deployment and management of a wide range of multi-media, multi-party services in a multi-vendor telecommunications environment. The TINA approach applies opendistributed processing (ODP) and object-oriented design techniques to specify the control and management of the telecommunications services and infrastructure. Management in TINA is applied to the different components of the architecture, services and resources, and to thedistributed processingenvironment (DPE) that provides distribution transparencies and communication capabilities among TINA components. Management in TINA is based on TMN and extended with ODP concepts, as TINA is not concerned with just network management, but also systems management. TINA management architecture addresses aspects of distribution, interoperability, dynamic manager/managed roles, and integration with service control functions. TINA service management concerns different activities of the service life-cycle, from four main aspects: access session management, service session management, user session management and communication session management. The TINA network resource model supports requirements from both network management activities and service connectivity needs.     

A cost-efficient method for streaming stored content in a guaranteed QoS Internet

Quality-of-service techniques allow network providers to differentiate the services they offer to their customers. This differentiation makes it possible to consider charging new quality transport services based on network resource usage. In a content streaming framework, consumers pay for content and network access. Similarly, content providers pay to reserve transport service resources to deliver high-quality content. Therefore, content providers need new cost-efficient methods that optimize network resource reservations. Our paper proposes a new method that ensures data availability on the client side while optimizing network resource reservation when servers deliver stored content with semi-elastic unicast flows. The method uses network resource reservation to guarantee the delivery rate when stored data is below a minimum threshold in the client memory. When occupancy reaches a maximum threshold, the transmission changes to the classic best-effort service, which is not charged based on usage but at a flat rate. The proper design of these thresholds optimizes transmission cost. We validate our analytical method using the ns-2 simulator. We also present a new approach for improving this method when the best-effort delivery rate from the server to the client presents higher variability. Finally, we analyse the case of several homogeneous clients that simultaneously require resource reservation from the server. To avoid resource reservation rejection in the server, bandwidth must be suitably allocated among the clients. To evaluate this more complex case, we also perform some simulations and implement the associated prototype to validate the simulations. The qualitative simulation results reveal optimum working areas in which usage-cost reduction efficiency of the method is significant and extra signalling is minimum.     

Real-time service process admission control with schedule reorganization

This paper addresses the problem of resource reservation for applications using the real-time service-oriented architecture paradigm. Real-time services must be completed by their deadlines. They can be scheduled anywhere within an execution interval. Some services have a large execution interval which gives them more flexibility during admission control. However, the conventional approach for real-time process scheduling is to reserve a fixed schedule on the first come, first served basis and thus does not take advantage of this flexibility. In this paper, a reorganization algorithm is presented to relocate existing reservations in order to accommodate new requests that have less flexibility. For service process reservations, intermediate deadlines may also be adjusted to further increase the flexibility of service reservations. Simulation results show that reorganization can greatly enhance the acceptance ratio of real-time requests in most situations.     

Distributed advance reservation of real-time connections

The ability to reserve real-time connections in advance is essential in all distributed multiparty applications (i.e., applications involving multiple human beings) using a network that controls admissions to provide good quality of service. This paper discusses the requirements of the clients of an advance reservation service, and a distributed design for such a service. The design is described within the context of the Tenet Real-Time Protocol Suite 2, a suite being developed for multiparty communication, which will offer advance reservation capabilities to its clients, based on the principles and the mechanisms proposed in the paper. Simulation results providing useful data about the performance and some of the properties of these mechanisms are also presented. We conclude that the one described here is a viable approach to constructing an advance reservation service within the context of the Tenet Suites as well as that of other solutions to the multiparty real-time communication problem.     

SLA-based QoS pricing in DiffServ networks

The availability of high-speed transmission media and networking equipment in contemporary networks, as well as the evolution of quality-demanding applications has focused research interest on the provision of advanced qualitative services in addition to the traditional best-effort model of the Internet. A number of alternatives for service differentiation and QoS provisioning have been proposed and standardized, but in the case of backbone, transport networks the DiffServ architecture has prevailed, due to its scalability and deployment feasibility. The provisioning of services according to the DiffServ framework has in turn raised the requirements for interdependent, controlled resource allocation and service pricing, with particular needs for pricing mechanisms that preserve the potential and flexibility of DiffServ. At the same time, such mechanisms should reflect resource usage, allocate resources efficiently, reimburse costs or maximize service provision profits and lead customers to requesting services that will maximize their revenue. In this work, after reviewing related research, the principles that a pricing scheme for DiffServ-based services should follow are presented, stressing the differences form traditional Internet pricing. Based on these principles, an analytical approach to pricing a particular class of DiffServ-based services and a methodology for applying this approach in a real network are proposed and evaluated.     

A scalable framework for mobile real-time group communication services

A scalable framework for mobile real-time group communication services is developed in this paper. Examples for possible applications of this framework are mobile social networks, mobile conference calls, mobile instant messaging services, and mobile multi-player on-line games. A key requirement for enabling a real-time group communication service is the tight constraint imposed on the call delivery delay. Since establishing such communication service for a group of independent mobile users under a tight delay constraint is NP-hard, a two-tier architecture is proposed, that can meet the delay constraint imposed by the real-time service requirement for many independent mobile clients in a scalable manner. This goal is achieved by two dimensional partition of the space, first by organization and then geographically. Both the time and memory complexity associated with the location management of N mobile users are O(N) for the location management provided by the proposed framework, while a distributed scheme requires O(N²) for both time and memory complexity.     

Flexible and extensible load balancing

This paper presents the design philosophy and implementation of the BALANCE system. BALANCE is a flexible, network independent and computer architecture independent load balancing system which allows the building of reusable parallel and distributed applications. By implementing related services as bi generic servers with their connection endpoints registered in BALANCE, the clients can easily access the servers by server system calls. To demonstrate the flexibility of BALANCE, several widely different applications have been implemented and evaluated, including system servers, parallel and distributed applications and a scheduling testbed. The use of generic servers to improve system modularity and code reuse is also discussed. © 1997 John Wiley & Sons, Ltd.     

一种可选择最佳带宽的多路路由算法

实现服务质量保证,在多用户、多请求接入的网络中都是采取为相应请求预留资源的方式,而多请求预留资源使得网络局部出现资源"碎块".单路路由算法不能利用这些资源接入用户请求.为提高网络的资源利用率,采用多路路由方法,在单一通路不能满足连接请求要求时,寻找多条能联合满足要求的一组虚拟不相交并路,并预留资源共同满足用户的服务质量要求.为验证算法的有效性,在ns2模拟器上实现了所提出的算法,并与其他算法进行了性能比较.实验结果表明,提出的算法能很好地适应网络运行状况.在网络轻负载情况下,通信开销小.在网络重负载情况下,使用并行多路增加连接请求的接通率.将此算法应用于支持服务质量保证的多媒体数据网,能充分利用有限的网络资源,提高传输多媒体信息的能力.     

INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks

We present the design, implementation, and evaluation of INSIGNIA, an IP-based quality of service framework that supports adaptive services in mobile ad hoc networks. The framework is based on an in-band signaling and soft-state resource management approach that is well suited to supporting mobility and end-to-end quality of service in highly dynamic environments where the network topology, node connectivity, and end-to-end quality of service are time varying. Architecturally INSIGNIA is designed to support fast reservation, restoration, and end-to-end adaptation based on the inherent flexibility and robustness and scalability found in IP networks. We evaluate the framework, paying particular attention to the performance of the in-band signaling system, which helps counter time-varying network dynamics in support of the delivery of adaptive services. Our results show the benefit of our framework under diverse mobility, traffic, and channel conditions.     

Enhancing VoIP service for ubiquitous communication in a campus WLAN with partial coverage

The IEEE 802.11 WLAN technology has become the de facto standard for wireless Internet access. The spotty coverage of WLAN access points, however, confines the applicability of many real-time services such as VoIP within the boundary of the WLAN service area. In this paper, we investigate the problem of enhancing VoIP service for ubiquitous communication in a WLAN with spotty service area. We consider a university campus that has an established infrastructure for supporting SIP-based VoIP service through either wired or wireless data networks. The campus WLAN service does not have 100% full coverage, and hence users cannot make untethered VoIP calls anywhere on campus. The goal of this paper is to overcome the limitations of such “dead spots” for motivating the use of campus IP telephony service. To proceed, we start with two approaches called one-hop extension and dual-mode communication. The first approach uses multi-hop relay to extend the WLAN coverage, while the second approach leverages the availability of dual-mode handsets for ubiquitous voice communication. We implement the two approaches, and evaluate their performance in the campus testbed environment. We find that while the two approaches can effectively allow voice communication in WLAN dead spots, they have one common problem as the potential lack of support for voice call continuity that can cause degradation of the speech quality to an active call. We adopt a cross-layer solution based on signal processing algorithms to address the problem, thus achieving seamless voice call continuity while enabling ubiquitous voice communication on campus. Testbed evaluation shows promising results for future research along the proposed direction.     

基于5G切片和优先级的流量隔离性能研究

随着基于3GPP标准的关键任务(MC)移动宽带技术的部署,可为公共保护和救灾提供宽带通信能力。常见方法是在公共移动网络上提供MC服务和商业流量（CO）,并使用优先级机制来保护拥塞情况下的MC连接。然而,这种方法在特定单元中的MC流量激增前,商业流量不受保护,因为所有资源都将被分配来服务于这种流量。在此背景下,提出了一种稳定性较好的多路MC和具有拥塞保护的商业服务的解决方案,该解决方案是基于5G网络切片特性。本文主要描述了在结合优先级的基础上如何在5G无线电接入网(RAN)中参数化不同的切片以及支持无线电资源分配的底层无线电资源管理(RRM)功能的操作从而为每种类型的服务建立无线电负载保证。通过MATLAB仿真结果表明与仅依赖于优先级化机制的解决方案相比,本次采用的切片配置方法在流量隔离方面得到了改进,为不同类型的服务提供了可靠保障。     

一种基于Active Replication的TCP连接容错技术

本文提出一种基于Active Replication的TCP连接容错技术（ARTCP）,采用两层的Cluster结构,并通过前端的分发器和聚合网关机维持多个同步的TCP连接副本,达到了相互容错的效果。测试结果表明,该技术不仅保证网络服务连接级的高可用性,而且具有恢复时间短、开销小的优势。     

Dynamic rerouting of guaranteed Quality-of-Service connections

To support the widespread demands for integrated services various solutions have been proposed to provide guaranteed Quality-of-Service (QoS) services in packetswitched networks. These solutions usually require fixed route selection and resource reservation on a per connection basis. The routing and reservation decisions, combined with load fluctuations, introduce the problems of network unavailability and loss of network management flexibility. We believe that these problems can be alleviated by transparently rerouting connections to properly balance the network load. In this paper, we present a solution that supportstransparent route modification ofguaranteed QoS connections during the life time of the connections. As the emphasis of this work is to support transparency we must ensure that during and after the rerouting, the QoS guarantees made to the client are preserved, and the interface instances at both the sender and receiver are unaltered. Our solution includes the mechanisms that support the transparent rerouting of connections, and a routing algorithm that is based on the traffic characteristics, the delay, and the jitter requirements of a connection. This routing algorithm can also use various administrative constraints and facilitate the reuse of resources currently reserved by the connection. To optimize the solution, additional mechanisms have been introduced to reduce the time needed to reroute a connection and to support rerouting of segments of a connection. The solution has been implemented in the context of the Tenet scheme and route changes can be observed and controlled by using the Simple Network Management Protocol (SNMPv 1). Simulation experiments and some initial measurements of the implementation demonstrate that such a scheme is useful, practical, and can be achieved with load overhead.