• Title/Summary/Keyword: network congestion

Search Result 908, Processing Time 0.025 seconds

A Study on Design and Implementation of a VC-Merge Capable LSR on MPLS over ATM (ATM기반 MPLS망에서 확장성을 고려한 VC-Merge 가능한 LSR 설계에 관한 연구)

  • Kim, Young-Chul;Lee, Tae-Won;Lee, Dong-Won;Choi, Deok-Jae;Lee, Guee-Sang
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.12
    • /
    • pp.29-38
    • /
    • 2001
  • Recently, as Internet and its services grow rapidly, IETF(Internet Engineering Task Force) introduced a new switching mechanism, MPLS(Multi-Protocol Label Switching), to solve the problem of the scalability in Internet backbone. In this paper, we implemented the LSR loaded with VC-merging function, which causes LSR's management cost to be significantly reduced. We propose a new VC-merge function which supports differentiated services. In case of network congestion in the output buffer of each core LSR, appling link polices to the output modules of the LSR using the EPD algorithm can prevent the buffer from being overflowed. Simulation was performed for Diffserv by using multiple traffic models and investigated the impact of VC-merge method compared to non VC-merge method. The proposed switch is modeled in VHDL and fabricated using the SAMSUNG $0.5{\mu}m$ SOG process.

  • PDF

Comparative Analysis on the Delay Between Multi-legged Roundabout and Signalized Intersection (다지 회전교차로와 신호교차로의 지체 비교 분석)

  • Han, Su-San;Park, Byung-Ho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.6
    • /
    • pp.83-93
    • /
    • 2010
  • The roundabout is a green transportation system which reduces the accident, the congestion cost and greenhouse effect. The purpose of the study is to analyze the multi-legged roundabout's efficiency. In pursuing the above, this study gives particular attention to building the optimal network of multi-legged roundabout and intersections, developing the scenarios for analysis reflected by the proportion of entering traffic volume of main and minor roads, and comparatively analyzing the average delay per car using VISSIM. The main results are as follows. First, when the entering traffic volume are less than 3,500pcph, the 5-legged single and double-lane roundabout are all analyzed to be more effective than intersection. Second, when the entering traffic volume are less than 3,600pcph, the 6-legged single-lane roundabout is analyzed to be more effective than intersection. The 6-legged double-lane roundabout is analyzed to be more effective than intersection. The 6-legged double-lane roundabout is analyzed to be more effective than intersection in all cases of entering volume.

Mobile Edge Computing based Charging Infrastructure considering Electric Vehicle Charging Efficiency (전기자동차 충전 효율성을 고려한 모바일 에지 컴퓨팅 기반 충전 인프라 구조)

  • Lee, Juyong;Lee, Jihoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.10
    • /
    • pp.669-674
    • /
    • 2017
  • Due to the depletion of fossil fuels and the increase in environmental pollution, electric vehicles are attracting attention as next-generation transportation and are becoming popular all over the world. As the interest in electric vehicles and the penetration rate increase, studies on the charging infrastructure with vehicle-to-grid (V2G) technology and information technology are actively under way. In particular, communication with the grid network is the most important factor for stable charging and load management of electric vehicles. However, with the existing centralized infrastructure, there are problems when control-message requests increase and the charging infrastructure cannot efficiently operate due to slow response speed. In this paper, we propose a new charging infrastructure using mobile edge computing (MEC) that mitigates congestion and provides low latency by applying distributed cloud computing technology to wireless base stations. Through a performance evaluation, we confirm that the proposed charging infrastructure (with low latency) can cope with peak conditions more efficiently than the existing charging infrastructure.

Mobility Management of M2M Devices with Grouping in the LTE System (LTE 시스템에서 그룹 기반 M2M 단말 이동성 관리)

  • Roh, Hee-Tae;Lee, Jang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1119-1127
    • /
    • 2012
  • The one of features of M2M communications, which are recently attracted attention as a future business of mobile communications, is that there is a large number of devices compared with traditional communication services. Hence, the control signal that are generated by the M2M devices may cause a significant congestion in the network and in order to solve this problem, a standardization is progressing for reducing the redundant signaling by managing M2M devices as a group in 3GPP standardization. In this paper, we propose a method of group based mobility management by managing M2M devices that have the same mobility as a group. In the proposed method, M2M devices that have the same mobility are grouped by the Mobility Management Entity (MME) and the MME elects a group header among the M2M devices in the group. Then, the group header performs the Tracking Area Update (TAU) on behalf of the group members to reduce the signaling overhead of mobility management. With the proposed method, we can achieve 80% decrease of the signaling overhead of mobility management compared with the case where each M2M device individually performs its TAU procedure.

A Solution Algorithm for Elastic Demand Traffic Assignment Model Based on Dynamic Process (동적과정을 이용한 가변수요 통행배정모형의 알고리듬 개발)

  • Im, Yong-Taek;Kim, Hyeon-Myeong
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.2 s.88
    • /
    • pp.169-178
    • /
    • 2006
  • Traffic assignment has been used both for predicting travel demands and for evaluating the tools for alleviating congestion on road network in advance. Some assignment models have been proposed such as equivalent mathematical minimization method, variational inequality problem, nonlinear complementary problem and fixed point method, in following the principle of Wardrop (1952) that no driver can not Improve his travel cost by unilaterally changing his route. Recently Jin(2005a) presented a traffic assignment model based on dynamic process. This paper proposes a solution algorithm for the model of Jin and assesses the performances. Compared to the Frank-Wolfe method, which has been wildly used for solving the existing assignment models, the proposed algorithm is expected to be more efficient because it does not need to evaluate the objective function. Two numerical examples are used for assessing the algorithm, and they show that the algorithm converges to user equilibrium of Wardrop.

Impacts of Automated Vehicles on Freeway Traffic-flow - Focused on Seoul-Singal Basic Sections of GyeongBu Freeway - (자율주행차량 도입에 따른 고속도로 교통류 영향분석 - 경부고속도로 서울-신갈 기본구간을 중심으로)

  • Park, In-seon;Lee, Jong-deok;Lee, Jae-yong;Hwang, Kee-yeon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.6
    • /
    • pp.21-36
    • /
    • 2015
  • These days Automated Vehicle(AV) has been receiving attention as a fundamental solution to resolve the various transportation problems and various researches related to the benefits of AV have been done. However, previous researches mainly analyzed the effects in the virtual network. The purpose of this research is to predict and to find out the benefits by introducing the Automated Vehicle to present road traffic system. Thus, the study analyzes the traffic-flow changes of Gyeongbu freeway Seoul-Singal basic section which is planned for setting the test-bed. The results show that Automated Vehicle can have negative effects on the traffic-flow in low volume of LOS A and B. However, the average speed increases and the traffic density decreases in more than LOS C, the traffic volume increase. Therefore, the introduction of Automated Vehicle achieves positive effect on various transportation problems such as the traffic congestion.

An Optimal Resource Distribution Scheme for P2P Streaming Service over Centralized DU Environment in LTE (LTE에서 집중화된 DU 환경에서 P2P 스트리밍 서비스를 위한 최적의 자원 배분 방안)

  • Kim, Yangjung;Chong, Ilyoung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.3
    • /
    • pp.81-86
    • /
    • 2014
  • According to the development of streaming services with P2P and mobile network technologies, researches to enhance the service quality in mobile environment have been proposed. However, streaming services considering high-speed mobile environment and characteristics of heterogenous terminals have been hindered from being provided with the required quality from user because of bandwidth congestion between selfish peers of existing P2P system. It is also prone to long delay and loss in accordance with the repeated traffic amounts because there are no optimized solution for traffic localization. The structure to enhance peer contribution for service differentiation and peer selection with clustering scheme with location information of terminal can satisfy both users and service providers with service quality and efficiency. In this paper, we propose an incentive mechanism and resource distribution scheme with user contribution and traffic cost information based on user location, which make mobile users increase the satisfaction of service quality in LTE environments.

A Study of Core-Stateless Mechanism for Fair Bandwidth Allocation (대역 공평성 보장을 위한 Core-Stateless 기법 연구)

  • Kim, Hwa-Suk;Kim, Sang-Ha;Kim, Young-Bu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4C
    • /
    • pp.343-355
    • /
    • 2003
  • Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

Media-aware and Quality-guaranteed Rate Adaptation Algorithm for Scalable Video Streaming (미디어 특성과 네트워크 상태에 적응적인 스케일러블 비디오 스트리밍 기법에 관한 연구)

  • Jung, Young-H.;Kang, Young-Wook;Choe, Yoon-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5B
    • /
    • pp.517-525
    • /
    • 2009
  • We propose a quality guaranteed scalable video streaming service over the Internet using a new rate adaptation algorithm. Because video data requires much more bandwidth rather than other types of service, therefore, quality of video streaming service should be guaranteed while providing friendliness with other service flows over the Internet. To successfully provide this, we propose a framework for providing quality-guaranteed streaming service using two-channel transport layer and rate adaptation of scalable video stream. In this framework, baseline layer for scalable video is transmitted using TCP transport for minimum qualify service. Enhancement layers are delivered using TFRC transport with layer adaptation algorithm. The proposed framework jointly uses the status of playout buffer in the client and the encoding rate of layers in media contents. Therefore, the proposed algorithm can remarkably guarantee minimum quality of streaming service rather than conventional approaches regardless of network congestion and the encoding rate variation of media content.

Performance Evaluation of Semi-Persistent Scheduling in a Narrowband LTE System for Internet of Things (사물인터넷을 위한 협대역 LTE 시스템에서의 준지속적 스케줄링의 성능 평가)

  • Kim, Sunkyung;Cha, Wonjung;So, Jaewoo;Na, Minsoo;Choi, Changsoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.1001-1009
    • /
    • 2016
  • In LTE networks, the base station transmits control information over the physical downlink control channel (PDCCH) including scheduling grants, which are used to indicate the resources that the user equipment uses to send data to the base station. Because the size of the PDCCH message and the number of the PDCCH transmissions increase in proportion to the number of user equipments, the overhead of the PDCCH may cause serious network congestion problems in the narrowband LTE (NB-LTE) system. This paper proposes the compact PDCCH information bit allocation to reduce the size of the PDCCH message and evaluates the performance of the semi-persistent scheduling (SPS) in the NB-LTE system. The simulation results show that the SPS can significantly reduce the signaling overhead of the PDCCH and therefore increase the system utilization.