• Title/Summary/Keyword: traffics

Search Result 549, Processing Time 0.025 seconds

Application and Development of Super High Early Strenth Concrete Overlay pavements for repairing Asphalts Pavement within 24hours (신속개방형 콘크리트 overlay(whitetopping)포장재의 적용 및 공용성 평가연구)

  • 엄태선;임채용;유재상;이종열;조윤호;이순기
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2003.11a
    • /
    • pp.573-576
    • /
    • 2003
  • We have developed and applied the super high early strength concrete overlay pavements for repairing asphalts pavements within 24hours. This pavements repairing method by the super high early strength concrete have already applied in U.S.A, japan, England, etc. The super high early strength concrete developed by Ssangyong cement co. for repairing pavements speedily have replaced at No. 2, 17 pavements in managing by Sunchoen national pavements management office. In the results, all of works have finished within 16~24hours after intercepting traffics and all of traffics was opened to be hamonious. In present, this pavements is sound and strong

  • PDF

Clustering Algorithm for a Traffic Control of Wireless Ad Hoc Networks multi-hop (무선 에드혹 망 다중홉 트래픽제어를 위한 Clustering 알고리즘에 관한 연구)

  • 이동철;김기문;김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.6
    • /
    • pp.1161-1167
    • /
    • 2003
  • The nodes of Ad hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad hoc.

A Study on the Effective Routing Algorithm for Mobile Ad-hoc Wireless Program Developed Network (Ad-hoc 이동 통신망에서의 효율적인 라우팅 알고리즘에 관한 연구)

  • Lee, Dong chul;Park, Jong Bong;Kim, Sung Gwun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.05a
    • /
    • pp.653-655
    • /
    • 2015
  • The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

  • PDF

Analysis of Dynamic bandwidth allocation scheme for ATM/LAN interworking unit (ATM/LAN 연동장치의 동적대역할당 방식에 대한 성능해석)

  • 이은준;우상철;윤종호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.12
    • /
    • pp.3132-3143
    • /
    • 1996
  • In the evaluation of Broadband-ISDN, the main issue is to interconnect existing LANs and MANs to B-ISDN based on Asynchrous Transfer Mode. However, LANs provide connectionless services, whereas the ATM network provides connection-oriented services. So some problem arises from accessing ATM switchs to transparently transmit connectionless data via B-ISDN. Two methods then were recommended by ITU-TS to support the connectionaless services. In the paper, we do the numerical analysis, using the stochastic fluid flow method, of dynamic bandwidth allocation sheme with two class traffics in the virtual path established between Interworking Units(JWUS) interconnecting LANs to an ATM network and Connectionless Servers(CLSs). The loss mechanism of each traffic is controlled by the contents of buffer. The vandwidth which the IWU requests the CLS is estimated by the number of On-Off sources in the On state. We use the stochsastic fluide flow method which is to find the steady-state joint probability in each level of the IWU buffer. The length of the IWU buffer as the real random variable is changed by traffics entering the IWU.

  • PDF

TCP-friendly RTP Rate Control

  • 하상석;정선태
    • Proceedings of the IEEK Conference
    • /
    • 2003.11a
    • /
    • pp.255-258
    • /
    • 2003
  • TCP is taking over 95% among the Internet traffics. Recently the demands of multimedia services in the Internet has been increasing. These multimedia services mostly need real-time deliverly, and then RTP has been a de facto to transmission protocol for these real-time multimedia services. RTP uses UDP as its underlying transport protocol, and thus it does not support any rate and congestion control. Thus, for fair use of the Internet bandwidth with TCP traffics. RTP also needs a rate control. One constraint of RTP is that the feedback information(delivered by, RTP's twin protocol, RTCP) is recommended to be sent no less than 5 seconds. In this paper, we propose a TCP-friendly RTP rate control which use only RTCP feedback information at every 5 seconds. The experiment results show that our proposed algorithm works. But, it is found that we need more time to test the effects of parameters and policies of the algorithms, which will be reported later.

  • PDF

Traffic Modeling of Video Source and Performance Analysis of ATM Multiplexer (비디오 원의 트래픽 모형화와 다중화 장치의 성능분석)

  • Yoon, Young-Ha;Hong, Jung-Sik;Lie, Chang-Hoon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.23 no.1
    • /
    • pp.235-247
    • /
    • 1997
  • In this study, the performance of ATM multiplexer with MPEG(Motion Pictures Experts Group) video is analyzed by considering the effect of the MPEG GOP(Group of Pictures) structure. By assuming that frame starting times are synchronized, aggregated traffics are considered to be transmitted at the beginning of each frame time units. The aggregated number of cells generated during a frame time unit is, therefore, derived from distributions of individual sources. The stationary probability of buffer occupancy can be easily obtained by using a property of the periodicity of aggregated traffics. Simulation approach is also used to determine the traffic load for a given probability of satisfying QoS(Quality of Service).

  • PDF

Harmful Traffic Analysis on the IPv6 Environment (IPv6 환경에서의 유해 트래픽 분석)

  • Koo Hyang-Ohk;Baek Soon-Hwa;Oh Chang-Suk
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.11a
    • /
    • pp.195-199
    • /
    • 2005
  • The IPv6 environment combined the home network and the Internet with has arrived, the damages cased by the attacks from the worm attacks and the various virus has been increased. In this paper we analyze the traffics of TCP, UDP and ICMP, and propose for a method to detect harmful traffics in the IPv6 environment.

  • PDF

A Delay Efficient and Bursty Traffics Friendly MAC Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 지연과 버스티 트래픽에 적합한 MAC 프로토콜)

  • Kim, Hye Yun;Kim, Seong Cheol
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.254-260
    • /
    • 2017
  • Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

QUEUEING ANALYSIS OF THE HOL PRIORITY LEAKY BUCKET SCHEME

  • Choi, Doo-Il
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.7 no.1
    • /
    • pp.15-23
    • /
    • 2003
  • ATM networks provide the various kinds of service which require the different Quality of Services(QoS) such as loss and delay. By statistically multiplexing of traffics and the uncertainty and fluctuation of source traffic pattern, the congestion may occur. The leaky bucket scheme is a representative policing mechanism for preventive congestion control. In this paper, we analyze the HOL(Head-of-Line) priority leaky bucket scheme. That is, traffics are classified into real-time and nonreal-time traffic. The real-time traffic has priority over nonreal-time traffic for transmission. For proposed mechanism, we obtain the system state distribution, finally the loss probability and the mean waiting time of real-time and nonreal-time traffic. The simple numerical examples also are presented.

  • PDF

Traffic Modeling and Performance Analysis of Mobile Multimedia Data Services (이동통신 멀티미디어 데이터서비스의 트래픽 특성 모델링 및 성능분석)

  • 정용주;백천현;김후곤;최택진;양원석;황흥석
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.2
    • /
    • pp.139-155
    • /
    • 2003
  • The aim of this study is to identify the data traffic capacity of 3G mobile communication networks, especially of cdma2000-1X networks. Three-layered ON/OFF traffic model is used to describe the dynamics of data traffics and the process of data transmission such as packet scheduling. We construct a simulator fully incorporating packet handling process of cdma2000-lX data network as well as three-layered ON/OFF traffic model describing the behavior of source data traffics. To get influence of traffic parameters on performance measures, the extensive simulations were performed for several data sets which are obtained from real trace data or previous studies. The experimental results show that the engineered throughput satisfying QoS criteria is approximately 25% of total capacity. Finally, some proposals to improve the system capacity are followed.