• Title/Summary/Keyword: 네트워크 구간

Search Result 505, Processing Time 0.026 seconds

A Study on Designing Method of Framework for NGN QoS Management (NGN 운용과정의 QoS 관리를 위한 프레임워크 설계방법)

  • Noh, Si-Choon;Bang, Kee-Chun
    • Journal of Digital Contents Society
    • /
    • v.9 no.1
    • /
    • pp.101-107
    • /
    • 2008
  • The level of transference of NGN is beginning as the operation of Access Gateway in korea at present, but NGN will keep developing continuously to the NGN integrated network until 2010. This research is finding the meaning and assignment of NGN QoS to deduct how to manage the control system and presenting the QoS control process and trial framework. The trial framework is the modeling of the QoS measurement metrics, the measurement time schedule, the section, hierarchy, instrument, equipment and method of measurement and the series of cycle & the methodology about analysis of the result of measurement. The objective standard of quality in communication service is guaranteed not by itself but by controlling and measuring continuously. Especially it's very important time to maintain the research about NGN QoS measurement and control because the big conversion of new network technology paradigm is now spreading.

  • PDF

The Development of A Dynamic Traffic Assignment Technique using the Cell Transmission Theory (Cell Transmission 이론을 이용한 동적통행배정기법 개발에 관한 연구)

  • 김주영;이승재;손의영
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.4
    • /
    • pp.71-84
    • /
    • 1999
  • The purpose of this study is to construct a dynamic traffic analysis model using the existing traffic flow theory in order to develope a dynamic traffic assignment technique. In this study the dynamic traffic analysis model was constructed using Daganzo's CELL TRANSMISSION THEORY which was considered more suitable to dynamic traffic assignment than the other traffic flow theories. We developed newly the diverging split module, the cost update module and the link cost function and defined the maximum waiting time decision function that Daganzo haven't defined certainly at his Papers. The output that resulted from the simulation of the dynamic traffic analysis model with test network I and II was shown at some tables and figures, and the analysis of the bottleneck and the HOV lane theory showed realistic outputs. Especially, the result of traffic assignment using the model doesn't show equilibrium status every time slice but showed that the average travel cost of every path maintains similarly in every time slice. It is considered that this model can be used at the highway operation and the analysis of traffic characteristics at a diverging section and the analysis of the HOV lane effect.

  • PDF

Strategies for Providing Detour Route Information and Traffic Flow Management for Flood Disasters (수해 재난 시 우회교통정보 제공 및 교통류 관리전략)

  • Sin, Seong-Il;Jo, Yong-Chan;Lee, Chang-Ju
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.6
    • /
    • pp.33-42
    • /
    • 2007
  • This research proposes strategies about providing detour route information and traffic management for flood disasters. Suggested strategies are based on prevention and preparation concepts including prediction, optimization, and simulation in order to minimize damage. Specifically, this study shows the possibility that average travel speed is increased by proper signal progression during downpours or heavy snowfalls. In addition, in order to protect the drivers and vehicles from dangerous situations, this study proposes a route guidance strategy based on variational inequalities such as flooding. However, other roads can have traffic congestion by the suggested strategies. Thus, this study also shows the possibility to solve traffic congestion of other roads in networks with emergency signal modes.

Prediction method of node movement using Markov Chain in DTN (DTN에서 Markov Chain을 이용한 노드의 이동 예측 기법)

  • Jeon, Il-kyu;Lee, Kang-whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.5
    • /
    • pp.1013-1019
    • /
    • 2016
  • This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

Impact of Call Setup Time on UPT Performance Based on AIN Platform

  • Baik, In-Kywan;Jo, Jun-Mo;Kim, Sung-Un;Jung, Sin-Il
    • Journal of Korea Multimedia Society
    • /
    • v.1 no.2
    • /
    • pp.249-255
    • /
    • 1998
  • This paper analyzes the impact of Call Setup Time on UPT performance based on the AIN platform. Call Setup Time is used as the performance parameter. In implementing UPT based on the AIN platform, the geographical location of VLR affects network performance. In order to find an optimum location of VLR among three different types of structures, i.e. VLR is located close to Service Switching Point and Cell Site Controller and located at Service Control Point, each Call Setup Time on proposed time delay model is calculated and compared. Network performance is analyzed by changing the number of STP in No.7 signaling network in UPT and the utilization ratio, $\rho$, for SSP, STP and SCP.

  • PDF

Durability Evaluation of the Korean Gauge - Adjustable Wheelset System (궤간가변 윤축시스템의 내구성 평가)

  • Ahn, Seung-Ho;Chung, Kwang-Woo;Jang, Seung-Ho;Kim, Chul-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.12
    • /
    • pp.5669-5675
    • /
    • 2012
  • To reduce the cost and the time of transport in Eurasian railroad networks such as TKR(Trans-Korea Railway), TCR(Trans-China Railway) and TSR(Trans-Siberia Railway) owing to the problem of different track gauges (narrow/standard/broad gauge), it is important to develop the gauge-adjustable wheelset(GAW) system to adapt easily to these gauges. The Korean GAW system is developing and will be adapting to the brand new freight trains' to improve the conventional overseas GAW system. In this study, structural and durability analyses are performed from the viewpoint of the safe-life design. The core parts of the system might be safe in range of $1{\times}10^7$ cycles from the result of durability analysis. Moreover, to examine the safety of the system while running on a track, rig fatigue test was performed according to UIC code. The safety of the Korean GAW system is demonstrated through testing that all safety-relevant conditions are satisfied.

Performance Analysis of Compensation Algorithm for Localization using Equivalent Distance Rate (균등거리비율을 적용한 위치인식 보정 알고리즘 설계 및 성능분석)

  • Kwon, Seong-Ki;Lee, Dong-Myung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.4
    • /
    • pp.1248-1253
    • /
    • 2010
  • In this paper, the compensation algorithm for localization using the concept of equivalent distance rate(AEDR) in order to compensate ranging error in the SDS-TWR(Symmetric Double-Sided Two-Way Ranging) is proposed and the performance of the proposed algorithm is analyzed by the localization experiments. The ranging error of the SDS-TWR in the distance between mobile node and beacon node is measured to average 1m~8m by ranging experiments. But it is confirmed that the performance of the localization by the AEDR is better than that of the SDS-TWR 4 times in university auditorium and corridor, and the localization error of above 3~10m is reduced to average 2m and that of below 3m is reduced to average 1m respectively. It is concluded that the AEDR is superior to the NLOS(Non Line Of Sight) than LOS(Line Of Sight) in performance of ranging compensation for localization, and the AEDR is more helpful to localization systems practically considering the environment of sensor networks is under NLOS.

IEEE 802.16 WMAN MAC Protocol for the Coexistence with WLAN in Shared Bands (공유대역에서 무선 LAN과의 공존을 위한 IEEE 802.16 WMAN의 MAC 프로토콜)

  • Han, Ho-Seong;Rhee, Seung-Hyong;Park, Su-Won;Han, Ki-Young;Kang, Hyon-Goo;Yoon, Soon-Young
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.2
    • /
    • pp.142-149
    • /
    • 2010
  • In this paper, we propose to modify the IEEE 802.16 MAC protocol in order to allow the coexistence of IEEE 802.11 and IEEE 802.16 wireless networks in shared bands. Our suggested protocol enables 802.16 WMAN to control WLAN devices for the coexistence. That is, in the downlink subframes(BS to SS), SS(Subscriber Station) prohibits WLAN to transmit by using CTS(Clear to Send) in order to protect it's burst. In the uplink subframes(SS to BS), on the other hand, BS(Base Station) sends CTS to block WLAN's communications. Our proposals enables the coexistence between WLAN and WMAN, and simulation results show that our protocols enhance the throughput of the entire system.

A New Congestion Control Algorithm for Improving Fairness in TCP Vegas (TCP Vegas에서 공정성 향상을 위한 혼잡제어 알고리즘)

  • Lee, Sun-Hun;Song, Byung-Hoon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.583-592
    • /
    • 2005
  • An important factor influencing the robustness of the Internet is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes the network congestion worse. Brakmo and Peterson proposed a congestion control algorithm, TCP Vegas, by modifying the congestion avoidance scheme of TCP Reno. Many studies indicate that Vegas is able to achieve better throughput and higher stability than Reno. But there are three unfairness problems in Vegas. These problems hinder the spread of Vegas in the current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP NewVegas. The proposed NewVegas is able to solve these unfairness problems effectively by using the variation of the number of queued packets in a bottleneck router. To evaluate the proposed approach, we compare the performance among NewVegas, Reno and Vegas. Through the simulation, NewVegas is shown to be able to achieve throughput and better fairness than Vegas.

A New Bandwidth Allocation Scheme for Hard Real-time Communication on Dual IEEE 802.11 WLANs (이중 IEEE 802.11 WLAN에서 경성 실시간 통신을 위한 대역폭 할당)

  • Lee, Jung-Hoon;Kang, Mi-Kyung
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.5
    • /
    • pp.633-640
    • /
    • 2005
  • This paper proposes and analyzes a message scheduling scheme and corresponding bandwidth allocation method for the hard real-time communication on dual standard 802.11 Wireless LANs. By making the superframeof one network precede that of the other by half, the dual network architecture can minimize the effect of deferred beacon and reduce the worst case waiting timeby half. The effect of deferred beacon is formalized and directly considered to decide the polling schedule of PCF phase. Simulation results executed via ns-2 show that the proposed scheme can improve the schedulability by 3$36\%$ for real-time messages and give $9\%$ more bandwidth to non-real-time messages for the given stream sets, compared with the network whose bandwidth is just doubled with the same MAC.