• Journal of Information Processing Systems
• /
• 제20권1호
• /
• pp.131-147
• /
• 2024

A routing strategy based on traffic prediction and dynamic cache allocation for satellite nodes is proposed to address the issues of high propagation delay and overall delay of inter-satellite and satellite-to-ground links in low Earth orbit (LEO) satellite systems. The spatial and temporal correlations of satellite network traffic were analyzed, and the relevant traffic through the target satellite was extracted as raw input for traffic prediction. An improved gradient boosting regression tree algorithm was used for traffic prediction. Based on the traffic prediction results, a dynamic cache allocation routing strategy is proposed. The satellite nodes periodically monitor the traffic load on inter-satellite links (ISLs) and dynamically allocate cache resources for each ISL with neighboring nodes. Simulation results demonstrate that the proposed routing strategy effectively reduces packet loss rate and average end-to-end delay and improves the distribution of services across the entire network.

• 인터넷정보학회논문지
• /
• 제13권2호
• /
• pp.33-40
• /
• 2012

최근 네트워크간의 통합으로 인하여 네트워크 통합 관리 시스템 중 하나인 IMS (IP Multimedia Subsystem)의 사용이 증가하고, 이로 인해 네트워크 트래픽이 증가하고 있다. 따라서 IMS에서의 자원을 효율적으로 관리하기 위하여 네크워크 관리 시스템의 기능이 점차 커지고 있다. 특히 IMS 노드에 트래픽은 유동적이기 때문에 이것을 효과적으로 관리하기 위해서는 적절한 동적 라우팅 구조가 필요하다. 따라서 본 논문에서는 IMS 노드간의 트래픽을 제어하기위한 동적 알고리즘 구조를 제안하고, IMS의 대표적인 응용서비스인 Presence Service와 PoC (Push to talk over Cellular)를 이용하여 본 알고리즘의 성능을 측정한다.

• 디지털콘텐츠학회 논문지
• /
• 제18권6호
• /
• pp.1207-1211
• /
• 2017

LR-PON은 수동형 광가입자망 기술을 사용하여 서비스 영역이 100 km이상 확장된 광대역 가입자망이다. 서비스 영역이 확장된 LR-PON의 경우 OLT와 ONU들간 전송 지연시간이 큰 폭으로 증가하는 문제점으로 인해 효과적인 상향 대역할당에 어려움이 있다. 본 논문에서는 LR-PON망에서 동적인 상향 대역 할당을 효과적이며 공정하게 하기 위해서, 고정형 폴링 주기를 갖는 다중 스레드 기반의 새로운 동적대역할당 방안을 제안한다. 제시한 동적대역할당 방안의 우수성을 입증하기 위하여 상향 트래픽의 평균 지연시간을 기존의 DBA 방안들과 비교하였다. 특히, CoS 특성 분석을 위하여 다양한 트래픽 로드별로 지연 특성을 분석하였다.

• 한국통신학회논문지
• /
• 제31권9B호
• /
• pp.792-802
• /
• 2006

In this paper, we propose an energy-efficient proactive data dissemination protocol with relatively low delay to cope well with highly mobile sink environments in sensor networks. In order for a dissemination tree to continuously pursue a dynamic sink, we exploit two novel algorithms: forward sink advertisement and distributed fast recovery. In our protocol, the tree is shared with the other slave sinks so that we call it Dynamic Shared Tree (DST) protocol. DST can conserve considerable amount of energy despite maintaining robust connection from all sources to sinks, since tree maintenance of DST is accomplished by just distributed local exchanges. In addition, since the DST is a kindof sink-oriented tree, each source on the DST disseminates data with lower delay along the tree and it also facilitates in-network processing. Through simulations, it is shown that the presented DST is considerably energy-efficient, robust protocol with low delay compared to Directed Diffusion, TTDD, and SEAD, in highly mobile sink environment.

• 한국도로학회논문집
• /
• 제14권4호
• /
• pp.163-173
• /
• 2012

PURPOSES : The purpose of this study is to check the possibilities of traffic pattern analysis using MatSIM for urban road network operation in incident case. METHODS : One of the stochastic dynamic models is MatSIM. MatSIM is a transportation simulation tool based on stochastic dynamic model and activity based model. It is an open source software developed by IVT, ETH zurich, Switzerland. In MatSIM, various scenario comparison analyses are possible and analyses results are expressed using the visualizer which shows individual vehicle movements and traffic patterns. In this study, trip distribution in 24-hour, traffic volume, and travel speed using MatSIM are similar to those of measured values. Therefore, results of MatSIM are reasonable comparing with measured values. Traffic patterns are changed according to incident from change of individual behavior. RESULTS : The simulation results and the actual measured values are similar. The simulation results show reasonable ranges which can be used for traffic pattern analysis. CONCLUSIONS : The change of traffic pattern including trip distribution, traffic volumes and speeds according to various incident scenarios can be used for traffic control policy decision to provide effective operation of urban road network.

• 정보처리학회논문지C
• /
• 제12C권1호
• /
• pp.111-120
• /
• 2005

이동 애드-혹 네트워크는 물리적 위치 이동이 가능한 노트들에 의해 자체적으로 형성되는 시스템으로 동적 위상을 고려한 라우팅 프로토콜을 필요로 한다 본 논문에서는 IETT의 라우팅 프로토콜 DSR을 확장한 R-DSR이라 불리는 온-디멘드 다중경로 프로토콜을 제안한다. 제안된 프로토콜에서는 DSR에 의해 구축되는 단인 경로 상의 2-홉 간격의 모든 노드들에 대해 별도의 노드론 경유하는 추가 경로가 연결된다. 수학적 분석을 통하여 DSR 관련 연구 중 가장 대표적인 방법 중의 하나인 Das의 다중경로 프로토콜보다 더 높은 메시지 전달 확률을 제공함을 보였다.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2001년도 기술교육위원회 창립총회 및 학술대회 의료기기전시회
• /
• pp.23-27
• /
• 2001

Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

• 한국지능시스템학회논문지
• /
• 제11권5호
• /
• pp.367-372
• /
• 2001

본 논문은 미시공간에서 다수의 로봇들의 자율 이동에 대해 계층적 구조를 가진 퍼지-뉴럴 알고리즘을 제안한다. 이 계층적 알고리즘은 그 하부에 로봇이 목표에 도달하게 하며 주는 퍼지 알고리즘과 주행 중 만날 수 있는 장애물들에 대한 회피를 수행하는 퍼지-뉴럴 알고리즘이 존재하고 상부의 가중치 퍼지 알고리즘은 위의 두 알고리즘에 의한 로봇의 회전각도 와 이동 거리를 합성하여 주위 환경에 대하여 로봇이 지능적인 주행을 수행한 누 있도록 구성되어 있으며 시뮬레이션을 통하여 만족할 만한 결과를 얻을 수 있었다.

• 디지털산업정보학회논문지
• /
• 제10권3호
• /
• pp.35-40
• /
• 2014

Many researches have been conducted to achieve improvement in distributed system that connects multiple computer systems via communication lines. Among others, the load balancing and file migration are considered to have significant impact on the performance of distributed system. The dynamic file migration algorithm common in distributed processing system involved complex calculations of decision function necessary for file migration and required migration of control messages for the performance of decision function. However, the performance of this decision function puts significant computational strain on computer. As one single network is shared by all computers, more computers connected to network means migration of more control messages from file migration, causing the network to trigger bottleneck in distributed processing system. Therefore, it has become imperative to carry out the research that aims to reduce the number of control messages that will be migrated. In this study, the learning automata was used for file migration which would requires only the file reference-related information to determine whether file migration has been made or determine the time and site of file migration, depending on the file conditions, thus reflecting the status of current system well and eliminating the message transfer and additional calculation overhead for file migration. Moreover, mathematical model for file migration was described in order to verify the proposed model. The results from mathematical model and simulation model suggest that the proposed model is well-suited to the distributed system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.421-433
• /
• 2015

Recently, there have been fast-growing social network services based on the Internet environment and web technology development, the prevalence of smartphones, etc. Social networks also allow the users to convey the information and news so that they have a great influence on the public opinion formed by social interaction among users as well as the spread of information. On the other hand, these social networks also serve as perfect environments for rampant malware. Malware is rapidly being spread because relationships are formed on trust among the users. In this paper, an effective patch strategy is proposed to deal with malicious worms based on social networks. A graph is formed to analyze the structure of a social network, and subgroups are formed in the graph for the distributed patch strategy. The weighted directions and activities between the nodes are taken into account to select reliable key nodes from the generated subgroups, and the Incremental PageRanking algorithm reflecting dynamic social network features (addition/deletion of users and links) is used for deriving the high influential key nodes. With the patch based on the derived key nodes, the proposed method can prevent worms from spreading over social networks.