• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.203-206
• /
• 2001

This Paper suggests real-time video streaming method by using DCT-based scalability, and evaluates and analyzes the function. It is similar to using lowpass filter. That is, as following figure, this method is to split the encoded data in splitter and transmit it, and to decode the data according to the situation. This method can be applied to any video CODEC which is based on DCT. Therefore, this thesis suggests easy video streaming method by using DCT-based scalability, and shows the result of experiment. By using suggested scalability, calculations are reduced, and spacial scalability is realized. Moreover, the objective data which meet user's need according to the network condition and choose the appropriate scalability according to the capability of terming can be extracted. And it is possible to apply any resources according to the specificity of image.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.91-96
• /
• 2008

An image scalablity function is noted as technology to embody One Source-Multi-use's Image division by the network Bandwidth and diversification of resolution of reception terminal recently. In MPEG present H.264/MPEG-4 AVC that do to standardization of SVC (Scalable Video Coding) that know go and SVC can offer space time SNR scalability. But, encoding that do scalable usually is known that encoding efficiency drops than encoding that do rain scalable during time and treatise that see. Examine technique to plan improvement of management quality as that aim to time, SNR scalability in treatise that see so and change FGS (Fine Granular Scalability) function that offer SNR scalability that do about scalability's particle size and encoding efficiency relation by SVC to foundation.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.503-517
• /
• 2010

Service-oriented computing, the effective paradigm for developing service applications by using reusable services, becomes popular. In service-oriented computing, service consumer has no responsibility for managing services, just invokes services what service providers are producing. On the other hand, service providers should manage any resources and data for service consumers can use the service anytime and anywhere. However, it is hard service providers manage the quality of the services because an unspecified number of service consumers. Therefore, service scalability for providing services with higher quality of services specified in a service level agreement becomes a potential problem in service-oriented computing. There have been many researches for scalability in network, database, and distributed computing area. But a research about a definition of service scalability and metrics of measuring service scalability is still not mature in service engineering area. In this paper, we construct a service network which connects multiple service nodes, and integrate all the resources to manage it. And we also present a service scalability framework for managing service scalability by using a mechanism of service migration or replication. In section 3, we, firstly, present the structure of the scalability management framework and basic functionalities. In section 4, we propose scalability enhancement mechanism which is needed to release functionality of the framework. In section 5, we design and implement the framework by using proposed mechanism. In section 6, we demonstrate the result of our case study which dynamically manages services in multi-nodes environment by applying our framework. Through the case study, we show the applicability of our scalability management framework and mechanism.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.443-450
• /
• 2007

Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.60-70
• /
• 2006

Currently, Scalable Video Coding (SVC) is being standardized. By using scalability of SVC, QoS managed video streaming service is enabled in heterogeneous networks even with only one original bitstream. But current SVC is insufficient to dynamic video conversion for the scalability, thereby the adaptation of bitrate to meet a fluctuating network condition is limited. In this paper, we propose dynamic full-scalability conversion method for QoS adaptive video streaming in H.264/AVC SVC. To accomplish full scalability dynamic conversion, we propose corresponding bitstream extraction, encoding and decoding schemes. On the encoder, we newly insert the IDR NAL to solve the problems of spatial scalability conversion. On the extractor, we analyze the SVC bitstream to get the information which enable dynamic extraction. By using this information, real time extraction is achieved. Finally, we develop the decoder so that it can manage changing bitrate to support real time full-scalability. The experimental results showed that dynamic full-scalability conversion was verified and it was necessary for time varying network condition.

• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.236-245
• /
• 2004

A multiview sequence CODEC with view scaiability is proposed in this paper. We define a GGOP (Group of GOP) structure as a basic coding unit to efficiently code multiview sequences. 7he proposed CODEC provides flexible GGOP structures based on the number of views and baseline distances among cameras. Multiview sequences encode consists of disparity estimation/compensation, motion estimation/compensation, residual coding and rate control and generates multiview sequence bitstream. The main bitstream is the same as an MPEG-2 mono-sequence bitstream for MPEG-2 compatibility. The auxiliary bitstream contains information concerning the remaining multiview sequences except for the reference sequences. The proposed CODEC with view scalability provides that a number of view flints are selectively determined at the receiver according to the type of display modes. The proposed multiview sequence CODEC is tested with several multiview sequences to determine its flexibility. compatibility with MPEG-2 and view scaiability. In addition, we subjectively confirm that the decoded bitstreams with view scaiability can be Properly displayed by several types of display modes. including 3D monitors.

• Journal of Industrial Convergence
• /
• v.21 no.8
• /
• pp.51-58
• /
• 2023

Blockchains have recently struggled to design for the ideal distributed trust networks by solving scalability trilemma. However, local conflicts between some countries lead to imbalance on energy distribution. Besides, blockchain networks (e.g., Bitcoin) currently consume enormous energy for transaction and mining. The existing data volume based trust model evaluated an increasing blockchain size better than Lubin's trust model in scalability trilemma. In this paper, we propose a scalability based energy model to evaluate sustainability for blockchain networks, considering energy consumption for transaction, time duration, and the blockchain size of growing blockchain networks. Through the rigorous numerical analysis, we compare the proposed scalability based energy model with the existing model for the satisfaction and optimal blockchain size. Thus, the scalability based energy model will provide an assessment tool to choose the proper blockchain networks to solve scalability trilemma problem and prove sustainability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.235-237
• /
• 2012

Sometimes scalability is described loosely as a synonym for capacity. A system has their own characteristics that differ from others. For each system, they may have different aspect to identify their scalability. Our focus here is in the sensor middleware. This paper described the analysis of scalability for sensor middleware. Summarizing approaches to keep the scalability in check and propose a measurement candidate to decide whether it's scalable or not.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.1
• /
• pp.35-41
• /
• 2009

The H.264/SVC enables network-adaptive video transmission to smart device which uses wireless network. But, quality scalability of H.264/SVC does not consider personal subjective image quality. In addition, its network efficiency also does not optimized because it uses MGS(Medium Grained Scalability) and CGS(Coarse Grained Scalability). Thus, this paper proposed a new scalable ROI algorithm for not only subjective image quality improvement but also network adaptation. To experiment our proposed a scheme, we added designed algorithm to JSVM(Joint Scalable Video Model) open source video codec of H.264/SVC. Experiment was performed according to the pre-defined scenario for simulating various network conditions. Finally, experimental result showed our proposed scalable ROI scheme. It is better than traditional non-selective scheme in subjective video quality.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.796-806
• /
• 2008

This paper presents a blind video watermarking algorithm that has the robustness against spatial, temporal, and SNR scalability and transcoding for the copyright protection of video contents in heterogeneous multimedia service. The proposed process of watermark embedding and detecting is accomplished on base layer for considering spatial scalability. The watermark consists of the string and the ordering number of string for considering temporal scalability. Thus, each of frames has the bitstream of one character and a ordering number of its character. To robust against FGS, the proposed algorithm quantizes low and middle frequency coefficients in ROI region of each of frames and embeds its watermark bitstream into the specific bits of the quantized coefficients. Experimental results verified that the proposed algorithm satisfies the invisibility of watermark and also has the robustness against spatial scalability, temporal scalability and FGS.