• Title/Summary/Keyword: packet data

Search Result 1,644, Processing Time 0.031 seconds

High Speed Data Processing Unit Development Using Xilinx GTP Interface and DDR-2 Memory (Xilinx GTP 인터페이스와 DDR-2 메모리를 이용한 고속 데이터 처리 유닛 개발에 관한 연구)

  • Seo, In-Ho;Oh, Dae-Soo;Lee, Jong-Ju;Park, Hong-Young;Jung, Tae-Jin;Park, Jong-Oh;Bang, Hyo-Choong;Yu, Yong-Ho;Yoon, Jong-Jin;Cha, Kyung-Hwan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.8
    • /
    • pp.816-823
    • /
    • 2008
  • This paper describes the test results of developed high speed data processing unit using Xilinx GTP(Multi-Gigabit-Transceiver) interface and DDR-2 memory. The high speed data processing unit receives input data from packet generator at 1.25Gbps and transmits stored data to the data receiving system at 700Mbps. Therefore, DDR-2 memory controller and Xilinx GTP interface are implemented by FPGA instead of CPU to process high speed data directly.

An Efficient Load Balancing Technique Considering Forms of Data Generation in SDNs (SDN 환경에서의 데이터 생성 형태를 고려한 효율적인 부하분산 기법)

  • Yoon, Jiyoung;Kwon, Taewook
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.2
    • /
    • pp.247-254
    • /
    • 2020
  • The recent Internet environment is characterized by the explosion of certain types of data, as the data that people want is affected by certain issues. In this paper, we propose a load balancing technique that considers the data generation forms. The concept of this technique is to prioritize some type of data when it suddenly explodes. This is a technique to build an add-on middle box on a switch to monitor packets and give priority to a queue for load balancing. This technique worked when certain types of data exploded. SDN(Software Defined Networking) has the advantage of efficiently managing a number of network equipment. However, load balancing in the SDN environment has not been studied much. Applying the proposed load balancing technique in the SDN environment can save time and budget and easily implement our policies. When the proposed load balancing technique is applied to the SDN environment, it has been found that the techniques we want can be easily applied to the network systems, and that efficient data processing is possible when certain types of data explosion.

Privacy Level Indicating Data Leakage Prevention System

  • Kim, Jinhyung;Park, Choonsik;Hwang, Jun;Kim, Hyung-Jong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.3
    • /
    • pp.558-575
    • /
    • 2013
  • The purpose of a data leakage prevention system is to protect corporate information assets. The system monitors the packet exchanges between internal systems and the Internet, filters packets according to the data security policy defined by each company, or discretionarily deletes important data included in packets in order to prevent leakage of corporate information. However, the problem arises that the system may monitor employees' personal information, thus allowing their privacy to be violated. Therefore, it is necessary to find not only a solution for detecting leakage of significant information, but also a way to minimize the leakage of internal users' personal information. In this paper, we propose two models for representing the level of personal information disclosure during data leakage detection. One model measures only the disclosure frequencies of keywords that are defined as personal data. These frequencies are used to indicate the privacy violation level. The other model represents the context of privacy violation using a private data matrix. Each row of the matrix represents the disclosure counts for personal data keywords in a given time period, and each column represents the disclosure count of a certain keyword during the entire observation interval. Using the suggested matrix model, we can represent an abstracted context of the privacy violation situation. Experiments on the privacy violation situation to demonstrate the usability of the suggested models are also presented.

PM-MAC : An Efficient MAC Protocol for Periodic Traffic Monitoring In Wireless Sensor Networks (무선 센서 네트워크에서 주기적인 트래픽의 효율적인 모니터링을 위한 MAC 프로토콜)

  • Kim, Dong-Min;Kim, Seong-Cheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.7
    • /
    • pp.157-164
    • /
    • 2008
  • In this paper we suggest a scheduling algorithm that transmits periodic traffics efficiently in tree-structured wireless sensor networks (WSNs). The related research[l] showed the problems such as increasing the energy consumption and decreasing the data throughput as the depth of tree increases. To solve these problems. we use idle time slots and avoid the redundancy at data transmission. Also we suggest the algorithm that transmits the control packet when it is similar to a previously measured data. And if emergency data is occurred, our proposed algorithm transits that data in EDP(Emergency Data Period) for reducing the wait time. The proposed algorithm shows more data throughput and less energy consumption than that of the related research.

  • PDF

An Improvement of Performance for Data Downstream in IEEE 802.11x Wireless LAN Networks (IEEE 802.11x 무선 랜에서의 데이터 다운스트림 성능 향상)

  • Kim, Ji-Hong;Kim, Yong-Hyun;Hong, Youn-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.11 s.353
    • /
    • pp.149-158
    • /
    • 2006
  • We proposed a method for improving a performance of TCP downstream between a desktop PC as a fixed host and a PDA as a mobile host in a wired and wireless network based on IEEE 802.11x wireless LAN. With data transmission between these heterogeneous terminals a receiving time during downstream is slower than that during upstream by 20% at maximum. The reason is that their congestion window size will be oscillated due to a significantly lower packet processing rate at receiver compared to a packet sending rate at sender. Thus it will cause to increase the number of control packets to negotiate their window size. To mitigate these allergies, we proposed two distinct methods. First, by increasing a buffer size of a PDA at application layer an internal processing speed of a socket receive buffer of TCP becomes faster and then the window size is more stable. However, a file access time in a PDA is kept nearly constant as the buffer size increases. With the buffer size of 32,768bytes the receiving time is faster by 32% than with that of 512bytes. Second, a delay between packets to be transmitted at sender should be given. With an inter-packet delay of 5ms at sender a resulting receiving time is faster by 7% than without such a delay.

Operation and Analysis of Network for Multivendor PLC Group Management in the Wall Paper Process (발포 벽지 공정에서 이기종 PLC 그룹 관리를 위한 네트워크 운영과 해석)

  • Gang, Seong-Deok;Lee, Dong-Chun;Kim, Jeong-Ho;Lee, Sang-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.2
    • /
    • pp.283-294
    • /
    • 1996
  • To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the unit control devices located in common manufacturing zone and operated by connecting them. This paper introduces deign and test operation of cell system for the management of multivendor PLC by applying to wall paper process based on the manufacturing standardization of CIM. The analysis of designed multivendor PLC group is performed by selecting the parameters such as variation of data packet size and node number of PLC ladder logic program and variation by analyzing the corresponding variation values of token rotation time and waiting time for the system operation. For the method of the analysis,the equation is considering the overhead such as indicated packet service time and transmission safety margin for PLC network connection in M/G/1 queue model,and it is applied to the cell system and PLC group manage-ment for operation .Through the experiment,it is found that the realtime processing is possible with expanded and better result than the resuit obtained by Jayasumana.Browaka with PLC scan time considered,response lower limit of 10-20 msec. data packet size not more than 50 bytes.and the number of nodes less than 40.

  • PDF

An Efficient Secure Routing Protocol Based on Token Escrow Tree for Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 보안성을 고려한 Token Escrow 트리 기반의 효율적인 라우팅 프로토콜)

  • Lee, Jae Sik;Kim, Sung Chun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.4
    • /
    • pp.155-162
    • /
    • 2013
  • Routing protocol in ad hoc mobile networking has been an active research area in recent years. However, the environments of ad hoc network tend to have vulnerable points from attacks, because ad hoc mobile network is a kind of wireless network without centralized authentication or fixed network infrastructure such as base stations. Also, existing routing protocols that are effective in a wired network become inapplicable in ad hoc mobile networks. To address these issues, several secure routing protocols have been proposed: SAODV and SRPTES. Even though our protocols are intensified security of networks than existing protocols, they can not deal fluidly with frequent changing of wireless environment. Moreover, demerits in energy efficiency are detected because they concentrated only safety routing. In this paper, we propose an energy efficient secure routing protocol for various ad hoc mobile environment. First of all, we provide that the nodes distribute security information to reliable nodes for secure routing. The nodes constitute tree-structured with around nodes for token escrow, this action will protect invasion of malicious node through hiding security information. Next, we propose multi-path routing based security level for protection from dropping attack of malicious node, then networks will prevent data from unexpected packet loss. As a result, this algorithm enhances packet delivery ratio in network environment which has some malicious nodes, and a life time of entire network is extended through consuming energy evenly.

Multiple Description Coding of H.264/AVC Motion Vector under Data Partitioning Structure and Decoding Using Multiple Description Matching (데이터 분할구조에서의 H.264/AVC 움직임 벡터의 다중표현 부호화와 다중표현 정합을 이용한 복호화)

  • Yang, Jung-Youp;Jeon, Byeung-Woo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.6
    • /
    • pp.100-110
    • /
    • 2007
  • When compressed video data is transmitted over error-prone network such as wireless channel, data is likely to be lost, so the quality of reconstructed picture is severely decreased. It is specially so in case that important information such as motion vector or macroblock mode is lost. H.264/AVC standard includes DP as error resilient technique for protecting important information from error in which data is labeled according to its relative importance. But DP technique requires a network that supports different reliabilities of transmitted data. In general, the benefits of UEP is sought by sending multiple times of same packets corresponding to important information. In this paper, we propose MDC technique based on data partitioning technique. The proposed method encodes motion vector of H.264/AVC standard into multiple parts using MDC and transmits each part as independent packet. Even if partial packet is lost, the proposed scheme can decode the compressed bitstream by using estimated motion vector with partial packets correctly transmitted, so that achieving improved performance of error concealment with minimal effect of channel error. Also in decoding process, the proposed multiple description matching increases the accuracy of estimated lost motion vector and quality of reconstructed video.

A New Fair Call Admission Control for Integrated Voice and Data Traffic in Wireless Mobile Networks

  • Hwang, Young Ha;Noh, Sung-Kee;Kim, Sang-Ha
    • Journal of Information Processing Systems
    • /
    • v.2 no.2
    • /
    • pp.107-113
    • /
    • 2006
  • It is essential to guarantee a handoff dropping probability below a predetermined threshold for wireless mobile networks. Previous studies have proposed admission control policies for integrated voice/data traffic in wireless mobile networks. However, since QoS has been considered only in terms of CDP (Call Dropping Probability), the result has been a serious CBP (Call Blocking Probability) unfairness problem between voice and data traffic. In this paper, we suggest a new admission control policy that treats integrated voice and data traffic fairly while maintaining the CDP constraint. For underprivileged data traffic, which requires more bandwidth units than voice traffic, the packet is placed in a queue when there are no available resources in the base station, instead of being immediately rejected. Furthermore, we have adapted the biased coin method concept to adjust unfairness in terms of CBP. We analyzed the system model of a cell using both a two-dimensional continuous-time Markov chain and the Gauss-Seidel method. Numerical results demonstrate that our CAC (Call Admission Control) scheme successfully achieves CBP fairness for voice and data traffic.

An optimal link capacity problem of on-line service telecommunication networks (PSTN과 PSDN을 연결한 데이터 통신망의 회선할당에 관한 연구)

  • Kim, Byung-Moo;Lee, Young-Ho;Kim, Young-Hui;Kim, Yu-Hwan;Park, Seok-Ji;Kim, Joo-Sung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.2
    • /
    • pp.241-249
    • /
    • 1998
  • In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

  • PDF