• Journal of Korean Society of Transportation
• /
• v.17 no.2
• /
• pp.127-135
• /
• 1999

Most existing progression bandwidth models maximize the single or multi weighted sum of bandwidths in the both directions to improve traffic mobility on an arterial, but they cannot be applied to general networks. Even though a few models formulating a looped network problem cannot be applied to networks have not loops. Also they have some defects in optimizing phase sequences. Therefore, the objective of this study is to develope a mathematical formulation of the synchronization problem for a general traffic network. The goal is achieved successfully by introducing the signal phasing for each movement and expanding the mixed integer linear programming of MAXBAND. The experiments indicate that the proposed model can formulate the general traffic network problem mere efficiently than any other model. In conclusion, this model may optimize signal time to smooth progression in the general networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.273-275
• /
• 1998

최근 무선통신의 대중화가 증가함에 따라 이동 컴퓨팅 환경에 대한 관심이 나날이높아가고 있지만 무선망의 특징을 고려한 프로토콜의 개발은 미흡한 상태이다. 유선망에서 널리 통용되고 있는 TCP는 packet 손실의 원인을 혼잡(congestion)에 의한 것으로 간주하여 혼합제어(congestion control)나 회피(avoidance)메카니즘을 이용하여 packet 의 회복 (recovery)에 적절히 대응하고 있다. 하지만 무슨망에서의 packet 손실은 handoff나 높은 bit 에러율에 의한 것으므로 기존의 TCP를 그대로 적용하게 되면 불필요한 메카니즘 호출로 인한 throughput의 저하를 가져오게 된다. 이런 성능 저하를 해결하기 위하여 무선망에 적합하도록 TCP를 개선하는 움직임이 세계적으로 일어나고 있으며, 이를 크게 단대한 프로토콜, split-connection 프로토콜, 링크 계층 프로토콜로 나눌 수 있다. 본 논문은 이러한 흐름의 여러 가지 대표적인 프로토콜들을 비교.분석하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12B
• /
• pp.1656-1664
• /
• 2001

When a packet loss occurs in a communication network operating a TCP protocol, the TCP protocol regards it that the loss has resulted from network congestion. Then the TCP protocol performs congestion control. When it is applied to the wireless network having quite a high BER characteristics, the performance of TCP protocol is degraded very much. In this paper, we propose an Explicit Error Notification(EEN) algorithm to improve the performance of the wireless TCP When a packet loss occurs in the wireless network, the TCP receiver decodes the TCP segment sequence number and the address of the TCP sender and receiver, and then informs the TCP sender of the error in wireless network by sending a NACK. It is to distinguish packets in error from losses of network congestion. In this paper, the performance of the proposed EEN algorithm is analyzed and simulated. In fact, as more errors are corrected, the proposed algorithm shows a larger improvements in performance.

• Journal of the Korea Convergence Society
• /
• v.13 no.1
• /
• pp.51-62
• /
• 2022

AI-based speed prediction studies have been conducted quite actively. However, while the importance of explainable AI is emerging, the study of interpreting and reasoning the AI-based speed predictions has not been carried out much. Therefore, in this paper, 'Explainable Deep Graph Neural Network (GNN)' is devised to analyze the speed prediction and assess the nearby road influence for reasoning the critical contributions to a given road situation. The model's output was explained by comparing the differences in output before and after masking the input values of the GNN model. Using TOPIS traffic speed data, we applied our GNN models for the major congested roads in Seoul. We verified our approach through a traffic flow simulation by adjusting the most influential nearby roads' speed and observing the congestion's relief on the road of interest accordingly. This is meaningful in that our approach can be applied to the transportation network and traffic flow can be improved by controlling specific nearby roads based on the inference results.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.1209-1212
• /
• 2003

오늘날 인터넷 환경에서의 망은 유무선의 환경이 통합된 하나의 망으로 달수 있다. 일반적인 TCP에서는 무선망에서의 핸드오프나 비트오류 등으로 인한 패킷 손실이 발생하는 경우에도 흔잡제어 알고리즘으로 손실된 패킷을 복구하게 되며 이러한 복구는 혼잡윈도우를 줄이게 됨으로 인해 현저히 TCP의 처리량을 감소시키게 된다. 본 논문에서는 유무선이 통합된 망에서 데이터 전송 효율을 높일 수 있는 알고리즘을 제시하고자 한다. 이 알고리즘에서는 홈서버를 사용하여 무선망에서 발생한 패킷 손실이 종단간의 재전송이 아닌 홈서버에서 지역 재전송을 함으로써 유무선망의 부하를 줄이고 흔잡제어 알고리즘이 실행되는 것을 방지하여 TCP의 성능향상을 가져올 수 있으며 캐쉬메모리에 재전송 패킷을 보관하여 재전송함으로써 보다 빠른 재전송효과를 얻을 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7A
• /
• pp.700-709
• /
• 2007

The heterogeneous wireless access networks has been envisioned to characterize the future wireless networks. In such environments, TCP(Transmission Control Protocol) has to experience poor end-to-end performance because bandwidth and link delay change suddenly when a mobile node moves over different types of wireless networks, which is called vertical handoff. In this paper, we propose a new TCP which maintains each set of congestion control variables, which we call TCP context, for each type of wireless network. The proposed TCP can switch the TCP context against vertical handoff in order to adjust quickly to a newly arrived network. In simulations, the proposed TCP has higher throughput than TCP SACK(Selective Acknowledgment Options) due to its great features to vertical handoff situations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.100-102
• /
• 2002

네트워크 기술의 급속한 발달로 인해 최근 무선 Ad-hoc 통신망에 관한 연구가 활발하게 진행되어 오고 있다. Ad-hoc망은 기존의 유선망에서와는 다르게 중앙 집중화된 관리를 필요로 하지 않고 지리적으로 분산된 각 노드들이 역동적으로 위치를 변경하며 라우터의 역할을 수행하여 단대단 정보전송 서비스를 제공한다. 그러나 제한된 통신 자원으로 인한 낮은 대역폭과 높은 전송 오류를 포함하고 있으며, 한정된 대역과 단말기능에 있어서의 제약으로 현재의 인터넷 라우팅 프로토콜들을 그대로 사용하기 어렵다. 현재 사용되고 있는Ad-hoc 네트워크에서의 라우팅 프로토콜은 네트워크 토폴로지가 변화해야만 새로운 경로를설정하도록 되어 있어 이동성이 낮은 환경에서의 트래픽 집중화 현상과 경로 설정을 위한 반복적 검색으로 서비스 효율이 떨어지는 문제점을 가지고 있다. 따라서 본 논문에서는 다중 이웃 노드 테이블을 별도 관리하고 혼잡 상황시 자노드 중계 차단을 수행하여 효율적으로 부하균등을 제어하는 라우팅 기법을 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.1-7
• /
• 2010

In this paper, a high-performance fault-tolerant switching network using a deflection self-routing was proposed. From an abstract algebraic analysis of the topological properties of the Delta network, which is a baseline switching network, we derive the Multidimensional Ring-Delta network: a multipath switching network using a deflection self-routing algorithm. All of the links including already existing links of the Delta network are used to provide the alternate paths detouring faulty/congested links. We ran a simulation analysis under the traffic loads having the non-uniform address distributions that are usual in Internet. The throughput of $1024\;{\times}\;1024$ switching network proposed is better than that of the 2D ring-Banyan network by 13.3 %, when the input traffic load is 1.0 and the hot ratio is 0.9. The reliability of $64\;{\times}\;64$ switching network proposed is better than that of the 2D ring-Banyan network by 46.6%.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.33-40
• /
• 2008

Streaming video has become a popular form of transferring media over the wired/wireless network. TCP-friendly rate control (TFRC) is used as a streaming media transport protocol. Using the TCP congestion response function and current network conditions, TFRC adjusts its sending rate to yield the maximum TCP-friendly throughput. Since TFRC was designed for applications that would prefer to maintain a slowly-changing sending rate, it is less responsive to changes in handover between wireless heterogeneous networks such as 3G network, WLAN, and so on. This paper shows a new TFRC method for vertical handover over wireless heterogeneous network. The proposed TFRC method has features of low quality interruption and fast rate adaptation to a new target network. The simulation results show that the proposed one provides better QoS and throughput support than the traditional TFRC scheme during vertical handover.

• Journal of Korean Society of Transportation
• /
• v.27 no.6
• /
• pp.167-176
• /
• 2009

Several travel demand management schemes have been used for controlling overloaded traffics on urban area. To maximize efficiency of the travel management, traffic manager has to set target level that we try to arrive in advance, and then to find optimal variable to attain this goal. In this regard, this paper presents two travel demand management models, expressed by mathematical program, and also presents their solution algorithms. The first is to find optimal travel demand for origin-destination (OD) pair, based on average travel time between the OD pair, and the second is based on the ratio of volume over capacity on congested area. An example is given to test the models.