IPv6 mobility support for real-time multimedia communications: A survey

Mobile Internet protocol version 6(MIPv6) route optimization improves triangular routing problem that exists in MIPv4 environment.Route optimization of Session Initiation Protocol (SIP) over MIPv6 provides ef�cient real-time multimedia applications to users. This article provides a survey of SIP over MIPv6. We review the processes involved during the setting up of a SIP call and during mid-call SIP mobility. When SIP transmits real-time multimedia applications in a wireless environment, the mobile node (MN) may move from one access router (AR) to another AR, handing over control from one AR to the other. High handover latency degrades the quality of real-time multimedia applications due to the fact that real-time multimedia applications are delay-sensitive.Handover latency is an important issue to discuss.Reduction of handover latency can be made possible with the use of SIP's hierarchical registration. On the other hand, hybrid hierarchical and fast handover SIP's registration performs better compared to hierarchical registration. Finally, we present the directions for future research

A Switch Architecture for Real-Time Multimedia Communications

In this paper we present a switch that can be used to transfer multimedia type of trafJic. The switch provides a guaranteed throughput and a bounded latency. We focus on the design of a prototype Switching Element using the new technology opportunities being offered today. The architecture meets the multimedia requirements but still has a low complexity and needs a minimum amount of hardware. A main item of this paper will be the background of the architectural design decisions made. These include the interconnection topology, buffer organization, routing and scheduling. The implementation of the switching fabric with FPGAs, allows us to experiment with switching mode, routing strategy and scheduling policy in a multimedia environment. The witching elements are interconnected in a Kautz topology. Kautz graphs have interesting properties such as: a small diametec the degree is independent of the network size, the network is fault-tolerant and has a simple routing algorithm

Sensing and mapping for interactive performance

This paper describes a trans-domain mapping (TDM) framework for translating meaningful activities from one creative domain onto another. The multi-disciplinary framework is designed to facilitate an intuitive and non-intrusive interactive multimedia performance interface that offers the users or performers real-time control of multimedia events using their physical movements. It is intended to be a highly dynamic real-time performance tool, sensing and tracking activities and changes, in order to provide interactive multimedia performances. From a straightforward definition of the TDM framework, this paper reports several implementations and multi-disciplinary collaborative projects using the proposed framework, including a motion and colour-sensitive system, a sensor-based system for triggering musical events, and a distributed multimedia server for audio mapping of a real-time face tracker, and discusses different aspects of mapping strategies in their context. Plausible future directions, developments and exploration with the proposed framework, including stage augmenta tion, virtual and augmented reality, which involve sensing and mapping of physical and non-physical changes onto multimedia control events, are discussed

Flexible Scheduling in Multimedia Kernels: an Overview

Current Hard Real-Time (HRT) kernels have their timely behaviour guaranteed on the cost of a rather restrictive use of the available resources. This makes current HRT scheduling techniques inadequate for use in a multimedia environment where we can make a considerable profit by a better and more flexible use of the resources. We will show that we can improve the flexibility and efficiency of multimedia kernels. Therefore we introduce Real Time Transactions (RTT) with Deadline Inheritance policies for a small class of scheduling algorithms and we will evaluate these algorithms for use in a multimedia environmen

Routing in Wireless Multimedia Home Networks

This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless real-time home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time behaviour to support multimedia streams. The multimedia network protocol works for both single-hop and multi-hop networks, however in the latter case special measures have to be taken to forward streams from node to node and to find routes. Existing routing protocols exhibit non-deterministic behaviour which may interfere with the correct streaming of multimedia. The proposed routing protocol does not rely on flooding, instead it piggy-backs the real-time token and behaves in a predictable manner. Simulation of the routing protocol shows that routes in the network are found in finite time

A real-time multimedia streaming protocol for wireless networks

This paper describes a new token-based medium access protocol for real-time networks and its implementation on a wireless network. Originally, the protocol is developed for use in low cost domestic or home networks that are based on Ethernet hardware. In contrast to existing protocols the token is assigned to network nodes on basis of a pre-emptive earliest deadline first (PEDF) schedule of the multimedia streams. The scheduler is distributed over all active nodes in the network. Although other schedulers could be used, PEDF is chosen because it has a theoretical bandwidth utilization of one hundred percent and feasibility analysis is very simple, so even simple devices can participate in such a network. This is confirmed by simulation experiments and a prototype based on Ethernet hardware. The protocol is successfully adapted to and implemented on an IEEE 802.11b wireless LAN, even though this type of network has some unpredictable properties, such as bandwidth switching

The stack resource protocol based on real time transactions

Current hard real time (HRT) kernels have their timely behaviour guaranteed at the cost of a rather restrictive use of the available resources. This makes current HRT scheduling techniques inadequate for use in a multimedia environment where one can profit by a better and more flexible use of the resources. It is shown that one can improve the flexibility and efficiency of real time kernels and a method is proposed for precise quality of service schedulability analysis of the stack resource protocol. This protocol is generalised by introducing real time transactions, which makes its use straightforward and efficient. Transactions can be refined to nested critical sections if the smallest estimation of blocking is desired. The method can be used for hard real time systems in general and for multimedia systems in particular

Multimedia big data computing for in-depth event analysis

While the most part of ”big data” systems target text-based analytics, multimedia data, which makes up about 2/3 of internet traffic, provide unprecedented opportunities for understanding and responding to real world situations and challenges. Multimedia Big Data Computing is the new topic that focus on all aspects of distributed computing systems that enable massive scale image and video analytics. During the course of this paper we describe BPEM (Big Picture Event Monitor), a Multimedia Big Data Computing framework that operates over streams of digital photos generated by online communities, and enables monitoring the relationship between real world events and social media user reaction in real-time. As a case example, the paper examines publicly available social media data that relate to the Mobile World Congress 2014 that has been harvested and analyzed using the described system.Peer ReviewedPostprint (author's final draft