Transmission Server Research Articles

Design of reliable video image transmission system for underwater vehicle

In order to improve the transmission performance of underwater vehicle motion video image, a reliable transmission system of underwater vehicle motion video image is designed. The hardware part of the system includes the design of the transmission server and the design of the transmission client; the software part of the system mainly includes two parts: compression processing and lossless transmission of the motion video image of the underwater vehicle, which completes the software design of the system and realises the design of the whole system. The test results show that the proposed transmission system has good transmission performance for the motion video image of the vehicle in shallow water.

QoS-Aware Task Scheduling in Cloud-Edge Environment

Since the limitations of the user equipment, they do not have enough computing power to process large amounts of data. At the same time, it’s unbearable for users to spend a long time uploading data to the remote cloud center. In order to solve these problems above, the concept of mobile edge computing(MEC) is proposed. The computing and storage resources are placed close to the end equipment, reducing the transmission delay. MEC can meet the high real-time requirements of the user equipment. In the real-time face recognition application scenario, a three-layer hierarchy MS-CE is proposed for the shortcoming of the traditional centralized cloud center. And the distributed MEC servers are utilized at the MEC layer to provide parallel computing capabilities. Aiming at the problem of how to perform task scheduling in a geographically distributed MEC server, we propose a task scheduling based queue algorithm(TSBQ), which considers the data transmission delay and server load, and carries out a reasonable task allocation policy. We evaluate the MS-CE and TSBQ through simulation experiments. We can find the MS-CE architecture are better than others and TSBQ is more effective than Corral and Greedy.

TB/GI/1 queues with arrival traffic envelopes

Consider a queueing system where the job service times are not known upon arrival; e.g., a transmission server of a wireless channel where packet transmission times are random, or a virtual machine handling a stream of tasks whose execution times are not perfectly predictable. We give bounds on the tail of the workload distribution of a partially regulated, single-server queue whose arrival processes are arbitrarily distributed stationary random point processes on the integers that satisfy token-bucket constraints expressed via an arbitrary concave function f, and whose job service times are independent with a common distribution.

Design and Application of Cloud Monitoring Network Dispatching Command System

Based on cloud service technology, this paper designs an embedded networking dedicated server and a networked dispatching command system. The server overcomes the shortcomings of the traditional data transmission server: complicated installation and maintenance, poor long-term work stability, lack of wireless backup routes, etc., and realizes reliable collection, compression, storage and uploading of basic data of various monitoring systems of the mine. At the same time, according to the mine management needs, the system extracts various safety and production data and performs unified processing to realize multilevel dispatching, monitoring, supervision and display.

Simulation Study for the Performance Impacts of Video Multicast Caused by In-Cast in Cloud Computing Environment

Cloud computing is becoming one of the most convenient ways for information services through network accesses. In this paper, we describe the architecture of cloud computing and discuss the issue of in-cast, which may downgrade the transmission performance when the number of simultaneous transmission servers is getting larger. The in-cast transmission may introduce the out of sequence of packet delivery and may reduce the system throughput. This paper constructs the software environment to simulate the performance of video streaming services delivered by the servers in cloud. We first examine the performance of the out of sequence issue of packet transmission when the Hashed Credit Fair (HCF) algorithm was applied and investigate the multicast performance of video streaming service with respect to the numbers of servers. With the increasing of the number of servers, we note that transmission performance is not improved, on the contrary, the system throughput downgrades sharply. We believe the simulation results of this paper will be helpful for the design of cloud video multicast services.

단일서버 기반의 통합 방송콘텐츠 송출시스템 개발

Abstract In this paper, we design and implementation of effective integrated broadcast contents transmission System based on single server system. Because of previous broadcast contents transmission system is consist of various individual functional equipment. And it is not easy to use and not effective to manage for broadcast contents transmission. In this paper, we evaluated and analysed of developed system in the test environment. As a result of performance test, It showed that it was well performed without any data error in the performance test, and It showed that it was well managed, controled, scheduled, processed of the integrated broadcast contents transmission environment. Key Words : Digital Broadcast, Broadcast Transmission Server, Integrated Broadcast System. * 정회원, 서일대학교 정보통신학과 교수 ** 정회원, (주)아이티하모니 연구소장 접수일자 : 2012년 11월 23일, 수정완료 : 2012년 12월 13일게재확정일자 : 2012년 12월 14일Received: 23 Nomember 2012 / Revised: 13 December 2012 /Accepted: 14 December 2012 ** Corresponding Author: sanho@seoil.ac.krDept. of Information and communication Engineering, Seoil University, Korea

Quantization parameter control and fast code modification for fast stream joiner

Multi-vision systems and panoramic video systems are expected to produce a new multimedia paradigm. However, their increased processing load on transmission servers handling large amounts of video and high-definition video must be considered. Our previously presented multi-vision system enables many users to view multiple videos by virtue of fast stream joining algorithms. The system joins (combines) much video stream on a transmission server into a single video stream. Then it transmits the joined single video stream to various client devices including mobile terminals. Because of its single-stream transmission, the client device enables decoding of the received video stream without special mechanisms. Especially, to join multiple video streams with high performance and without prediction inconsistency, the encoder fixes the number of a non-zero quantized coefficient (called TotalCoeff) to a certain in earlier work. Because this scheme of the fixing TotalCoeff in the encoder phase obviates the decoding process of each stream and modification of the prediction relation in the joining phase, it is possible to implement a stream joiner with a lightweight process. However, image degradation occurs because this scheme adds and drops the quantized coefficient. We emphasize that the amount of image degradation (called TotalCoeff fixing error or simply error) is dependent on the original TotalCoeff before fixing TotalCoeff and the Quantization Parameter (QP) because the quantization process has zero-rounding capability. Then we consider, using QP, the TotalCoeff estimation model and the error estimation model created by adding and deleting the coefficient. Under these models, we propose a QP control scheme to decrease this degradation without sacrificing high speed in the joiner.

Automatic Music Synchronization Using Partial Score Representation Based on IEEE 1599

In this paper, a novel multimedia transmission server is designed using rule based expert system technology. It is superior on current media transmission servers because it is more powerful on streaming, flexible on control, and reliable on maintenance. In the proposed expert server, working parameters and management methods are separated from the decision-making procedure and stored in an xml database called knowledge base. The server fires different transmission strategies inside the knowledge base by runtime inference. Thus it can easily adjust transmission parameters under various environments and adopt new developed methods without significantly changing the main body of server codes. In this paper, we not only analyzed the time complexity of inference procedure and the real time characteristics of the server, but also tested the server performance on local area networks. Results showed that the expert system can deliver smooth streams with around 50% deduced throughput oscillations when compared with a single rate control method. The saved 50% bandwidth could be used for supporting more users. When congestion happened, the expert system reacts intelligently and conducts cooperative steps to relocate its resources. At the same time, the congestion related information is recorded and referred for future congestion avoidance. Attractively, these enhanced performances are achieved by taking less than 10% of the CPU time for the execution of the expert server control program.

Reliability analysis of a data transmission model for multicast

As computer systems have been widely used, Internet, which is a network-of-network, has been greatly developed and rapidly spread all over the world. In addition to unicast transmissions of point-to-point, multicast transmissions of one-to-many and many-to-many have been recently used. This paper considers a stochastic model where data are transmitted through multicast. The data are divided into n packets at a transmission server, and their packets are transmitted successively to each receiver of multicast group. Positive (ACK) or negative (NAK) acknowledgements are returned from each receiver, by depending on whether he or she has received all packets, correctly or not. When the server has received NAK, retransmissions only for receivers with NAK are made. The mean time until the data transmission succeeds is analytically derived and an optimal policy which maximizes the throughput is discussed. Finally, numerical examples are given under suitable conditions.

A packet-size aware adaptive routing algorithm for parallel transmission server systems

This paper describes a routing algorithm that assigns each arriving packet to one of several homogeneous parallel servers. The algorithm differs from existing routing policies in that it considers the impact of each arriving packet's size on the average packet delay. It is derived from mimic optimal routing, which mimics the behavior of numerical solutions to a packet assignment problem. It works under the condition that inter-arrival-time and packet-size distributions are unknown, but some possible candidates are known in advance. The algorithm calculates statistics, such as means of these distributions, from input traffic, so it provides not only good performance under stationary input traffic but also adaptive behavior under dynamic input traffic, where the distributions change with time.

Deterministic CORBA ORB (DORB) for Distributed Real-Time Applications

In this paper we propose an alternative approach for dealing with distributed real-time applications in CORBA environments. Our approach, called deterministic CORBA ORB (DORB), provides the basis for implementing distributed real-time applications on LANs (Local Area Networks) and the Internet. DORB uses a deterministic mechanism for the refreshment of client stubs. It is especially adapted for handling periodic tasks. DORB is based on a time-bounded atomic multicast protocol and a statistical observer component for making estimations on the transmission delays of the network. Its most important feature is to guarantee the determinism, in a bounded-time, of the entire end-to-end path of a real-time client-server interaction (transmission delays and server processing time).