• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.558-560
• /
• 2000

일 대 다수의 정보를 전송하는데 있어서 멀티캐스트는 네트웍의 자원을 절약할 수 있고 송신자의 부하를 감소시킬 수 있는 등 여러 가지 장점을 제공한다. 그러나, 그것을 효율적으로 실현시키기 위한 확장성 문제와 더불어 혼잡 제어를 통한 기존 인터넷 트래픽과의 공존성 문제를 주의 깊게 다루어야 한다. 본 논문에서는 지정된 서버(Designated Server)를 이용하여 혼잡 제어 방식에 있어서 기존 인터넷 트래픽과 자원을 공평하게 나누어 사용하며, 멀티캐스트 특성상 나타날 수 있는 수신자들의 불공정성 문제를 해결함으로써 보다 효율적인 정보전송이 이루어지도록 하였다.

• Review of KIISC
• /
• v.14 no.2
• /
• pp.89-99
• /
• 2004

은닉채널에 관한 연구는 1980년대 이전부터 진행되어 왔으며, 최근에는 멀티미디어 데이터에 대한 스테가노그래피에 대한 관심이 집중되고 있다. 하지만, 본 논문에서는 현재 스테가노그래피나 정보은닉에서 다루는 동영상 데이터에 대한 은닉채널이 아닌, 인터넷 환경의 근간을 이루는 TCP/IP 네트워크 트래픽에 존재하는 은닉채널에 대한 연구를 수행하였다. 먼저 은닉채널 개념 및 기존 연구동향을 분석하였으며, 그 후 TCP/IP를 구성하는 각 프로토콜에 생성 가능한 은닉채널을 분석하여 향후 연구 방향을 제시하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.106-108
• /
• 2001

월드 와이드 웹은 인터넷을 이용한 정보 교환의 대표적 수단이지만 유명 웹 서버의 경우에는 웹 클라이언트들의 요청이 폭주하여 병목현상이 생기고 이로 인한 사용자 측면의 서비스 지연은 심각한 수준이다. 이에 대한 현실적인 대안으로 인터넷상의 중요 위치에 웹 문서의 복사본을 두어 웹 서버의 부담을 줄이고, 동시에 사용자에 대한 응답시간을 개선하는 웹 캐쉬가 대두되었다. 본 논문에서는 전세계적인 웹 캐쉬 프로젝트인 NLANR(National Laboratory for Applied Network Research)의 최상위 캐쉬들로부터 생성된 로그를 이용하여 웹 캐쉬 트래픽의 특성들에 관해 정리하고 이들을 분석하여 웹 캐쉬에서의 응답시간 개선 방향을 제시하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.499-501
• /
• 2001

호스트의 이동성을 지원하기 위한 프로토콜인 Mobile IP는 기본적으로 각각의 이동 노드가 하나의 홈 주소를 이용하여 인터넷상의 임의의 다른 위치에 접속하여 IP 주소를 변경하지 않고 인터넷을 사용할 수 있도록 한다. 본 논문에서는 컴퓨터 시뮬레이션을 통해 smooth 핸드오프를 이용한 mobile IP의 성능을 분석한다. 일반적으로 데이터 트래픽, 바인딩 갱신시간, 버퍼관리 방법 등은 핸드오프 동안 mobile IP의 성능에 많은 영향을 비친다. 따라서 시뮬레이션 모델을 이용하여 다양한 트래픽 환경에서 위에 언급된 성능 파라미터들의 영향을 분석한다.

• Journal of Korean Society of Transportation
• /
• v.33 no.1
• /
• pp.14-28
• /
• 2015

Numerous research has been conducted using internet search data since the mid-2000s. For example, Google Inc. developed a service predicting influenza patterns using the internet search data. The main objective of this study is to prove the hypothesis that highway traffic indices are similar to the internet search patterns. In order to achieve this objective, a model to predict the number of vehicles entering the expressway and space-mean speed was developed and the goodness-of-fit of the model was assessed. The results revealed several findings. First, it was shown that the Google search traffic was a good predictor for the TCS entering traffic volume model at sites with frequent commute trips, and it had a negative correlation with the TCS entering traffic volume. Second, the Naver search traffic was utilized for the TCS entering traffic volume model at sites with numerous recreational trips, and it was positively correlated with the TCS entering traffic volume. Third, it was uncovered that the VDS speed had a negative relationship with the search traffic on the time series diagram. Lastly, it was concluded that the transfer function noise time series model showed the better goodness-of-fit compared to the other time series model. It is expected that "Big Data" from the internet search data can be extensively applied in the transportation field if the sources of search traffic, time difference and aggregation units are explored in the follow-up studies.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.124-126
• /
• 2001

GPRS/UMTS 망에서 터널링 프로토콜인 GTP(GPRS Tunneling Protocol)는 QoS를 고려하지 않는 단순한 GSN(GTP Support Node)의 터널링 기법이 적용되고 있다. 즉 모든 트래픽에 대해서 동일만 터널링 기법이 적용되고 있으므로 피부 망에서 입력되는 트래픽에 대한 QoS를 보장하기가 어렵다. 따라서, QoS 제어가 가능한 인터넷 망(RSVF, Diffserv)과 연동(interwotking)이 가능하면서 외부 망의 트래픽을 GPRS 망에 받아들여 효율적으로 처리할 수 있는 GGSN 노드의 트래픽 QoS 제어 메커니즘에 대해 이 연구되어져야 한다. 본 논문에서는 GPRS/UMTS망에서 클래스별 패킷 트래픽 처리의 성능향상을 위해서 망의 게이트웨이 역할을 담당하는 GGSN에서 I)iffserv edge function을 할 경우에 실시간 트래픽의 QoS보장을 위한 클래스별 트래픽 제어 방법에 대해 분석하였다.

• Journal of Internet Computing and Services
• /
• v.4 no.2
• /
• pp.1-9
• /
• 2003

Path restoration, which is needed to increase network survivability in MPLS networks, is a technology of supplying reliable service by delivering the traffics through restoring the paths when links or nodes of a working path are failed. In this paper, we propose a path restoration method using duplication of working paths for link failure as a method of restoring paths for the high priority traffics. The existing path restoration method transmits the traffics to the path restoration uniformly in regardless of the priority while link obstacle. It has a problem to take a long time to restore the connection of the high priority traffics. On the other hand, the suggested restoration method establishes the duplication path for the working path, which transmits the high priority traffics and transmit the traffics through the duplication path. It has a strong point to restore the connection quickly. Also, through simulation we analyze the performance of the restoration system using the duplication path and prove that the proposed restoration method is superior in performance to the existing restoration methods regarding to the high priority traffics.

• Journal of KIISE
• /
• v.41 no.9
• /
• pp.617-624
• /
• 2014

Malicious traffic, such as DDoS attack and botnet communications, refers to traffic that is generated for the purpose of disturbing internet networks or harming certain networks, servers, or hosts. As malicious traffic has been constantly evolving in terms of both quality and quantity, there have been many researches fighting against it. In this paper, we propose an effective malicious traffic detection method that exploits the X-means clustering algorithm. We also suggest how to analyze statistical characteristics of malicious traffic and to define metrics that are used when clustering. Finally, we verify effectiveness of our method by experiments with two released traffic data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.325-338
• /
• 2004

As the recent rapid development of internet technology and the wide spread of multimedia communication, massive increase of network traffic causes some problems such as the lack of network paths and the bad quality of service. To resolve these problems, this paper presents a traffic control agent that can perform the dynamic resource allocation by controlling traffic flows on a DiffServ network. In addition, this paper presents a router that can support DiffServ on Linux to support selective QoS in IP network environment. To implement a method for selective traffic transmission based on priority on a DiffServ router, this paper changes the queuing discipline in Linux, and presents the traffic control agent so that it can efficiently control routers, efficiently allocates network resources according to service requests, and relocate resources in response to state changes of the network. Particularly for the efficient processing of Assured Forwarding(AF) Per Hop Behavior(PHB), this paper proposes an ACWF$^2$Q$^{+}$ packet scheduler on a DiffServ router to enhance the throughput of packet transmission and the fairness of traffic services.s.

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

As recent fusion industry and ubiquitous technology have grown fast, network contents, which require high load, are provided in various infrastructures and facilities such as u-city and smart phones. Therefore, it is anticipated that the playback quality of multimedia compared to network loads degrades dramatically due to the drastic increment of real-time reference of conventional high load contents (eg. multimedia data). In this paper, we improved the method of the traffic assignment based on MPP which elevated the playback quality of multimedia by assigning discriminately the possible traffic of MMS with TP coefficients. When the TP coefficient which combines content preference with media preference was applied to a real-time traffic assignment scheduler, the simulation results showed that the multimedia playback stream was assigned within the possible traffic of a server. The real-time scheduling algorithm was improved by using the TP coefficient that combines the time-dependent image contents and the weighted value of media preference. It was observed from the experiment that the loss of the possible traffic decreases to 3.91% and 3.88% for three and four clients respectively.