• Title/Summary/Keyword: 네트워크 트래픽 제어

Search Result 491, Processing Time 0.027 seconds

Performance Analysis of Cellular If Using Combined Cache and Alternative Handoff Method for Realtime Data Transmission (실시간 데이터를 지원하는 통합 캐시 및 차별화된 핸드오프를 이용한 셀룰러 IP의 성능분석)

  • Seo, Jeong-Hwa;Han, Tae-Young;Kim, Nam
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.2
    • /
    • pp.65-72
    • /
    • 2003
  • In this paper, the new scheme using a Combined Cache(CC) that combing the Paging and Routing Cache(PRC) and an alternative handoff method according to the type of data transmission for achieving the efficient realtime communication. The PRC and quasi-soft handoff method reduce the path duplication. But they increase the network traffic load because of the handoff state packet of Mobile Host(MH). Moreover the use the same handoff method without differentiating the type of transmission data. Those problems are solved by operating U with a semi-soft handoff method for realtime data transmission and with a hard handoff method for non-realtime data transmission. As a result or simulation a better performance is obtained because of the reduction of the number of control packet in case that the number of cells are below 20. And the packet arrival time and loss of packet decreased significantly for realtime data transmission.

  • PDF

An Adaptive Contention Windows Adjustment Scheme Based on the Access Category for OnBord-Unit in IEEE 802.11p (IEEE 802.11p에서 차량단말기간에 혼잡상황 해결을 위한 동적 충돌 윈도우 향상 기법)

  • Park, Hyun-Moon;Park, Soo-Hyun;Lee, Seung-Joo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.6
    • /
    • pp.28-39
    • /
    • 2010
  • The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.

MAC-Layer Error Control for Real-Time Broadcasting of MPEG-4 Scalable Video over 3G Networks (3G 네트워크에서 MPEG-4 스케일러블 비디오의 실시간 방송을 위한 실행시간 예측 기반 MAC계층 오류제어)

  • Kang, Kyungtae;Noh, Dong Kun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.3
    • /
    • pp.63-71
    • /
    • 2014
  • We analyze the execution time of Reed-Solomon coding, which is the MAC-layer forward error correction scheme used in CDMA2000 1xEV-DO broadcast services, under different air channel conditions. The results show that the time constraints of MPEG-4 cannot be guaranteed by Reed-Solomon decoding when the packet loss rate (PLR) is high, due to its long computation time on current hardware. To alleviate this problem, we propose three error control schemes. Our static scheme bypasses Reed-Solomon decoding at the mobile node to satisfy the MPEG-4 time constraint when the PLR exceeds a given boundary. Second, dynamic scheme corrects errors in a best-effort manner within the time constraint, instead of giving up altogether when the PLR is high; this achieves a further quality improvement. The third, video-aware dynamic scheme fixes errors in a similar way to the dynamic scheme, but in a priority-driven manner which makes the video appear smoother. Extensive simulation results show the effectiveness of our schemes compared to the original FEC scheme.

A Study on Framework to offer the differentiated Optical QoS Service in the Next-Generation WDM Optical Internet Backbone Network (차세대 WDM 광 인터넷 백본망에서 차등화된 광 QoS 서비스 제공 프레임워크 연구)

  • Kim Yong-Seoug;Ryu Shi-Kook;Lee Jae-Dong;Kim Sung-Un
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.881-890
    • /
    • 2005
  • Over for the past 10 years, the increase in geometric progression for the internet traffic, has allowed the IP protocol framework to be the most important network technology. In addition, the internet service is being developed as a service mode differentiated, aiming to support the new-mode real-time multimedia services such as internet phone, video conference, cyber reality, and internet game, focusing on offering a latest service. These days, aiming to solve the need for broad bandwidth along with guaranteeing QoS, the WDM technology of offering multiple gigabit wavelengths is emerging as the core technology of next-generation optical internet backbone network. In the next-generation optical internet backbone network based on WDM, the QoS framework is one of fore subjects aiming to offer a service of guaranteeing QoS This study analyzes the requirements of performance related to QoS framework in IP Subnet and in WDM optical backbone network, and suggests optical QoS service framework differentiated. in order to guarantee end-to-end QoS through the next-generation optical internet backbone network, using GMPLS control protocol.

Combination of Token Bucket and AMP Schemes to Solve Buffer Underflow and Overflow of Video Streaming in Wireless Communication (무선통신 환경에서 비디오 스트리밍의 버퍼 언더플로우와 오버플로우를 해결하기 위한 토큰버킷과 AMP 기법의 결합)

  • Lee, Hyun-no;Kim, Dong-hoi
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1330-1338
    • /
    • 2015
  • In wireless communication network, the amount of packet data for the video streaming in the playout buffer of the receiver is changed with time according to network condition. If the amount of packet data is less than a specific buffer amount, the buffer underflow problem is generated. On the contrary, if the amount of packet data is more than a given buffer amount, the buffer overflow problem is occurred. When the playout of the video streaming is processed, these buffer underflow and overflow problems cause stop and skip phenomenons and then provide the discontinuity of playout. Therefore, to solve the buffer underflow and overflow problems of the video streaming in wireless communication network, This paper analyzes the combined effect of Token Bucket scheme, which controls the bursty traffic, and AMP(Adaptive Media Playout) scheme, which adaptively changes the playout speed of receiver. Through simulation, we found that the combination of Token Bucket and AMP schemes provides the superiority in terms of the occurrence number of buffer underflow and overflow, the stop duration time and the number of removed frames generated by underflow and overflow, and PSNR.

Checksum Signals Identification in CAN Messages (CAN 통신 메시지 내의 Checksum Signal 식별 방법 연구)

  • Gyeongyeon Lee;Hyunghoon Kim;Dong Hoon Lee;Wonsuk Choi
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.4
    • /
    • pp.747-761
    • /
    • 2024
  • Recently, modern vehicles have been controlled by Electronic Control Units (ECUs), by which the safety and convenience of drivers are highly improved. It is known that a luxury vehicle has more than 100 ECUs to electronically control its function. However, the modern vehicles are getting targeted by cyber attacks because of this computer-based automotive system. To address the cyber attacks, automotive manufacturers have been developing some methods for securing their vehicles, such as automotive Intrusion Detection System (IDS). This development is only allowed to the automotive manufacturers because they have databases for their in-vehicle network (i.e., DBC Format File) which are highly confidential. This confidentiality poses a significant challenge to external researchers who attempt to conduct automotive security researches. To handle this restricted information, in this paper, we propose a method to partially understand the DBC Format File by analyzing in-vehicle network traffics. Our method is designed to analyze Controller Area Network (CAN) traffics so that checksum signals are identified in CAN Frame Data Field. Also, our method creates a Lookup Set by which a checksum signal is correctly estimated for a given message. We validate our method with the publicly accessible dataset as well as one from a real vehicle.

Security of Ethernet in Automotive Electric/Electronic Architectures (차량 전자/전기 아키텍쳐에 이더넷 적용을 위한 보안 기술에 대한 연구)

  • Lee, Ho-Yong;Lee, Dong-Hoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.5
    • /
    • pp.39-48
    • /
    • 2016
  • One of the major trends of automotive networking architecture is the introduction of automotive Ethernet. Ethernet is already used in single automotive applications (e.g. to connect high-data-rate sources as video cameras), it is expected that the ongoing standardization at IEEE (IEEE802.3bw - 100BASE-T1, respectively IEEE P802.3bp - 1000BASE-T1) will lead to a much broader adoption in future. Those applications will not be limited to simple point-to-point connections, but may affect Electric/Electronic(EE) Architectures as a whole. It is agreed that IP based traffic via Ethernet could be secured by application of well-established IP security protocols (e.g., IPSec, TLS) combined with additional components like, e.g., automotive firewall or IDS. In the case of safety and real-time related applications on resource constraint devices, the IP based communication is not the favorite option to be used with complicated and performance demanding TLS or IPSec. Those applications will be foreseeable incorporate Layer-2 based communication protocols as, e.g., currently standardized at IEEE[13]. The present paper reflects the state-of-the-art communication concepts with respect to security and identifies architectural challenges and potential solutions for future Ethernet Switch-based EE-Architectures. It also gives an overview and provide insights into the ongoing security relevant standardization activities concerning automotive Ethernet. Furthermore, the properties of non-automotive Ethernet security mechanisms as, e.g., IEEE 802.1AE aka. MACsec or 802.1X Port-based Network Access Control, will be evaluated and the applicability for automotive applications will be assessed.

Fast Handover Mechanism for Multi-Interface MIPv6 Environments and Performance Evaluation (다중 인터페이스 MIPv6 환경에서의 Fast Handover 방안 및 성능 분석)

  • Park, Man-Kyu;Hwang, An-Kyu;Lee, Jae-Yong;Kim, Byung-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.12
    • /
    • pp.34-43
    • /
    • 2007
  • Recently, in addition to the sharp increase of mobile nodes, various kinds of wireless technologies are available for mobile nodes. If IPv6 technology is applied to the network, multi-homing terminals which have several public IP addresses on one interface will be common. Accordingly, there are many research activities on mobility management for multi-interface, multi-homming nodes. In this paper we propose an extended fast handover mechanism for multi-interface MIPv6 environments that uses multi-interface FBU (MFBU) message instead of the existing FBU message. The MFBU message has the "tunnel destination" mobility option that points a specific tunnel destination other than NAR, and "T" flag that indicates the existence of tunnel destination option. The proposed mechanism can improve the TCP performance by mitigating packet reordering during FMIPv6 handover that can cause unnecessary congestion control due to 3 duplicate ACKs. In this paper, we implemented a multi-Interface MIPv6 simulator by extending a single-interface MIPv6 simulator in NS-2, and showed that the performance of TCP traffic is improved by using the proposed multi-interface fast MIPv6.

A Traffic Management Scheme for the Scalability of IP QoS (IP QoS의 확장성을 위한 트래픽 관리 방안)

  • Min, An-Gi;Suk, Jung-Bong
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.375-385
    • /
    • 2002
  • The IETF has defined the Intserv model and the RSVP signaling protocol to improve QoS capability for a set of newly emerging services including voice and video streams that require high transmission bandwidth and low delay. However, since the current Intserv model requires each router to maintain the states of each service flow, the complexity and the overhead for processing packets in each rioter drastically increase as the size of the network increases, giving rise to the scalability problem. This motivates our work; namely, we investigate and devise new control schemes to enhance the scalability of the Intesev model. To do this, we basically resort to the SCORE network model, extend it to fairly well adapt to the three services presented in the Intserv model, and devise schemes of the QoS scheduling, the admission control, and the edge and core node architectures. We also carry out the computer simulation by using ns-2 simulator to examine the performance of the proposed scheme in respects of the bandwidth allocation capability, the packet delay, and the packet delay variation. The results show that the proposed scheme meets the QoS requirements of the respective three services of Intserv model, thus we conclude that the proposed scheme enhances the scalability, while keeping the efficiency of the current Intserv model.

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.