• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2A
• /
• pp.86-95
• /
• 2003

With the advent of future mobile communication systems, the wireless transmission of the huge amount of multimedia data over the error-prone multipath fading channel has to overcome the inherent sensitivity to channel errors. To alleviate the effect of the channel errors, hosts of techniques based on the forward error correction(FEC) has been proposed at the cost of overhead rate. Among the FEC techniques, turbo code, whose performance has been shown to be very close to the Shannon limit, can be classified as a block-based error correction code. In this paper, considering the variable packet size of the multimedia data, we analyzed turbo codes employing the variable-sized interleaver. The effect of the various parameters on the BER performance is analyzed. We show that the turbo codes can be used as efficient error correction codes of multimedia data.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.41-50
• /
• 2008

Recently amount of traffic into the network rapidly increase since multimedia streaming services is generally adopted for application. In addition, various network management systems have been suggested for providing a stable service and QoS guarantee. It is necessary for such systems to have QoS monitoring module in order to evaluate acceptance or violation of QoS requirements by analogizing a state information of each node within network. In this paper, we suggest a network management system to evaluate QoS level between end-to-end agents and analysis traffics transmitted between them. The proposed system is implemented for the purpose of collecting network traffic information and monitoring of the view. The proposed system makes user easily understand information of QoS parameters such as throughput, delay and jitter by adopting a method of visual and numerical representation. To achieve this, we purportedly generate test packet into network for confirming acceptance or violation of QoS requirements from point of view of multimedia application service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.331-337
• /
• 2005

The optical Internet is considered as a feasible solution for transporting huge amount of traffic volume in the future Internet. Among optical switching technology for the optical Internet, OBS becomes one of the most promoting solution. Recently, a lebeled OBS(LOBS) architecture is considered for an efficient control on OBS network. Given that a data burst may contain few thousands of IP packets, a single loss of data burst results in a serious throughput degradation in LOBS network. In this paper, we improve the performance of LOBS network by introducing the burst congestion control mechanism. More specifically, the OBS router at the network core detects the network congestion by measuring the loss probability of burst control packet. The OBS router at the network edge reduces the burst generation according to the network condition repored by the OBS router at the network core. Through the simulations, it is shown that the proposed congestion control mechanism can reduce the burst loss probability and improve the LOBS network throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.573-577
• /
• 2005

Recently there are increasing needs for Internet and various kinds of contents. These traffics for various contents need more amount of data to provide high-quality information and require various QoS depending on the characteristics of contents. However, current Internet service supports BE (Best Effort) service only, therefore IntServ (Integrated Service) scheme and DiffServ (Differentiated Service) scheme are represented to support QoS in IP layer. Moreover, while wireless Internet is getting popular, MAC(Medium Access Control)is also becoming important. This is due to the fact that wireless access, resource allocation and packet scheduling, which are done in another layers before, are performed in MAC layer in many new wireless systems. This paper describes new scheme that provides QoS taking into account the traffic characteristics over Mobile IPv6 network based on IEEE 802.11e EDCF and evaluates the performance through computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.296-303
• /
• 2008

In this paper, we propose a novel Route_Reconf message as the RSVP message to maintain an RSVP session for hard handoff and consider a path-comparing route(PCR) algorithm to find an intermediate node in the charge of down-link re-establishment. And, we consider information form each mode for the PCR algorithm, which also reduces the frequency and amount of exchanged RSVP message to minimize packet loss and delay between an intermediate node and a receiver. According to the proposed algorithm, a new support node(NSN) and an existing support node(ESN) along the RSVP path can be found; the former is a supporting RSVP session node newly searched and the latter is the last supporting node holding the previous session after handoff. On receiving the Route_Reconf message at the ESN, a new allocated route from a NSN to the MN waiting for the handoff via a new access router is configured by the ESN.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.328-335
• /
• 2002

When we want to transfer video streaming data through computer networks, we will have to be allocated a larger bandwidth compared to a general application. In general, it causes a serious network overload inevitably due to the limited bandwidth. In this paper, in order to resolve the problem, we haute taken a method for transmitting video streaming data using RTP and RTCP. With RR(Receiver Report) packet in RTCP we will test it to check whether the traffic in a network has occurred or not. If it happened, we haute tried to reduce the overall network traffic by dynamically changing the quantization factor of the Motion JPEG that is one of the encoding styles in JMF. When the ratio of the average of transmission for each session to the average of overall transmission is greater than 7%, we should adjust the amount of data to be transmitted for each session to reach the session mean values. The experimental results show that the proposed method taken here reduces the overload effectively and therefore improves the efficiency for transmitting video streaming data.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.5
• /
• pp.903-909
• /
• 2010

ADAS is the air defense control system performing air surveillance and identification of ROK and near air. This system is self-developed by Air Force, currently operated successfully as the alternative system of MCRC. ADAS processes converting and combining transferred the real time radar data detected by radars. additionally, it displays significant radar data as producing in tracks. Then, it uses the message queue for IPC(Inter Process Communication). the various tactical data processed in the server is ultimately send to the network management process through the message queue for transmitting to the weapon director console. the weapon director receives this transmitted tactical data through the console to execute air defense operations. However, there is a problem that data packet is delayed or lost since the weapon Director does not receive as the amount of tactical data from the server overflowed with air tracks and missions increased. This paper improved the algorism to display and transmit the various tactical data processed from ADAS server to numbers of the weapon director console in the real time without any delay or lost. Improved the algorism, established at exercise, the development server in the real operation network and the weapon director console, is proved by comparing the number of sending tactical data packets in the server and receiving packets in the weapon director.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.6
• /
• pp.179-188
• /
• 2014

Due to the tremendous amount and its rapid increase of network traffic, the performance of network equipments are becoming an important issue. Network filtering is one of primary functions affecting the performance of the network equipment such as a firewall or a load balancer to process the packet. In this paper, we propose a cache based tri method to improve the performance of the existing tri method of searching for network filtering. When several packets are exchanged at a time between a server and a client, the tri method repeats the same search procedure for network filtering. However, the proposed method can avoid unnecessary repetition of search procedure by exploiting cache so that the performance of network filtering can be improved. We performed network filtering experiments for the existing method and the proposed method. Experimental results showed that the proposed method could process more packets up to 790,000 per second than the existing method. When the size of cache list is 11, the proposed method showed the most outstanding performance improvement (18.08%) with respect to memory usage increase (7.75%).

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.647-654
• /
• 2002

Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other supporting communication facilities (such as base stations, etc.). Therefore, the topology of an Ad-hoc network frequently changes due to the movement of mobile host, which nay lead to sudden packet loss. Recently, the large amount of research has focused on the routing protocols needed in such an environment. In this paper, TCP Reno, Sack, and Tahoe versions are analysed using DSR protocol which is the representative On-Demand routing protocol in Ad-hoc wireless network. As the result of this simulation, we know that TCP Reno relatively has higher throughput than that of Sack and Tahoe, and TCP Reno has more stable performance than that of TCP Tahoe and Sack, regardless of the speed of mobile node and the size of topology.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1165-1174
• /
• 2007

Mobile ad hoc networks suffer from the re-construction of the routing path as a node on the path moves away and/or fails. In this paper we propose a multipath routing scheme, designed for the network based on the directional antennas, in which a new path is quickly recovered by do-touring to an alternative neighbor called braid. Simulations are conducted in random networks with 50 nodes uniformly deployed in a $1,000m{\times}1,000M$ area where, all nodes have a transmission range of 250m and the average node moving speed varies from 0 to 10m/s. The proposed approach under the ideal antenna with K(>1) directional sectors achieves better results compared with the case of K=1, the omnidirectional antenna model, in terms of the metrics: packet delivery ratio and average number of hops for the routing paths. As further study, a scheme to alleviate the heavy amount of latency accompanied by the rout setup is urgently required.