• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.22-32
• /
• 1997

This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.64-70
• /
• 2003

In order to provide seamless wireless Internet service, the basic mobile IP protocol should be enhanced to solve packet loss problem from large registration latency because frequent handoffs occur in cellular networks. In this paper, we suggest a new micro-mobility management protocol based on MPLS while supporting Qos, and evaluate its performance using simulation. We use MPLS label switching techniuqe in cellular access networks to simplify location management and speed up packet transmission. We adopt context transfer procedure to minimize the delay needed to attain prior level of service after handoff Packet loss can be minimized during handoff by transmitting received packets from old BSLER to new BSLER using a spliced LSP between them. Simulation results show that the proposed MPLS-based micro-mobility management protocol provides a seamless handoff and supports QoS of user traffic.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.191-192
• /
• 2007

Recently, demand of multimedia data have been increasing in mobile and wireless communication environment. Also overlay multicast has an advantage supports multicast without changing the existing network structures for transmitting reliable data. In this paper, we propose new overlay techniques guaranting Qos and transmission speed through overlay multicast.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.199-208
• /
• 2005

In this thesis, we have proposed an extended resource management mechanism that optimizes the QoS of multimedia service by complementing the existing resource management mechanism used in IP networks. The proposed resource management mechanism is composed of traffic Scheduler which was designed based on statistic analysis of the distribution of user traffic occurrence, Traffic Monitor Unit, Bandwidth Allocation Unit, queue Controller, and Traffic Classifier In order to confirm the validity of the proposed resource management mechanism, its performance was analyzed by using computer simulation. As a result of performance analysis, its availability was proved.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1308-1318
• /
• 1997

This paper proposes a new touthind algorithm, the Bandwidth-Delay-Loss based Routing(BDLR) algotithm, which supports the selection of an effcienet routing path by cinsidering the characteristics and QoS requirements of intergarted servies over the Untegrated Serives Packet Network(ISPN), and also compareas it with other touting algorithms by simulating their perfomances on the various combinations of the realtime and non-realtime traffic over the ISPN. The simulation shows that the BDLR algorithm takes great advantages on transmisson dealy, the satisfiability of QoS requirements, and the adapation of traffic envirment over the other routing algorithms priposed for ISPN until now.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1770-1780
• /
• 1997

Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.