• Title/Summary/Keyword: congestion

Search Result 2,834, Processing Time 0.024 seconds

Study on the Development of Congestion Index for Expressway Service Areas Based on Floating Population Big Data (유동인구 빅데이터 기반 고속도로 휴게소 혼잡지표 개발 연구)

  • Kim, Hae;Lee, Hwan-Pil;Kwon, Cheolwoo;Park, Sungho;Park, Sangmin;Yun, Ilsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.4
    • /
    • pp.99-111
    • /
    • 2018
  • Service areas in expressways are very important facilities in terms of efficient expressway operation and the convenience of users. It needs a traffic management strategy to inform drivers in advance about congestion in service areas so as to distribute users of service areas. But due to the lack of sensors and data on numbers of people in the service areas, congestion in service areas had not been measured and managed appropriately. In this study, a congestion index for service areas was developed using telecommunication floating population big data. Two alternative indices (i.e., density of service areas and floating population V/c of service areas) were developed. Finally, the floating population V/c of service areas was selected as a congestion index for service areas for reasons of the ease of understanding and comparison.

Transient Multipath routing protocol for low power and lossy networks

  • Lodhi, Muhammad Ali;Rehman, Abdul;Khan, Meer Muhammad;Asfand-e-yar, Muhammad;Hussain, Faisal Bashir
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2002-2019
    • /
    • 2017
  • RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

TCP Congestion and Flow Control Algorithm using a Network Model (네트워크 모델을 이용한 전송제어 프로토콜(TCP))

  • 유영일;이채우
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.4
    • /
    • pp.35-44
    • /
    • 2004
  • Recently announced TCP Vegas predicts the degree of congestion in the network and then control the congestion window size. Thus it shows better performance than TCP Reno. however, TCP vegas does not assume any network model, its congestion window control is very limited. Because or this limitation, TCP vegas still can not adapt to fast changing available bandwidth. In this paper, we introduce a new TCP algorithm which adapts to fast changing available bandwidth well. To devise such a TCP, we model the end to end network of TCP connection as a queueing system and finds congestion window size which can utilize the available bandwidth sufficiently but not make the network congested. The simulation results show that our algorithm adapts to the avaliable bandwidth faster than TCP vegas and as a results, when the available bandwidth is changing rapidly, our algorithm not only operates more stably than TCP Vegas, but also it shows higher thruput than TCP Vegas.

Effects of Store Crowding on Store Attitude and Behavioral Intention - Based on adjustment effects of consumer susceptibility (점포 혼잡성이 점포태도와 행동의도에 미치는 영향 - 소비자 동조성의 조절효과를 중심으로)

  • Choo, Mi-Ae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.4
    • /
    • pp.965-972
    • /
    • 2014
  • Attitudes and behavior within the store congestion of the store is a store in any manner affect the formation process of investigating synchronism in the control of the consumer appears to analyze the influence of enemy has its purpose. Store and spatial congestion factor of social behavioral factors also revisit the help of word-of-mouth is. Consumer groups with high and low groups of synchronism suggested. Social attitudes towards the store congestion significantly positive effect that I've shown, it was not significant spatial congestion. During a revisit of action is a statistically significant relationship that I've shown, is a significant effect of word-of-mouth relationship was not significant. Investigating the moderating effects of consumer synchronism result of high consumer groups a significant impact on the social congestion showed, at low spatial influence congestion.

Adaptive Congestion Control Scheme of TCP for Supporting ACM in Satellite PEP System (위성 PEP시스템에서 ACM 지원을 위한 적응형 TCP 혼잡제어기법)

  • Park, ManKyu;Kang, Dongbae;Oh, DeockGil
    • Journal of Satellite, Information and Communications
    • /
    • v.8 no.1
    • /
    • pp.1-7
    • /
    • 2013
  • Currently satellite communication systems usually use the ACM(Adaptive Coding and Modulation) to extend the link availability and to increase the bandwidth efficiency. However, when ACM system is used for satellite communications, we should carefully consider TCP congestion control to avoid network congestions. Because MODCODs in ACM are changed to make a packet more robust according to satellite wireless link conditions, bandwidth of satellite forward link is also changed. Whereas TCP has a severe problem to control the congestion window for the changed bandwidth, then packet overflow can be experienced at MAC or PHY interface buffers. This is a reason that TCP in transport layer does not recognize a change of bandwidth capability form MAC or PHY layer. To overcome this problem, we propose the adaptive congestion control scheme of TCP for supporting ACM in Satellite PEP (Performance Enhancing Proxy) systems. Simulation results by using ns-2 show that our proposed scheme can be efficiently adapted to the changed bandwidth and TCP congestion window size, and can be useful to improve TCP performance.

An Estimation of Congestion Pricing Using Speed-Flow Relationship (Gangbyeon Expressway) (속도-밀도 모형을 적용한 흔잡통행료 산정 (강변북로를 중심으로))

  • Gang, Gyeong-U;Guk, U-Gak
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.2 s.88
    • /
    • pp.31-41
    • /
    • 2006
  • The main purpose of this paper is to develop the practical method to estimate the congestion price in odor to overcome the difficulty of traditional microeconomics approach for demand and cost function concepts. In this paper, we estimate the theoretical congestion toll which reflecting the real traffic conditions such as a speed-density functions using a traffic engineering methods We calculates the optimal congestion toll based on the real traffic conditions assuming that the electronic road pricing (ERP) systems ave installed for the study road. After evaluating the various speed-density relationship methods. we found that the Drake model is best suited for the Gangbyeon Expressway Using the Drake model, the optimal congestion toll will be 94 to 3,255 Won for the traffic speed between 44km/h to 68 km/h based on wage rate method and 107 to 6,381 Won for the marginal substitution method for the Gangbyeon Expressway in city of Seoul, Korea.

A Multiple User Class Congestion Pricing Model and Equity (혼잡통행료 산정모형의 개발 및 계층간 형평성 연구)

  • Im, Yong-Taek;Kim, Byeong-Gwan
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.5
    • /
    • pp.183-193
    • /
    • 2007
  • Traditionally, a congestion charge based on first-best congestion pricing theory, namely, the theory of marginal cost pricing theory, is equal to the difference between marginal social cost and marginal private cost. It is charged on each link so as to derive a user equilibrium flow pattern to a system optimal one. Based on this theory this paper investigates on the characteristics of first-best congestion pricing of multiple user class on road with variable demand, and presents two methods for analysis of social and spatial equity. For these purposes, we study on the characteristics of first-best congestion pricing derived from system optimal in time and in monetary unit, and analyze equity from this congestion pricing with an example network.

Energy Efficient Congestion Control Scheme in Ad-hoc Networks (Ad-hoc 통신망의 에너지 효율적인 혼잡 제어 기법)

  • Cho, Nam-Ho;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.5
    • /
    • pp.369-379
    • /
    • 2006
  • In recent years, there have been many researches about Ad-hoc Networks which is available to communicate freely between mobile devices by using multi-hop without any support of relay base or access point. TCP that used the most widely transport protocol in the Internet repeats packet loss and retransmission because it increases congestion window size by using reactive congestion control until packet loss occurs. As a result of this, energy of mobile device is wasted unnecessarily. In this paper, we propose TCP-New Veno in order to improve the energy efficiency of mobile device. According to the state of network, the scheme adjusts appropriate size of congestion window. Therefore, the energy efficiency of mobile device and utilization of bandwidth are improved by the scheme. From the simulation by using ns-2, we could see more improved energy efficiency with TCP-New Veno than those with TCP in Ad-hoc Networks.

A Study on Network Competition Under Congestion (네트워크 혼잡이 있는 경우의 네트워크 경쟁효과 분석)

  • Jung, Choong-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.24-33
    • /
    • 2009
  • This paper considers network competition where the subscribers experience network congestion when they use the network and the network providers determine the network price and capacity. This paper discusses the impact of the network competition on social welfare. Network provider determines the price and capacity considering this characteristics of this sensitivity to network congestion where the subscriber has different preference about the congestion. This paper shows that network provider who wants to serve the intolerable customers (who is very sensitive to the congestion) offers higher price and capacity. However, this provider prepares lower capacity than socially optimal capacity. This is because the network provider seeks to earn more profits from additional subscriber while it is desirable to invest the capacity to give the entire subscribers a non-congestion network in the view of social welfare.

End-to-End Congestion Control of High-Speed Gigabit-Ethernet Networks based on Smith's Principle

  • Lee, Seung-Hyub;Cho, Kwang-Hyun
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.101-104
    • /
    • 2000
  • Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith's principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

  • PDF