Qos-aware Middleware for Mobile Multimedia Communications

Next generation wireless communications system will be required to support the seamless delivery of voice, video and data with high quality. Delivering hard Quality of Service (QOS) assurances in the wireless domain is complex due to large-scale mobility requirements, limited radio resources and fluctuating network conditions. To address this challenge we are developing mobiware, a QOS-aware middleware platform that contains the complexity of supporting multimedia applications operating over wireless and mobile networks. Mobiware is a highly programmable software platform based on the latest distributed systems technology (viz. CORBA and Java). It is designed to operate between the application and radio-link layers of next generation wireless and mobile systems. Mobiware provides value-added QOS support by allowing mobile multimedia applications to operate transparently during handoff and periods of persistent QOS fluctuation.     

The design and implementation of a Jini/Java-based A/V stream control and management

Distributed multimedia applications make diverse demands on communication services and quality of service. These requirements must be met end-to-end in an efficient and integrated manner through the enabling middleware of end systems and communication networks. The middleware should allow an adaptive quality of service (QoS) to be specified and supported; it should also provide application programming interfaces with integrated group communication support that simplify the programming task of multimedia applications. This paper focuses on the latter aspect and presents a distributed solution known as Stream Manager. Stream Manager allows heterogeneous media devices to be connected by the same session initiation procedures of Stream Manager. Through an underlying network connection management service, it allows a new group stream to be supported in addition to the OMGs unicast streams and point-to-multipoint multicast streams. The basic operations of Stream Manager and its application interfaces will be described, and the design and implementation of a prototype in Jini/Java will be presented. The performance of the prototype was measured experimentally in terms of throughput, delay, and latencies of joining and leaving a stream. We then compared its performance with that of streams handled by using Java RMI, Java sockets, and CORBA A/V stream. The performance of our system was found to be superior to that of Java RMI and comparable to that of Java socket but slightly inferior to that of CORBA A/V stream due to the higher intrinsic Java processing overhead.     

支持ATM传输协议的CORBA设计和实现

研究第二代实时CORBA使其适应于性能敏感的实时分布应用系统的集成开发是面向对象分布软件技术的一个研究热点，该文介绍了作者设计和实现的一个集成了ATM传输协议的CORBA－QTAO。文中介绍了支持ATM传输协议和多协议连接的ORB结构以及GIOP在ATM上的映射ATMIOP和GIOP的扩充协议QGIOP的设计和实现，也简要介绍了支持ATM的高级通信环境EACE的设计和实现。     

Causal delivery of messages with real-time data in unreliable networks

Causal order states that for any process the order in which it is delivered messages cannot violate the happened-before relation of the corresponding sendings. Such a communication abstraction has been defined for reliable distributed systems in which data of application messages have unlimited time validity. In this paper we extend the notion of causal order to cope with unreliable communication networks in which messages have real-time delivery constraints. In particular, we assume that messages have a limited time validity, , after which their data can no longer be used by the application, and that some of them can be lost by the communication network. This new abstraction, called -causal order, requires to deliver as many messages as possible within their validity time in such a way that these deliveries respect causal order. Two efficient implementations are proposed in the case of one-to-one and broadcast communication. Examples of distributed multimedia real-time applications, in which scheduling messages deliveries respecting -causal order is a crucial point for the quality of the service, are given.     

一个实时CORBA的动态调度服务模型

在实时CORBA中引入调度服务简化了实时应用的开发,但目前实时CORBA1．0所定义的调度服务使用固定优先级调度策略只能适合于一个封闭的CORBA应用系统．本文针对这一局限性,提出了一个基于客户调度器和服务调度器相协作的动态调度服务模型对其进行扩展,使得调度服务可以适用于一个更为开放的实时CORBA系统．     

电子图书馆多媒体信息传输服务质量管理的研究

该文在浏览器/服务器环境下建立了一个数字化图书馆多媒体数据流同步传输的管理方案。定义了多媒体对象、任务、同步化传输约束条件以及相应的QOS评价指标,基于上述方案及评价指标,给出了数字化图书馆多媒体流同步传输的控制算法以及相应的实验结果。     

QoS Management Through Adaptive Reservations

Reservation based (RB) scheduling is a class of scheduling algorithms that is well-suited for a large class of soft real-time applications. They are based on a bandwidth abstraction, meaning that a task is given the illusion of executing on a dedicated slower processor. In this context, a crucial design issue is deciding the bandwidth that each task should receive. The point we advocate is that, in presence of large fluctuations on the computation requirements of the tasks, it can be a beneficial choice to dynamically adapt the bandwidth based on QoS measurements and on the subsequent application of feedback control (adaptive reservations).In this paper, we present two novel contributions to this research area. First, we propose three new control algorithms inspired to the ideas of stochastic control. Second, we present a flexible and modular software architecture for adaptive reservations. An important feature of this architecture is that it is realised by means of a minimally invasive set of modifications to the Linux kernel.This work has been partially supported by the European OCERA IST-2001-35102 and RECSYS IST-2001-32515 projects.Luca Abeni is a Ph.D. in Computer Engineering at the Scuola Superiore SantAnna of Pisa (Italy). He graduated in Computer Engineering at the University of Pisa in 1998, and received a Ph.D. in Computer Engineering at the Scuola SuperioreS. Anna of Pisa in 2002. During 2000 he was a visiting student at the Carnegie Mellon University (Pittsburgh, PA), working with Prof. Ragunathan Rajkumar on resource reservation algorithms for real-time kernels. During 2001 he was a visiting student a Oregon Graduate Institute (Portland, OR) working with Prof. Jonathan Walpole on the support for time-sensitive applications in the Linux kernel. He has been working in Broadsat S.R.L. since 2003, developing audio/video streaming solutions and IPTV applications.Tommaso Cucinotta got the degree in Computer Engineering at the University of Pisa (Italy) in 2000. He got the Ph.D. inComputer Engineering at the Scuola Superiore SantAnna(SSSA) of Pisa in 2004 with a thesis titled Issues in authentication by means of smart-card devices. He held a course on cryptography in the International Master on Software Engineering organized at SSSA in 2002 and 2004. At the moment, he cooperates in research activities at the Scuola Superiore S. Anna in the areas of computer security and Quality of Service control for soft real-time systems.Giuseppe Lipari graduated in Computer Engineering at the University of Pisa in 1996, and received the Ph.D. degree in Computer Engineering from Scuola Superiore SantAnna in 2000. During 1999, he was avisiting student at University of North Carolina at Chapel Hill, collaborating with professor S.K. Baruah and professor K. Jeffay on real-time scheduling. Currently, he is assistant professor of Operating Systems with Scuola Superiore SantAnna. His main research activities are in real-time scheduling theory and its application to real-time operating systems, soft real-time systems for multimedia applications and component-based real-time systems.Luca Marzario is a Ph.D. student in Computer Engineering at the Scuola Superiore S. Anna of Pisa, Italy. In 2002, he graduated in Computer Engineering at University of Pisa. His main research interest include real-time systems scheduling, aperiodic service mechanism, feedback-scheduling, QoS in multimedia systems, Linux kernel and Real Time Linux executives (RTAI, RTLinux).Luigi Palopoli graduated in Control Engineering at the University of Pisa in 1998 and received his Ph.D. degree in Computer Engineering in 2002 from the Scuola Superiore S. Anna, Pisa. During 2001 he was a visiting scholar at the Department of EECS, University of California at Berkeley, where he worked on design techniques for real-time controllers under the supervision of Professor Alberto Sangiovanni-Vincentelli. He is currently Assistant Professor at the Scuola Superiore S. Anna (Pisa). His main research activities include Quality of Service control, control of systems under communication and computation constraints and design of embedded systems.     

Scheduling and Transport for File Transfers on High-Speed Optical Circuits

Scheduling resources on Grids is a well-known problem. The extension of Grids to LambdaGrids requires the scheduling of lambdas, i.e., end-to-end high-speed circuits. In this paper, we propose a scheduling heuristic for such lambdas in support of large-scale scientific applications that require high-throughput transfers of large files. We refer to this heuristic as Varying-Bandwidth List Scheduling (VBLS) because the scheduler returns a Time-Range-Capacity (TRC) allocation vector with varying bandwidth levels assigned for different time ranges within the duration of a transfer. The advantage of VBLS over a fixed-bandwidth allocation scheme is that it allows the scheduler to backfill any holes left in resource allocations. Enabling VBLS requires end host applications to specify the file size in their transfer requests. To characterize VBLS, we ran simulation experiments that show that VBLS performance approaches packet-switching performance. This result means that file transfers can take advantage of bandwidth that becomes available subsequent to the start of transfers, a current and critical drawback of typical fixed-bandwidth allocation schemes in circuit-switched networks. Next, we identify the key features needed in a transport protocol that works in conjunction with VBLS and develop the Varying Bandwidth Transport Protocol (VBTP). VBTP is a rate based flow control scheme that is coupled with Selective-ARQ based error control. Finally, the paper concludes with a discussion on the impact of transport problems on VBLS scheduling.     

Scheduling multiple task graphs with end-to-end deadlines in distributed real-time systems utilizing imprecise computations

In order to meet the inherent need of real-time applications for high quality results within strict timing constraints, the employment of effective scheduling techniques is crucial in distributed real-time systems. In this paper, we evaluate by simulation the performance of strategies for the dynamic scheduling of composite jobs in a homogeneous distributed real-time system. Each job that arrives in the system is a directed acyclic graph of component tasks and has an end-to-end deadline. For each scheduling policy, we provide an alternative version which allows imprecise computations, taking into account the effects of input error on the processing time of the component tasks of a job. The simulation results show that the alternative versions of the algorithms outperform their respective counterparts. To our knowledge, an imprecise computations approach for the dynamic scheduling of multiple task graphs with end-to-end deadlines and input error has never been discussed in the literature before.     

CAMPS: a constraint-based architecturefor multiagent planning and scheduling

A new integrated architecture for distributed planning and scheduling is proposed that exploits constraints for problem decomposition and coordination. The goal is to develop an efficient method to solve densely constrained planning/scheduling problems in a distributed manner without sacrificing solution quality. A prototype system (CAMPS) was implemented, in which a set of intelligent agents try to coordinate their actions for satisfying planning/scheduling results by handling several intra- and inter-agent constraints. The repair-based methodology for distributed planning/scheduling is described, together with the constraint-based mechanism of dynamic coalition formation among agents.     

ARMIDA TM: Multimedia Applications across ATM-Based Networks Accessed via Internet Navigation

ARMIDA TM (Applications Retrieving Multimedia Information Distributed over ATM) is a prototypical system for experimental applications based on the interactive retrieval of multimedia information from remote data bases over ATM networks. ARMIDA TM aims at being compliant with the specifications issued by the Digital Audio Visual Council (DAVIC) for interactive multimedia services and applications, as well as at representing a sample implementation of the system specified in DAVIC 1.0. The present paper illustrates the way ARMIDA TM works to provide these applications, by describing the system hardware and software architecture and its main components, with a particular concern towards the way they interact to implement the required functionality.     

A new QoS-aware TDMA/FDD MAC protocol with multi-beam directional antennas

With the ever-increasing demand for wireless real-time services and continuing emergence of new multimedia applications especially for mobile users, it is necessary for the network to support various levels of quality of service (QoS) while maximizing the utilization of scarce and expensive wireless channel resources. Considering this fact, a new TDMA/FDD MAC protocol integrating a novel QoS management algorithm and multi-beam Directional Antennas (DAs) to efficiently exploit wireless resources has been developed and presented in this paper. It supports all ATM CBR, VBR, ABR and UBR service classes by adopting a well-managed dynamic guarantee-based QoS scheduling algorithm. The work mainly aims at increasing the wireless system throughput as well as improving the call-blocking ratios and end-to-end delays for real-time applications. This seamless communication enables both handling real-time multimedia traffics in a fair manner and granting call requests on the basis of the connection types. The system has been developed, modeled and simulated using OPNET Modeler. The simulation results show that the QoS-aware TDMA/FDD MAC with multi-beam DAs has substantially increased the system throughput and that the call-blocking ratio has been reduced from 86% to 18%, when the proposed MAC with 8-Beam antennas is employed instead of the regular MAC.     

Feasibility Analysis of Real-Time Periodic Tasks with Offsets

The problem of feasibility analysis of asynchronous periodic task sets, where tasks can have an initial offset, is known to be co-NP-complete in the strong sense. A sufficient pseudo-polynomial test has been proposed by Baruah, Howell and Rosier, which consists in analyzing the feasibility of the corresponding synchronous task set (i.e. all offsets are set equal to 0). If the test gives a positive result, then the original asynchronous task set is feasible; else, no definitive answer can be given. In many cases, this sufficient test is too pessimistic, i.e. it gives no response for many feasible task sets.In this paper, we present a new sufficient pseudo-polynomial test for asynchronous periodic task sets. Our test reduces the pessimism by explicitely considering the offsets in deriving a small set of critical arrival patterns. We show, trough a set of extensive simulations, that our test outperforms the previous sufficient test.Rodolfo Pellizzoni received the Laurea degree in Computer Engineering from the Università di Pisa and the Diploma degree from the Scuola Superiore SantAnna, in 2004. He is presently a Ph.D. student in the Department of Computer Science at the University of Illinois at Urbana-Champaign. His main research interests are in real-time operating systems, scheduling theory and resource-allocation in distributed and multiprocessor systems.Giuseppe Lipari graduated in Computer Engineering at the University of Pisa in 1996, and received the Ph.D. degree in Computer Engineering from Scuola Superiore SantAnna in 2000. During 1999, he was a visiting student at University of North Carolina at Chapel Hill, collaborating with professor S.K. Baruah and professor K. Jeffay on real-time scheduling. Currently, he is assistant professor of Operating Systems with Scuola Superiore SantAnna. His main research activities are in real-time scheduling theory and its application to real-time operating systems, soft real-time systems for multimedia applications and component-based real-time systems.     

A flexible time-triggered service for real-time CORBA

This paper presents a new service for CORBA applications that orchestrates the timely execution of the tasks of a distributed real-time system in a flexible way. It follows the CORBA philosophy of complementing the CORBA standard with additional services that solve specific problems and facilitate using CORBA in complex applications. The service has been designed for highly coupled applications that execute over LANs. It provides a synchronous framework to synchronize distributed applications that is open to accepting and removing components on-line, with reduced impact on the application timing. It also provides the flexibility to use different distributed scheduling policies that can override the local operating systems schedulers. This paper describes the service architecture and implementation as well as its best-case performance on low computing power hardware with the QNX OS and connected to a switched Ethernet network. Finally the usage and of the service is illustrated with one case study: the synchronization of several robots in a welding process.     

A new MAC protocol design based on TDMA/FDD for QoS support in WATM networks

Several wireless networking solutions have been developed to provide different types of services for various end user applications. Currently, wireless networking infrastructures are not suitable for multimedia applications each requiring a different QoS support with various traffic parameters. Due to the success of ATM technology in the wired network, WATM concept and related researches are of importance in the information technology area. Main objective of WATM, which promises seamless transmission of different traffics such as voice, data and video over wireless medium, is to implement high bit rate and QoS guaranteed data transfer, already well achieved by ATM technology over wired medium. To support QoS guaranteed data transfer over error-prone and low bandwidth wireless medium, an effective MAC protocol must be designed and utilized. In this paper, a new TDMA/FDD based MAC protocol, maintaining QoS requirements of real-time wireless multimedia applications, is proposed. The main contribution of this study is the new guarantee-based scheduling algorithm used in the proposed MAC to support required level of QoS guarantee for all multimedia traffic types in wireless medium. Computer modeling and simulation of the new approach providing CBR, VBR, ABR and UBR ATM services are realized using OPNET Modeler. Simulation results are also presented together with comparisons those of a WATM counterpart which uses PRMA/DA MAC protocol.     

基于IMS的E2E QOS控制机制

3GPP提出的IMS用于提供各种实时多媒体业务,未来的实时多媒体服务将以视频、音频以及视频、音频的混合为主,对于实时性和延迟的要求很高,需要E2E的QOS的支持。文章分析了现有的IMS的QOS机制的实现以及存在的不足,提出了一种新的基于策略的E2EQOS机制。新的机制主要实现了IMS中的各个层次间的相互协作、SIP协议的扩展和PDF功能的改进,实现了对多媒体业务实时性的提高并且缩短了延迟。     

基于实时Java的实时CORBA研究

由于C 的复杂性,越来越多的分布式实时应用开始采用Java语言.该文从实时ORB核心POA、实时线程池、CORBA优先级到RTSJ优先级的映射、实时GIOP这4个方面对实时CORBA在实时Java上的实现进行了基本分析.     

An overview of the Real-Time CORBA specification

A growing class of real-time systems require end-to-end support for various quality-of-service (QoS) aspects, including bandwidth, latency, jitter and dependability. Applications include command and control, manufacturing process control, videoconferencing, large-scale distributed interactive simulation, and testbeam data acquisition. These systems require support for stringent QoS requirements. To meet this challenge, developers are turning to distributed object computing middleware, such as the Common Object Request Broker Architecture, an Object Management Group (OMG) industry standard. In complex real-time systems, DOC middleware resides between applications and the underlying operating systems, protocol stacks and hardware. CORBA helps decrease the cycle time and effort required to develop high-quality systems by composing applications using reusable software component services rather than building them entirely from scratch. The Real-Time CORBA specification includes features to manage CPU, network and memory resources. The authors describe the key Real-Time CORBA features that they feel are the most relevant to researchers and developers of distributed real-time and embedded systems     

Design and simulation of an efficient real-time traffic schedulerwith jitter and delay guarantees

In this paper, we propose a framework for real-time multimedia transmission in asynchronous transfer mode (ATM) networks using an efficient traffic scheduling scheme called multilayer gated frame queueing (MGFQ). MGFQ employs only one set of FIFO queues to provide a wide range of QoS for real-time applications. We also propose special cell formats for real-time multimedia transport and a hybrid design to allow MGFQ to combine its scheduling scheme with Age Priority Packet Discarding scheme. For this hybrid design, the cell level performance as well as the packet level QoS can be improved at the same time, Simulation results show that this hybrid design will be useful for packetized voice and progressive layer-compressed video transmission across the backbone networks. With the presented framework and the MGFQ algorithm, real-time multimedia traffic streams can be much better supported in terms of cell/packet delay and jitter