• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.849-856
• /
• 2008

As the XML is used as the standard format for information delivery and exchange in various fields, the SVG is frequently used as a user interface or expression tool for the embedded system like an internet based mobile phone. The SVG file must contain additional information specifying the structure of the document and it consumes more transmission time than the actual data sent. The SMETA(Svg transmission MEthod using Semantic meTAdata) system[9] is a study to reduce the size of the SVG file by partitioning the SVG file to a minimal size and assigning meaningful meta data to each portion of the data. In this paper, instead of the meta data exchange method for reducing the size of the file exchanged in the existing SMETA system, we studied an improved version of SMETA system that analyzes the data for each user in the server system and only transmits the data that a user needs. In addition, through our simulation, we verified that it provides better performance than the existing system even if encryption is used.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.8
• /
• pp.1535-1543
• /
• 2007

Recently, there are many researches for P2P network. P2P network technologies are a good solution about making a wide spread distributed computing in the internet environment. The recent algorithms developed by several research groups for the lookup problem present a simple and general interface, a distributed hash table (DHT). In this paper, we also introduce new schemes that enhance the available rate of an object in the MagicSquare network. Replication scheme is to replicate an object with many replicas and save them to several nodes. Fragmentation scheme is to divide an object into several fragments and save them to several nodes. Replicated Fragmentation scheme is to mix replication scheme and fragmentation scheme. We will show result of simulation for our the proposed scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.3
• /
• pp.39-47
• /
• 2002

This paper deals with study of a new framework for the traceback of distributed DoS(Denial of Service) attacks in the Internet, in which many sources flood "spoofed" IP packets towards a single victim. In our scheme, the destination host traces those anonymous packets' losses, and infers the logical end-to-end paths back towards the sources. This method is based on the fact that there is a strong correlation between packet losses when those packets traverse along a same route, and the simulation results show high probabilities of detecting the topology under a certain condition. Compared with previous approaches, our scheme has a number of distinct features: It can be performed in realtime or non-realtime, without any supports of routers or ISPs. Our results may be applied to the inference of physical topology and to support previous approaches.pproaches.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1332-1335
• /
• 2008

In order to various service types of real time and non-real time traffic with varying requirements are transmitted over the IEEE 802.16 standard is expected to provide quality of service(QoS) researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The sides of a packet drop rate, an each class to differential drop probability on achieving a low delay and high traffic intensity. Improved a queue management scheme to be enhanced to offer a drop probability is desired necessarily. This paper considers multiple random early detection with differential drop probability which is a slightly modified version of the Multiple-RED(Random Early Detection) model, to get the performance of the best suited, we analyzes its main control parameters (max_th, min_th, max_p) for achieving the proportional loss differentiation (PLD) model, and gives their setting guidance from the analytic approach. we propose Dynamic-multiple queue management scheme based on differential drop probability, called Dynamic-VQSDDP(Variable Queue State Differential Drop Probability)T, is proposed to overcome M-RED's shortcoming as well as supports static max_p parameter setting values for relative and each class proportional loss differentiation. M-RED is static according to the situation of the network traffic, Network environment is very dynamic situation. Therefore max_p parameter values needs to modify too to the constantly and dynamic. The verification of the guidance is shown with figuring out loss probability using a proposed algorithm under dynamic offered load and is also selection problem of optimal values of parameters for high traffic intensity and show that Dynamic-VQSDDP has the better performance in terms of packet drop rate. We also demonstrated using an ns-2 network simulation.

• Journal of Advanced Marine Engineering and Technology
• /
• v.39 no.7
• /
• pp.744-753
• /
• 2015

This paper presents the results of research on developing marine unified communications to provide VoIP service based on marine satellites. With the recent popularity of smart-phones and other mobile devices, the demand for Internet-based wired and wireless unified technology has been growing in marine environments, and increasing interest is being directed to VoIP products and service models with high price competitiveness and the ability to deliver a variety of services. In this regard, this research designed three instruments, developed their unit modules, and verified their performances. These three instruments included the following: (1) a marine VoIP module equipped with an analogue gateway that can be linked to the existing devices used in vessels, which is more than 80% smaller than that of a land system; (2) a text/voice/video engine for marine satellite communications that runs on technology that minimizes communication data usage, which is a core technology for a marine VoIP service; and (3) a unified communication service that can support multilateral cloud-based message conversations, telephone number-based call functions, and voice/video calling between a private space in a ship and shore.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.889-896
• /
• 2006

ATM Forum has defined a guaranteed frame rate (GFR) service to serve Internet traffic efficiently. The GFR service provides virtual connections (VCs) for minimum cell rate (MCR) guarantees and allows them to fairly share the residual bandwidth. And ATM Forum has recommended a frame-based generic cell rate algorithm (F-GCRA) as a frame classifier, which determines whether an Am cell is eligible to use the guaranteed bandwidth in a frame level. An ATM switch accommodates cells in its buffer or drops them in a frame level according to current buffer occupancy. A FIFO shared buffer has so simple structure as to be feasibly implemented in switches, but has not been able to provide an MCR guarantee for each VC without buffer management based on per-VC accounting. In this paper, we enhance the F-GCRA frame classifier to guarantee an MCR of each VC without buffer management based on per-VC accounting. The enhanced frame classifier considers burstness of TCP traffic caused by congestion control algorithm so as to enable each VC to use its reserved bandwidth sufficiently. In addition, it is able to alleviate the unfairness problem in usage of the residual bandwidth. Simulation results show that the enhanced frame classifier satisfies quality of services (QoSs) of the GFR service for the TCP traffic.

• Journal of Korea Game Society
• /
• v.4 no.4
• /
• pp.11-18
• /
• 2004

The on-line games in the past were played by only two persons exchanging data based on one-to-one connections, whereas recent ones (e.g. MMORPG: Massively Multi-player Online Role-playings Game) enable tens of thousands of people to be connected simultaneously. Specifically, Korea has established an excellent network infrastructure that can't be found anywhere in the world. Almost every household has a high-speed Internet access. What made this possible was, in part, high density of population that has accelerated the formation of good Internet infrastructure. However, this rapid increase in the use of on-line games may lead to surging traffics exceeding the limited Internet communication capacity so that the connection to the games is unstable or the server fails. expanding the servers though this measure is very costly could solve this problem. To deal with this problem, the present study proposes the load distribution technology that connects in the form of local clustering the game servers divided by their contents used in each on-line game reduces the loads of specific servers using the load balancer, and enhances performance of sewer for their efficient operation. In this paper, a cluster system is proposed where each Game server in the system has different contents service and loads are distributed efficiently using the game server resource information such as CPU utilization. Game sewers having different contents are mutually connected and managed with a network file system to maintain information consistency required to support resource information updates, deletions, and additions. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 12%, 10% respectively.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.20-28
• /
• 2005

TCP(Transmission Control Protocol) is one of the most important Internet protocols, which is widely used in wireless networks as well as wired networks. However, when TCP is deployed for wireless networks, it takes severe performance degradation because TCP was designed for wired network. To overcome this drawback, a number of TCP variants have been proposed in the literature. However, most previous schemes did not consider TCP enhancement over heterogeneous networks. In heterogeneous networks, an mobile node (MN) may move from one access network to another(i.e., vertical handover). In the case of vertical handover, an MN experiences a TCP performance degradation caused by the packet loss and the sudden change of link characteristics between two different access networks. In this work, we investigate the TCP performance degradation occurred in vortical handover across heterogeneous networks. First, we have conducted the measurement study over GPRS-WLAN testbed. In the measurement study. we observed the TCP performance degradation in the case of handover from WLAN to GPRS. In order to study more different TCP behaviors during vertical handover, we performed comprehensive simulations using a network simulator 2(ns-2). Based on measurement and simulation results, we investigated how to improve TCP performance in vertical handover and we concluded that the existing mechanisms cannot be perfect solutions and new mechanisms are strongly required.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.997-1005
• /
• 2010

Recently, there has been a growing interest in the use of WLAN technology due to its easy deployment, flexibility and so on. Examples of WLAN applications range from standard internet services such as Web access to real-time services with strict latency/throughput requirements such as multimedia video and voice over IP on wireless network environments. Fair and efficient distribution of the traffic loads among APs(Access Points) has become an important issue for improved utilization of WLAN. This paper focuses on an AP selection scheme for achieving better load balance, and hence increasing network resource utilization for each user on wireless network environments. This scheme makes use of active scan patterns and the network delay as main parameters of load measurement and AP selection. This scheme attempts to estimate the AP traffic loads by observing the up/down delay and utilize the results to maximize the link resource efficiency through load balancing. We compared the proposed scheme with the original SNR(Signal to Noise Ratio)-based scheme using the NS-2(Network Simulation.2). We found that the proposed scheme improves the throughput by 12.5% and lower the network up/down link delay by 36.84% and 60.42%, respectively. All in all, the new scheme can significantly increase overall network throughput and reduce up/down delay while providing excellent quality for voice and video services.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.4
• /
• pp.811-817
• /
• 2009

The rapid growth of network based IT systems has resulted in continuous research of security issues. Probe intrusion detection is an area of increasing concerns in the internet community. Recently, a number of probe intrusion detection schemes have been proposed based on various technologies. However, the techniques, which have been applied in many systems, are useful only for the existing patterns of probe intrusion. They can not detect new patterns of probe intrusion. Therefore, it is necessary to develop a new Probe Intrusion Detection technology that can find new patterns of probe intrusion. In this paper, we proposed a new network based probe intrusion detector(NePID) using anomaly traffic analysis and fuzzy cognitive maps that can detect intrusion by the denial of services attack detection method utilizing the packet analyses. The probe intrusion detection using fuzzy cognitive maps capture and analyze the packet information to detect syn flooding attack. Using the result of the analysis of decision module, which adopts the fuzzy cognitive maps, the decision module measures the degree of risk of denial of service attack and trains the response module to deal with attacks. For the performance evaluation, the "IDS Evaluation Data Set" created by MIT was used. From the simulation we obtained the max-average true positive rate of 97.094% and the max-average false negative rate of 2.936%. The true positive error rate of the NePID is similar to that of Bernhard's true positive error rate.