• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.305-313
• /
• 2004

Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as stoup size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.102-110
• /
• 2010

H.264 SVC(Scalable Video Coding) provides the advantages of low disk storage requirement and high scalability. However, a streaming server or a user terminal has to extract a bit stream from SVC file. This paper proposes a bit stream extraction method which can get the maximum PSNR value while date bit rate does not exceed the available network bandwidth. To do this, this paper obtains the information about extraction points which can get the maximum PSNR value offline and decides the spatial/temporal resolution of a bit stream at run-time. This resolution information along with available network bandwidth is used as the parameters to a bit stream extractor. Through experiment with JSVM reference software, we proved that proposed bit stream extraction method can get a higher PSNR value.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.29-32
• /
• 2000

Layered video coding schemes allow the video information to be transmitted in multiple video bitstreams to achieve scalability. they are attractive in theory for two reasons. First, they naturally allow for heterogeneity in networks and receivers in terms of client processing capability and network bandwidth. Second, they correspond to optimal utilization of available bandwidth when several video qualify levels are desired. In this paper we propose a scalable video codec architectures with motion estimation, which is suitable for real-time audio and video communication over packet networks. The coding algorithm is compatible with ITU-T recommendation H.263+ and includes various techniques to reduce complexity. Fast motion estimation is Performed at the H.263-compatible base layer and used at higher layers, and perceptual macroblock skipping is performed at all layers before motion estimation. Error propagation from packet loss is avoided by Periodically rebuilding a valid Predictor in Intra mode at each layer.

• Smart Media Journal
• /
• v.1 no.1
• /
• pp.27-35
• /
• 2012

In this paper, the performance analysis for multimedia video codec(MPEG-4, H.264) on on-chip network communication architecture is presented. The On-Chip Network (OCN) is the new communication architecture of multimedia SoC design that overcomes the limits of On-Chip Bus architecture by providing higher data traffic bandwidth, reusability and higher scalability. We compared the performance of MPEG-4, H.264 decoder based on-chip network and AMBA on-chip bus. Experimental results show that the performance of MPEG-4, H.264 based on on-chip network is improved over 33~56% compared to the design based on AMBA on-chip bus.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1655-1673
• /
• 2018

Mobile computing environment is subject to the constraints of bounded network bandwidth, frequently encountered disconnections, insufficient battery power, and system asymmetry. To meet these constraints and to gain high scalability, data broadcasting has been proposed on data transmission techniques. However, updates made to the database in any broadcast cycle are deferred to the next cycle in order to appear to mobile clients with lower data currency. The main goal of this paper is to enhance the transaction performance processing and database currency. The main approach involves decomposing the main broadcast cycle into a number of sub-cycles, where data items are broadcasted as they were originally sequenced in the main cycle while appearing in the most current versions. A concurrency control method AOCCRBSC is proposed to cope well with the cycle decomposition. The proposed method exploits predeclaration and adapts the AOCCRB method by customizing prefetching, back-off, and partial backward and forward validation techniques. As a result, more than one of the conflicting transactions is allowed to commit at the server in the same broadcast cycle which empowers the processing of both update and read-only transactions and improves data currency.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.101-111
• /
• 2004

As different from wired internet, wireless internet has limitations due to the following characteristics; low bandwidth, frequent disconnection, low computing power, small screen in user terminal, and user mobility. Also, wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. Wireless proxy servers are used for the wireless internet because their caching and transcoding functions are helpful to overcome the above limitation. TranSend was proposed as a clustering based wireless proxy server but its scalability is difficult to achieve because there is no systematic way to do it. In this Paper. we proposed a clustering based wireless internet proxy server which can be scalable in a systematic way. We performed experiments using 16 PCs and experimental results show 32.17% performance improvement of the proposed system compared to TranSend system.

• Journal of Computing Science and Engineering
• /
• v.9 no.4
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1257-1262
• /
• 2001

In recent years there has been a lot of interest in carrying IP over WDM networks in an efficient manner. The benefits here include larger bandwidth capacities, better network scalability, and more efficient operation. W based approach, termed "lambda-labeling" is presented for direct If over WDM integration. In this paper, we study on architecture approach method consider of optical Internet evolution that based on MPLamdaS conception of IETF. Label stack conception collect electronic LSP of optical LSP. This paper is proposed method of co-operation between MPLS domain and MPLambdaS domain. Additionally, proposed architecture of Edge Optical LSR.tical LSR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2B
• /
• pp.27-35
• /
• 2005

As the number of Mobile IP users is expected to grow, the signaling overhead associated with mobility management in the wireless Internet is bound to grow. And since the wireless link has far less bandwidth resources and limited scalability compared to the wired network link, the signaling overhead associated with mobility management has a severe effect on the wireless link. In this paper, we propose IP-Grouping algorithm that can greatly reduce the signaling cost in the wireless link as Access Routers(ARs) with a large rate of handoff are grouped into a Group Zone. Based on the numerical analysis and simulation, we show that the wireless signaling cost in the IP-Grouping is much lower than that of the Hierarchical Mobile IPv6 under various condition.

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.749-754
• /
• 2002

In this paper, We propose a titrate allocation method in which the bitrates of the videos for the lower layer are restricted by constant titrate, but those of the higher layer are assigned to have the uniform picture quality, for the multiplexing system of multiple spatial scalable video sources. We first find an approximated model of distortion-bitrate for the MPEG-2 spatial scalable video coding system, then we obtain the bitrate for each source to have constant distortion ratio among the sources by using the approximated model parameters for real-time simple implementation. It is shown by simulation that the proposed bandwidth allocation can keep almost constant picture Quality ratio among the sources of higher layer.