• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.338-350
• /
• 2008

The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.71-78
• /
• 2008

We propose the scheme that supports continuously service when a user tries to contact new target network in broadband convergence network even though the network resource for the service is not enough. The proposed scheme transforms original service capacity into suitable QoS for the target network using the scalable service techniques in the oncoding/decoding and supports handover for the user. We analyzed the handover blocking probability of two schemes using queueing system to show the improvement of performance by the proposed scheme. Subsequently, we showed that the handover blocking probability in the proposed scheme is lower than that in the existing scheme.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.6
• /
• pp.481-487
• /
• 2004

In this paper. the structure of bandwidth scalable wideband speech codec and its high-band codec are proposed. In the high-band codec. the signal is divided into frequency bands. and each band is quantized in DCT domain. The DCT coefficients are splitted into magnitude and sign, and each is quantized independently by a specialized method based on its characteristics. In addition. the quantized gain parameter in the low-band codec is utilized in the high-band codec for an enhanced performance. The bandwidth scalable wideband speech codec using G.729E for low-band and the proposed codec for high-band is developed, and it is confirmed that the proposed codec has better subjective performance than 24kbps G.722.1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.695-703
• /
• 2010

In this paper, we propose an adaptive scalable encryption scheme for the layered architecture of SVC video. The proposed method determines an appropriate set of encryption algorithms to be applied for the layers of SVC by considering the importance and priority relationship among the SVC video layers. Unlike the conventional encryption method based on a fixed encryption algorithm for the whole video layers, the proposed method applies differentiated encryption algorithms with different encryption strength the importance of the video layers. Thereupon, higher security could be maintained for the lower video layer including more important data, while lower encryption strength could be applied for the higher video layer with relatively less important data. The effectiveness of the proposed adaptive scalable encryption method is proved by extensive simulations.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.73-83
• /
• 2010

The scalability of a grid system should be efficiently designed to handle the increasing number of grid users. This paper presents a scalable resource sharing mechanism among virtual organizations (VO) in grid environment by the scalable virtual organizations (SVO). The proposed grid architecture is composed of standard services of a grid system to manage the SVO. We propose a group similarity function which is used to determine similarities among VOs to select the VOs to merge. We compared other similarity functions to the GSF and determined the throughput performance of the SVO using simulation for grid system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.901-923
• /
• 2017

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

• Convergence Security Journal
• /
• v.11 no.3
• /
• pp.47-54
• /
• 2011

To protect SVC(Scalable Video Coding) media, the encryption mechanism need to consider two fundamental issues; First, What is to be encrypted? Second, When encryption is performed with respect to compression? In this paper, we analyze the several encryption approaches with regard to the above issue. And we propose hybrid-based protection mechanism. This mechanism ensures the media scalability, layered access control and reuse protected content. In this experiment the proposed mechanism generates under 3% security overhead against standard scalable video coding.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.155-162
• /
• 2011

The scalable extension of the H.264/AVC video coding standard (SVC) demonstrates superb adaptability in video communications. Joint source and channel coding (JSCC) has been shown to be very effective for such scalable video consisting of parts of different significance. In this paper, a new JSCC scheme for SVC transmission over packet loss channels is proposed which performs two-dimensional optimization on the quality layers of each frame in a rate-distortion (R-D) sense as well as on the temporal hierarchical structure of frames under dependency constraints. To compute the end-to-end R-D points of a frame, a novel reduced trellis algorithm is developed with a significant reduction of complexity from the existing Viterbi-based algorithm. The R-D points of frames are sorted under the hierarchical dependency constraints and optimal JSCC solution is obtained in terms of the best R-D performance. Experimental results show that our scheme outperforms the existing scheme of [13] with average quality gains of 0.26 dB and 0.22 dB for progressive and non-progressive modes respectively.

• 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.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1310-1317
• /
• 2017

GASFLOW-MPI is a widely used scalable computational fluid dynamics numerical tool to simulate the fluid turbulence behavior, combustion dynamics, and other related thermal-hydraulic phenomena in nuclear power plant containment. An efficient scalable linear solver for the large-scale pressure equation is one of the key issues to ensure the computational efficiency of GASFLOW-MPI. Several advanced Krylov subspace methods and scalable preconditioning methods are compared and analyzed to improve the computational performance. With the help of the powerful computational capability, the large eddy simulation turbulent model is used to resolve more detailed turbulent behaviors. A backward-facing step flow is performed to study the free shear layer, the recirculation region, and the boundary layer, which is widespread in many scientific and engineering applications. Numerical results are compared with the experimental data in the literature and the direct numerical simulation results by GASFLOW-MPI. Both time-averaged velocity profile and turbulent intensity are well consistent with the experimental data and direct numerical simulation result. Furthermore, the frequency spectrum is presented and a -5/3 energy decay is observed for a wide range of frequencies, satisfying the turbulent energy spectrum theory. Parallel scaling tests are also implemented on the KIT/IKET cluster and a linear scaling is realized for GASFLOW-MPI.