• 한국통신학회논문지
• /
• 제30권5B호
• /
• pp.304-309
• /
• 2005

본 논문에서는 TD(temporal differences) 기법을 사용한 localized QoS 라우팅 기법을 제안하였다. 이 기법은 이웃노드로부터 얻어지는 성공 기댓값을 통해 라우팅 정책을 결정하는 기법이다. 이에 본 논문에서는 라우팅 성공 기댓값을 기반으로 한 다양한 탐색기법으로 경로 선택 시 라우팅 성능을 비교 평가하였으며, 특히 Exploration Bonus를 적용한 탐색 기법이 다른 탐색 기법에 비해 더욱 우수한 성능을 보여주고 있는데, 이는 다른 탐색 기법에 비해 네트워크 상황에 더 적응적으로 경로를 선택할 수 있기 때문이다.

• 전자공학회논문지B
• /
• 제29B권10호
• /
• pp.10-18
• /
• 1992

This paper considers and implementation of the memory system which provides simultaneous access to pq image points of block(p$\times$q), horizontal vector(1$\times$pq)and/vertical vector(pq$\times$1) in 2-dimension image array, where p and q are design parameters. This memory system consists of an address calculation circuit, address routing circuit, data routing circuit, module selection circuit and m memory modules where m>qp. The address calculation circuit computes pq addresses in parallel by using the difference of addresses among image points. Extra module assignment circuit is not used by improving module selection circuit with routhing circuit. By using Verilog-XL logic simulator, we verify the correctness of the memory system and estimate the performance. The implemented system provides simultaneous access to 16 image points and is 6 times faster than conventional memory system.

• 자동차안전학회지
• /
• 제7권1호
• /
• pp.13-19
• /
• 2015

Recently, Child safety has become one of the issue with Q10 dummy representing large child. The objective of this paper was to evaluate performance of three child restraints system (backless booster, high-back booster and without booster) by changing D-ring location in the rear seat. Sled tests were carried out with a Q 10 in 64km/h frontal impact. Before the dynamic sled tests, we assessed dummy positioning with difference in CRS types and height adjustment positions. Dynamic sled test results indicated that there is different performance of CRS types and belt routing. These test results will use as base line data for development CRS safety performance for Q 10.

• 한국농공학회지
• /
• 제18권1호
• /
• pp.4079-4086
• /
• 1976

In many reservoir projects, economic considerations will necessitate a design utilizing surcharge. Determination of the most economical combination of surcharge and spillway capacity for a given spillway crest level will require flood routing studies and economic studies of the dam-reservoir-spillway combinations. Many methods of actual flood routing have been devised, each of them with its advantages and disadvantages. Some of these methods are listed below: (1) Arithmetical trial-and-error method. (2) Modified Puls' method (3) Cheng's graphical method (4) Horton's arithmetical method (5) Ekadahl's arithmetical method (6) Digital computer programming. For the purpose of preliminary design and cost estimating of dams and spillways, it is often required to estimate, for a given design flood and spillway crest level. the approximate values of two among the three characteristics of the spillway spillway length, maximum discharge and surcharge depth at maximum discharge, when one of these quantities is given. As is well known, the outflow hydrograph for an ungated overflow spillway assumes the form of a wave-shaped curve with a minimum point for Q=o At zero time and a maximum point for Q=Qmax at its intersection with the falling leg of the inflow hydrograph (see Fig. 4) The shaded area between the inflow and outflow hydrographs represents at the approximate scale the temporary retention Vt. In line with the remarks, draw by free hand the assumed outflow hydrograph with its maximum point for the given Qmax (see Fig. 4) and by planimetration find Vt. From the reservoir capacity curve (Fig. 3) find Vs for the given spillway crest level and make V=Vs+Vt. From the above curve find surcharge water elevation for V and surcharge depth Hmax over spillway crest. From the discharge formula compute {{{{L= { Q} over { { CH}^{3/2 } } }}}} The methed provides a means for a quick and fairly accurate estimation of spillway capacity.

• 한국통신학회논문지
• /
• 제36권11B호
• /
• pp.1269-1276
• /
• 2011

Proxy Mobile IPv6 (PMIPv6) 프로토콜에서는 단말간 통신 시에 모든 데이터 패킷이 Local Mobility Anchor (LMA)를 거쳐 전달되어 통신단말이 모두 동일 망에 위치한 경우 데이터 패킷이 최적화되지 않은 경로를 사용함으로 인해 성능이 저하된다. 본 논문에서는 Binding Query를 활용한 PMIPv6의 경로최적화 기법을 제안한다. 제안되는 Query-based PMIPv6 (Q-PMIPv6) 기법에서 Correspondent Node (CN)의 Mobile Access Gateway (MAG)는 Mobile Node (MN)의 Proxy Care-of-Address를 획득하기 위하여 LMA로 Binding Query를 보내고, 이후에 CN과 MN는 최적화된 경로를 이용하여 데이터 전송을 수행한다. 성능분석을 위해 제안하는 Q-PMIPv6 기법과 기존의 PMIPv6 및 PMIPv6 Localized Routing (PMIPv6-LR) 기법을 이론적인 수치 분석 및 ns-2 시뮬레이션을 통해 비교하였다. 비교 분석 결과, 제안하는 Q-PMIPv6 기법이 시그널링 비용 및 데이터 전달 비용 측면에 서 기존 PMIPv6 및 PMIPv6-LR 기법에 비해 우수함을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권11호
• /
• pp.4244-4274
• /
• 2021

The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.

• 전자공학회논문지S
• /
• 제34S권12호
• /
• pp.1-9
• /
• 1997

The signaling protocol for B-ISDN should support variety of services including point-to-pont single-connection call, point-to-point multi-connection call and point-to-multipoint connection call. an efficient signaling protocol for point-to-point multi-connection call based on ITU-T Recommendation Q.298X is presented in this paper. Sequential establishment of madatory and optional connections and common routing scheme for synchronization, along with separation of information elements for establishement of multi-connection call are included in the proposed signaling protocol. Limited network resources can be used more efficiently by proposed sequential establishement of mandartory and optional connection for point-to-point multi-connection call which can provide multimedia services. And common routing can be provided effectively by proposed common routing scheme for connectios requiring synchronization like as video-phone and video-conference.

• 대한전자공학회논문지
• /
• 제26권5호
• /
• pp.117-126
• /
• 1989

본 논문에서는 게이트 어레이 방식의 레이아웃 설계를 위한 새로운 배치 알고리듬을 제안한다. 제안된 배치 알고리듬은 서로 크기가 다른 마크로셀을 처리할 수 있으며, I/Q pad의 위치를 고려함으로써 칩의 내부 영역과 I/Q pad간의 배선을 효율적으로 자동화한다. 알고리듬은 초기 분할, 초기 배치 개선의 3단계로 구성된다. 초기 분할 단계에서는 각 I/Q pad의 위치를 고려하여 clustering에 의해 전체 회로를 5그룹으로 분할한다. 초기 배치 단계에서는 각 I/Q pad 및 주변 그룹과의 연결도를 고려한 clustering/min-cut 분할에 의해 각 셀의 위치를 할당한다. 또한, 배치 개선에서는 확률적 배선 밀도 함수를 도입하여 칩내의 배선 밀도를 균일화하기 위한 셀 이동 알고리듬을 제안한다.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.499-510
• /
• 2007

Shortest path tree(SPT) construction is essential in high performance routing in an interior network using link state protocols. When some links have new state values, SPTs may be rebuilt, but the total rebuilding of the SPT in a static way for a large computer network is not only computationally expensive, unnecessary modifications can cause routing table instability. This paper presents a new update algorithm, dynamic shortest path tree(DSPT) that is computationally economical and that maintains the unmodified nodes mostly from an old SPT to a new SPT. The proposed algorithm reduces redundancy using a dynamic update approach where an edge becomes the significant edge when it is extracted from a built edge list Q. The average number of significant edges are identified through probability analysis based on an arbitrary tree structure. An update derived from significant edges is more efficient because the DSPT algorithm neglect most other redundant edges that do not participate in the construction of a new SPT. Our complexity analysis and experimental results show that DSPT is faster than other known methods. It can also be extended to solve the SPT updating problem in a graph with negative weight edges.

• ETRI Journal
• /
• 제14권3호
• /
• pp.1-15
• /
• 1992

Stand-slone 신호 중계 교환기인 SMX-1(Signalling Message eXchange No.1)은 통신망의 신경계인 공통선 신호망(Common Channel Signalling Network)의 하부 구조를 구성하는 시스팀이다. SMX-1에 총괄명 번역서비스를 수용하게 되면 통신망 사용자에게 통신망 내부의 구성 및 구성 요소의 변화에 구속되지 않고 지속적인 지능망 서비스를 제공할 수 있게 된다. 본 연구에서는 SMX-1의 설계 이념에 부합되도록 신호연결 제어부의 기능을 소프트웨어 및 하드웨어적으로 분산화하여 설계, 구현함으로써 SMX-1의 고신뢰성 및 신속성을 추구하였다. 소프트웨어적으로는 총괄명번역 서비스 제공을 위해 국제 전신 전화 자문 회의(CCITT)권고 Q.711-Q.714에서 정의하고 있는 신호연결 제어부(SCCP:Signalling Connection Control Part)의 기능을 관리 기능(SCMG : SCCP Management Part)과 루팅 제어 기능(SCRC : SCCP Routing Control Part)으로 분리하여 각각의 기능을 이중화하여 설계, 구현하였다. 하드웨어적으로는 관리 기능을 하나의 보드로 집중화하고 루팅 제어 기능을 여러개의 보드로 분산화하였다. 분산되어 있는 루팅 제어기능이 총괄명번역 서비스를 수행하기 위하여 사용하는 루팅 제어 데이터의 일치성을 유지하기 위하여, 관리 기능에 루팅 제어 데이터를 총괄적으로 관리하는 루팅 제어 데이터 관리 기능(RCDMFB : Routing Control Data Management Function Block)과 운용 관리 기능 (OMS : Operation and Management Subsystem)의 제원관리 지원기능을 구현하였다.