• Title/Summary/Keyword: Traffic transmission scheme

Search Result 316, Processing Time 0.025 seconds

A Resource Scheduling Based on Iterative Sorting for Long-Distance Airborne Tactical Communication in Hub Network (허브 네트워크에서의 장거리 공중 전술 통신을 위한 반복 정렬 기반의 자원 스케줄링 기법)

  • Lee, Kyunghoon;Lee, Dong Hun;Lee, Dae-Hong;Jung, Sung-Jin;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1250-1260
    • /
    • 2014
  • In this paper, a novel resource scheduling, which is used for hub network based long distance airborne tactical communication, is proposed. Recently, some countries of the world has concentrated on developing data rate and networking performance of CDL, striving to keep pace with modern warfare, which is changed into NCW. And our government has also developed the next generation high capacity CDL. In hub network, a typical communication structure of CDL, hybrid FDMA/TDMA can be considered to exchange high rate data among multiple UAVs simultaneously, within limited bandwidth. However, due to different RTT and traffic size of UAV, idle time resource and unnecessary packet transmission delay can occur. And these losses can reduce entire efficiency of hub network in long distance communication. Therefore, in this paper, we propose RTT and data traffic size based UAV scheduling, which selects time/frequency resource of UAVs by using iterative sorting algorithm. The simulation results verified that the proposed scheme improves data rate and packet delay performance in low complexity.

(A Study on the Control Mechanism for Network Survivability in OVPN over IP/GMPLS over DWDM) (DWDM기반의 OVPN에서 네트워크 생존성을 위한 제어 메커니즘 연구)

  • Cho Kwang-Hyun;Jeong Chang-Hyun;Hong Kyung-Dong;Kim Sung-Un
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.9 s.339
    • /
    • pp.85-96
    • /
    • 2005
  • A ' Virtual Private Network (YPN) over Internet' has the benefits of being cost-effective and flexible. However, given the increasing demands for high bandwidth Internet and for reliable services in a 'VPN over Intemet,' an IP/GMPLS over DWDM backbone network is regarded as a very favorable approach for the future 'Optical VPN (OVPN)' due to the benefits of transparency and high data rate. Nevertheless, OVPN still has survivability issues such that a temporary fault can lose a large amount of data in seconds, moreover unauthorized physical attack can also be made on purpose to eavesdrop the network through physical components. Also, logical attacks can manipulate or stop the operation of GMPLS control messages and menace the network survivability of OVPN. Thus, network survivability in OVPN (i.e. fault/attack tolerant recovery mechanism considering physical structure and optical components, and secured transmission of GMPLS control messages) is rising as a critical issue. In this Paper, we propose a new path establishment scheme under shared risk link group (SRLG) constraint for physical network survivability. And we also suggest a new logical survivability management mechanism by extending resource reservation protocol-traffic engineering extension (RSVP-TE+) and link management protocol (LMP). Finally, according to the results of our simulation, the proposed algorithms are revealed more effective in the view point of survivability.

Detection of Delay Attack in IoT Automation System (IoT 자동화 시스템의 지연 공격 탐지)

  • Youngduk Kim;Wonsuk Choi;Dong hoon Lee
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.5
    • /
    • pp.787-799
    • /
    • 2023
  • As IoT devices are widely used at home, IoT automation system that is integrate IoT devices for users' demand are gaining populrity. There is automation rule in IoT automation system that is collecting event and command action. But attacker delay the packet and make time that real state is inconsistent with state recongnized by the system. During the time, the system does not work correctly by predefined automation rule. There is proposed some detection method for delay attack, they have limitations for application to IoT systems that are sensitive to traffic volume and battery consumption. This paper proposes a practical packet delay attack detection technique that can be applied to IoT systems. The proposal scheme in this paper can recognize that, for example, when a sensor transmits an message, an broadcast packet notifying the transmission of a message is sent to the Server recognized that event has occurred. For evaluation purposes, an IoT system implemented using Raspberry Pi was configured, and it was demonstrated that the system can detect packet delay attacks within an average of 2.2 sec. The experimental results showed a power consumption Overhead of an average of 2.5 mA per second and a traffic Overhead of 15%. We demonstrate that our method can detect delay attack efficiently compared to preciously proposed method.

Performance Analysis of AAL2 Packet Dropping Algorithm using PDV on Virtual Buffer (PDV를 이용한 가상 버퍼상의 AAL2 패킷 폐기 알고리즘과 성능분석)

  • Jeong, Da-Wi;Jo, Yeong-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.1
    • /
    • pp.20-33
    • /
    • 2002
  • Usage of ATM AAL2 packets becomes dominant to increase transmission efficiency of voice traffic in the backbone network. In case of voice service that uses AAL2 mechanism, if resources of network are enough, connection of new call is accepted. However, due to packets generated by the new call, transmission delay of packets from old calls can increase sharply. To control this behavior, in this paper we present an AAL2 buffer management scheme that allocates a virtual buffer to each call and after calculating its propagation delay variation(PDV), decides to drop packets coming from each call according to the PDV value. We show that this packet dropping algorithm can effectively prevent abrupt QoS degradation of old calls. To do this, we analyze AAL2 packet composition process to find a critical factor in the process that influences the end-to-end delay behavior and model the process by K-policy M/D/1 queueing system and MIN(K, Tc)-policy M/D/1 queueing system. From the mathematical model, we derive the probability generating function of AAL2 packets in the buffer and mean waiting time of packets in the AAL2 buffer. Analytical results show that the AAL2 packet dropping algorithm can provide stable AAL2 packetization delay and ATM cell generation time even if the number of voice sources increases dramatically. Finally we compare the analytical result to simulation data obtained by using the COMNET Ⅲ package.

A Fairness Control Scheme in Multicast ATM Switches (멀티캐스트 ATM 스위치에서의 공정성 제어 방법)

  • 손동욱;손유익
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.134-142
    • /
    • 2003
  • We present an ATM switch architectures based on the multistage interconnection network(MIN) for the efficient multicast traffic control. Many of these applications require multicast connections as well as point-to-point connections. Muiticast connection in which the same message is delivered from a source to arbitrary number of destinations is fundamental in the areas such as teleconferencing, VOD(video on demand), distributed data processing, etc. In designing the multicast ATM switches to support those services, we should consider the fairness(impartiality) and priority control, in addition to the overflow problem, cell processing with large number of copies, and the blocking problem. In particular, the fairness problem which is to distribute the incoming cells to input ports smoothly is occurred when a cell with the large copy number enters upper input port. In this case, the upper input port sends before the lower input port because of the calculating method of running sum, and therefore cell arrived into lower input port Is delayed to next cycle to be sent and transmission delay time becomes longer. In this paper, we propose the cell splitting and group splitting algorithm, and also the fairness scheme on the basis of the nonblocking characteristics for issuing appropriate copy number depending on the number of Input cell in demand. We evaluate the performance of the proposed schemes in terms of the throughput, cell loss rate and cell delay.

Unlicensed Band Traffic and Fairness Maximization Approach Based on Rate-Splitting Multiple Access (전송률 분할 다중 접속 기술을 활용한 비면허 대역의 트래픽과 공정성 최대화 기법)

  • Jeon Zang Woo;Kim Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.12 no.10
    • /
    • pp.299-308
    • /
    • 2023
  • As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.