Wireless resource management mechanism with green communication for multimedia streaming

In the face of massive parallel multimedia streaming and user access, multimedia servers are often in an overload state, resulting in the delay of service response and the low utilization of wireless resources, which makes it is difficult to satisfy the user experience quality. Aiming at the problems of low utilization rate of multimedia communication resources and large computing load of servers, this paper proposes a self management mechanism and architecture of wireless resources based on multimedia flow green communication. First, based on the combination of multimedia server, relay base station and user cluster, a multimedia green communication system architecture is built based on the comprehensive utilization rate of multimedia communication, and a cluster green communication control algorithm is proposed. Secondly, aiming at the dynamic service demand and asynchronous multimedia communication environment, aiming at ensuring the balance of resource allocation and accelerating the speed of resource allocation, we build a dynamic multimedia wireless resource architecture. Finally, the experimental results of statistics and analysis, from the server in different scale parallel multimedia streams under different scale delay, number of users relay network free resources proportion, user satisfaction, packet loss rate and other performance show that the proposed algorithm is effective and feasible.

     

On the Design, Development, Deployment, and Network Survivability Analysis of the Dynamic Routing System Protocol

With the ever-increasing demands on server applications, reliability is of paramount importance. Often these services are implemented using a distributed server cluster architecture where many servers act together providing end user services. We evaluated one hundred deployed systems and found that over a one-year period, thirteen percent of the hardware failures were network related. To reliably provide end-user services, the server clusters must guarantee server-to-server communication in the presence of these network failures. We describe a protocol designed to provide proactive dynamic routing for server clusters architectures called the Dynamic Routing System (DRS) protocol and present analysis to its survivability in the presence of network failure. Our experiments show that, for an eight-node server cluster with three concurrent network failures, the DRS provides a 267% improvement in the probability of server to server communication over a traditional network topology. Additionally, the proactive routing approach of the DRS performs better than traditional routing systems by fixing network problems before they affect application communication.     

Video placement and configuration of distributed video servers on cable TV networks

A large-scale, distributed video-on-demand (VOD) system allows geographically dispersed residential and business users to access video services, such as movies and other multimedia programs or documents on demand from video servers on a high-speed network. In this paper, we first demonstrate through analysis and simulation the need for a hierarchical architecture for the VOD distribution network.We then assume a hierarchical architecture, which fits the existing tree topology used in today's cable TV (CATV) hybrid fiber/coaxial (HFC) distribution networks. We develop a model for the video program placement, configuration, and performance evaluation of such systems. Our approach takes into account the user behavior, the fact that the user requests are transmitted over a shared channel before reaching the video server containing the requested program, the fact that the input/output (I/O) capacity of the video servers is the costlier resource, and finally the communication cost. In addition, our model employs batching of user requests at the video servers. We study the effect of batching on the performance of the video servers and on the quality of service (QoS) delivered to the user, and we contribute dynamic batching policies which improve server utilization, user QoS, and lower the servers' cost. The evaluation is based on an extensive analytical and simulation study.     

异构无线网络中动态优先级接纳控制算法研究

针对在应急情况下的异构网络环境中不同类型业务在群组切换时出现的网络拥塞问题,以及现有研究中较少考虑不同类型用户所进行的业务的重要性和紧急性不同,从而不能合理分配有限的网络资源的情况,提出了一种异构无线网络中动态优先级接纳控制算法。首先,根据用户类型和业务类型对业务设定初始优先级;然后,根据业务的执行紧迫性和业务的剩余价值密度对业务优先级进行动态调整,并提出了一种基于业务优先级的抢占调度算法;最后为避免在业务优先级进行动态调整过程中出现颠簸调度现象,给出了避免颠簸调度的条件。所提算法考虑了实际情况中不同用户类型所进行的业务重要程度的不同,对业务进行了优先级设定,使初始优先级高的业务能够优先得到服务,在此基础上为尽量满足整体用户的用网需求,对业务的优先级进行了动态调整。为验证所提方法的有效性,将基于优先级队列调度算法和基于阻塞率约束的群组切换方法作为对比算法,在MATLAB软件环境下进行仿真分析。结果表明,所提方法相较于对比算法能够在减少业务切换的阻塞率的同时,使总体业务的完成率提高10%左右,证明了该算法在使初始优先级高的业务能够优先得到服务的同时,为初始优先级低的业务提供了网络切换的条件,从而提高了网络资源分配的合理性和公平性。     

视频服务器网络中影像对象映射问题的研究

视频服务器网络中的影像对象映射问题是一种新的组合优化问题.服务器网络可以建立在基于局域网的工作站网络之上,也可以建立在广域网之上.基于对用户的服务请求模式、服务器网络的存储容量和通信带宽等因素的综合考虑,研究了服务器网络中影像对象映射问题,利用局部搜索算法给出了一套对该映射问题的解决方案.然后用一套基准集实例对给出的算法集进行验证.结果表明,在较短的计算时间内,该算法可以得到近似最优解的方案.     

A Framework for Resource Allocation in Multi-Service Multi-Rate Overlay Networks Based on Microeconomic Theory

A significant issue in overlay multicasting is designing self-organizing mechanisms that can be able to utilize the natural selfishness of users in such a way that leads to maximization of the total utility of the system. We present a competitive economical system including dynamic algorithms for joining and leaving in which a number of services are provided to the users by a number of origin servers. Each offered service can be considered as a commodity and the servers and the users who relay the services to their downstream nodes can thus be considered as producers of the economy. Also, the users can be viewed as consumers in the economy. On joining to the network, each user is provided with a budget and tries to get hold of the services. We use Walrasian equilibrium to show existence of market-clearing prices. The system is proved to be scalable and experimental results confirm that our proposed mechanism works near-optimal.     

A simple distributed scheduling policy for parallel interactive continuous media servers

In this paper we discuss the design of parallel interactive continuous media servers suitable for the implementation of scalable server-based media delivery services like Video-on-Demand or Teleshopping. The main design problems for the development of such servers is to ensure the just-in-time delivery of media elements in order to maximize the Quality of Service and to minimize the buffer size at the user site. Just-in-time delivery means that the media elements should be sent as late as possible to the users but early enough to ensure a continuous replay of the media. This is important because clients have to provide buffer space for data arriving to early. The Quality of Service measures the number of data elements arrived in time at the user side. Thus, the real-time properties of the internal communication network as well as the congestion arising at the disks are of highest importance. We present models for parallel media servers and a very simple scheduler that is fully distributed and can therefore easily be implemented on a scalable parallel continuous media server. For each requested data element the scheduler sends a request to the storage subsystems at a point of time only depending on the deadline of that request, i.e. the time the data has to be delivered to the user, and the length of the path the data has to be routed through the internal network of the parallel server. In order to minimize the buffer space at the user site, and to maximize the Quality of Service, we develop timing strategies for the scheduler using simulation results as well as analytical observations.     

Spatial cloaking for anonymous location-based services in mobile peer-to-peer environments

This paper tackles a privacy breach in current location-based services (LBS) where mobile users have to report their exact location information to an LBS provider in order to obtain their desired services. For example, a user who wants to issue a query asking about her nearest gas station has to report her exact location to an LBS provider. However, many recent research efforts have indicated that revealing private location information to potentially untrusted LBS providers may lead to major privacy breaches. To preserve user location privacy, spatial cloaking is the most commonly used privacy-enhancing technique in LBS. The basic idea of the spatial cloaking technique is to blur a user’s exact location into a cloaked area that satisfies the user specified privacy requirements. Unfortunately, existing spatial cloaking algorithms designed for LBS rely on fixed communication infrastructure, e.g., base stations, and centralized/distributed servers. Thus, these algorithms cannot be applied to a mobile peer-to-peer (P2P) environment where mobile users can only communicate with other peers through P2P multi-hop routing without any support of fixed communication infrastructure or servers. In this paper, we propose a spatial cloaking algorithm for mobile P2P environments. As mobile P2P environments have many unique limitations, e.g., user mobility, limited transmission range, multi-hop communication, scarce communication resources, and network partitions, we propose three key features to enhance our algorithm: (1) An information sharing scheme enables mobile users to share their gathered peer location information to reduce communication overhead; (2) A historical location scheme allows mobile users to utilize stale peer location information to overcome the network partition problem; and (3) A cloaked area adjustment scheme guarantees that our spatial cloaking algorithm is free from a “center-of-cloaked-area” privacy attack. Experimental results show that our P2P spatial cloaking algorithm is scalable while guaranteeing the user’s location privacy protection.     

EWS-Based Management Application Interface and Integration Mechanisms for Web-Based Element Management

Web-based network element management provides an administrator with the ability to configure and monitor network devices over the Internet using a Web browser. The most direct way to accomplish this is to embed a Web server [Embedded Web Server (EWS)] into a network device, and use that server to provide a Web-based management user interface constructed with HTML, graphics, Java and other features common to Web browsers. In this paper we present EWS-based management application interface mechanisms for use between embedded management applications and embedded Web servers. We propose a guideline for choosing an efficient interface mechanism, which is based on the characteristics of management information and Web documents. A Web-based management user interface through embedded Web servers has many advantages such as ubiquity, platform independence and user-friendliness. In order to be truly useful, a Web-based management user interface must have a low development cost and a short development time. We provide effective integration mechanisms for each interface. We validate these mechanisms by implementing them in an Internet router.     

移动计算机网络协议结构

本文研究了移动计算机网络的动态寻址和移动透明性问题，提出了基于归属名字服务器和拜访名字服务器的移动管理方案。归属名字服务器存在移动台的归属地址和当前地址等信息，拜访名字服务器存有进入其所在子网移动台的寻址信息，并在移动台离开后延缓两倍分组寿命的时间再删除其寻址信息，即避免频繁地交互移动管理信息，又不用担心寻址信息过时。本文给出了移动计算机网络的协议结构，可支持有连接和无连接通信。     

移动代理人编程技术与移动用戶管理系统探讨

有自我控制与辨别身份能力的移动代理人编程技术,不但能够在网路上移动,也能够与其他代理人编程沟通及执行任务.由于移动代理人常常运作于异质的网路或作业系统(operating system)环境下,因此,一个具有整体逻辑性操作界面来存取实体结构的管理系统就显得越发重要.提出了一个能够追踪和维持移动代理人的管理系统,并且应用于远距教学(distance learning).此系统的主要目的在于提供移动代理人通用的存取环境.为了能使此系统完全运作,论述了移动代理人通信网路模组、移动代理人演化阶段来支援管理代理人与用户端代理人.另外,也将移动代理人所使用的工具编程整合成为角色扮演(role-setting)物件;此角色扮演物件是符合所谓应用编程驱使元件(application-driven component)的,因此,此系统也能够符合专业化利益的使用者的需求.     

基于Linux系统的分布式网络管理系统

实现了一个基于Linux MySQL Apache PHP开发的分布式网络管理系统,能够同时对多个不同服务器和网络设备进行管理和控制,实现统一用户管理、实时计费、收费以及查询等功能,极大地简化了网络的管理。     

智能卡和口令结合的动态认证方案

远程认证协议能有效的保证远程用户和服务器在公共网络上的通信安全。提出一种匿名的安全身份认证方案,通过登录 的动态变化,提供用户登录的匿名性,通过用户和服务器相互验证建立共享的会话密钥,抵抗重放攻击和中间人攻击,实现用户安全和隐私,通过BAN逻辑分析证明改进方案的有效性,通过安全性证明和性能分析说明了新协议比同类型的方案具有更高的安全性、高效性。     

Real-Time Virtual Channel Flow Control

Real-time communication system support for large scale parallel multicomputers becomes an important issue as the number of real-time applications developed on these systems increases. Flow control is a key component that affects the performance of the communication subsystem. We develop a range of new real-time virtual channel flow control schemes for wormhole networks. The flow control schemes differ in their priority mapping strategies, priority adjustment methods, and arbitration functions. The priority mapping strategy and priority adjustment method of a flow control scheme determine the priority of a message. The priority of a message is used for the virtual channel assignment and the physical channel arbitration. We discuss the trade-off between the performance and the hardware cost of each flow control scheme. A simulator is implemented for studying the performance of the schemes, and simulation experiments are designed to compare the importance of priority mapping, priority adjustment and arbitration toward the system performance. As wormhole networks scale to larger sizes, the average distance between source and destination nodes increases. The flits of messages in wormhole networks, which are buffered in nodes along the path from the source to the destination, consume network resources in these nodes. Therefore, increased scaling may lead to increased resource consumption, congestion, and late messages. In real-time systems, messages lose their value when they miss their deadlines. In order to reduce congestion, we provide a scheme for dropping messages that miss their deadlines.     

The role of VGI and PGI in supporting outdoor activities

This paper explored the question of how volunteered and professional geographic information (VGI and PGI) can be used together in an outdoor recreation context. In particular, consideration is given to what makes each information source valuable to the user, and how this can be used to help developers of GIS provide more useful, usable and satisfying products. The assumption that VGI is inferior to PGI is shown to be unfounded; rather each has its own strengths in describing particular aspects of the user information landscape. Considering the opportunities to influence user activities, both VGI and PGI have a greater ability to influence the user in the planning phase than actually during the activity. The importance of the author of the information (volunteer or professional) is shown to be of less importance to the end-user than the characteristics which describe the information in terms of communication, frequency of updates and accessibility.     

Disseminating streaming data in a dynamic environment: an adaptive and cost-based approach

In a distributed stream processing system, streaming data are continuously disseminated from the sources to the distributed processing servers. To enhance the dissemination efficiency, these servers are typically organized into one or more dissemination trees. In this paper, we focus on the problem of constructing dissemination trees to minimize the average loss of fidelity of the system. We observe that existing heuristic-based approaches can only explore a limited solution space and hence may lead to sub-optimal solutions. On the contrary, we propose an adaptive and cost-based approach. Our cost model takes into account both the processing cost and the communication cost. Furthermore, as a distributed stream processing system is vulnerable to inaccurate statistics, runtime fluctuations of data characteristics, server workloads, and network conditions, we have designed our scheme to be adaptive to these situations: an operational dissemination tree may be incrementally transformed to a more cost-effective one. Our adaptive strategy employs distributed decisions made by the distributed servers independently based on localized statistics collected by each server at runtime. For a relatively static environment, we also propose two static tree construction algorithms relying on apriori system statistics. These static trees can also be used as initial trees in a dynamic environment. We apply our schemes to both single- and multi-object dissemination. Our extensive performance study shows that the adaptive mechanisms are effective in a dynamic context and the proposed static tree construction algorithms perform close to optimal in a static environment.     

移动边缘计算中资源受限的动态服务部署策略

移动边缘计算（MEC）的出现使移动用户能够以低延迟访问部署在边缘服务器上的服务。然而,MEC仍然存在各种挑战,尤其是服务部署问题。边缘服务器的数量和资源通常是有限的,只能部署数量有限的服务;此外,用户的移动性改变了不同服务在不同地区的流行度。在这种情况下,为动态请求部署合适的服务就成为一个关键问题。针对该问题,通过了解动态用户请求来部署适当的服务以最小化交互延迟,将服务部署问题表述为一个全局优化问题,并提出了一种基于集群划分的资源聚合算法,从而在计算、带宽等资源约束下初步部署合适的服务。此外,考虑动态用户请求对服务流行度及边缘服务器负载的影响,开发了动态调整算法来更新现有服务,以确保服务质量（QoS）始终满足用户期望。通过一系列仿真实验验证了所提出策略的性能。仿真结果表明,与现有基准算法相比,所提出的策略可以降低服务交互延迟并实现更稳定的负载均衡。     

Tight performance bounds in the worst-case analysis of feed-forward networks

Network Calculus theory aims at evaluating worst-case performances in communication networks. It provides methods to analyze models where the traffic and the services are constrained by some minimum and/or maximum envelopes (arrival/service curves). While new applications come forward, a challenging and inescapable issue remains open: achieving tight analyzes of networks with aggregate multiplexing. The theory offers efficient methods to bound maximum end-to-end delays or local backlogs. However as shown in a recent breakthrough paper (Schmitt et al. 2008), those bounds can be arbitrarily far from the exact worst-case values, even in seemingly simple feed-forward networks (two flows and two servers), under blind multiplexing (i.e. no information about the scheduling policies, except FIFO per flow). For now, only a network with three flows and three servers, as well as a tandem network called sink tree, have been analyzed tightly.We describe the first algorithm which computes the maximum end-to-end delay for a given flow, as well as the maximum backlog at a server, for any feed-forward network under blind multiplexing, with piecewise affine concave arrival curves and piecewise affine convex service curves. Its computational complexity may look expensive (possibly super-exponential), but we show that the problem is intrinsically difficult (NP-hard). Fortunately we show that in some cases, like tandem networks with cross-traffic interfering along intervals of servers, the complexity becomes polynomial. We also compare ourselves to the previous approaches and discuss the problems left open.     

KIOIK:一个基于操作系统内核的CORBA实现及其性能分析

CORBA是分布式计算领域的研究热点,性能对于诸如实时、嵌入式CORBA应用至关重要,在高速网络环境下或backbone系统中,端系统的性能是整个系统性能不可忽视的因素,在传统的实时、嵌入CORBA应用中,影响端系统性能的几个主要因素包括操作系统的上下文切换、进程调度以及用户空间与操作系统间的数据复制,文章认为,CORBA的内核级实现可以消除或减小以上开销,KIOIK是基于Linux内核的CORBA实现,阐述了在Linux内核级实现CORBA的若干关键技术,为CORBA端系统的性能优化提出了一个新的思路,最后给出了KIOIK与用户空间CORBA以及核内SunRPC的延迟对比测试结果,并做了相应的性能分析。