• Title/Summary/Keyword: 통신량

Search Result 4,530, Processing Time 0.033 seconds

UDP with Flow Control for Myrinet (Myrinet을 위한 흐름 제어 기능을 갖는 UDP)

  • Kim, Jin-Ug;Jin, Hyun-Wook;Yoo, Hyuck
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.5
    • /
    • pp.649-655
    • /
    • 2003
  • Network-based computing such as cluster computing requires a reliable high-speed transport protocol. TCP is a representative reliable transport protocol on the Internet, which implements many mechanisms, such as flow control, congestion control, and retransmission, for reliable packet delivery. This paper, however, finds out that Myrinet does not incur any packet losses caused by network congestion. In addition, we ascertain that Myrinet supports reliable and ordered packet delivery. Consequently, most of reliable routines implemented in TCP produce unnecessarily additional overheads on Myrinet. In this paper, we show that we can attain the reliability only by flow control on Myrinet and propose a new reliable protocol based on UDP named RUM (Reliable UDP on Myrinet) that performs a flow control. As a result, RUM achieves a higher throughput by 45% than TCP and shows a similar one-way latency to UDP.

A Mode Selection Algorithm using Scene Segmentation for Multi-view Video Coding (객체 분할 기법을 이용한 다시점 영상 부호화에서의 예측 모드 선택 기법)

  • Lee, Seo-Young;Shin, Kwang-Mu;Chung, Ki-Dong
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.3
    • /
    • pp.198-203
    • /
    • 2009
  • With the growing demand for multimedia services and advances in display technology, new applications for 3$\sim$D scene communication have emerged. While multi-view video of these emerging applications may provide users with more realistic scene experience, drastic increase in the bandwidth is a major problem to solve. In this paper, we propose a fast prediction mode decision algorithm which can significantly reduce complexity and time consumption of the encoding process. This is based on the object segmentation, which can effectively identify the fast moving foreground object. As the foreground object with fast motion is more likely to be encoded in the view directional prediction mode, we can properly limit the motion compensated coding for a case in point. As a result, time savings of the proposed algorithm was up to average 45% without much loss in the quality of the image sequence.

Design and Implementation of Realtime Information Service based on Ubiquitous Sensor Network Using MySQL and Tiny-DB (Tiny-DB와 MySQL을 이용한 유비쿼터스 센서 네트워크 기반의 실시간 정보 서비스 설계 및 구현)

  • Kang, Kyoung-Ok;Kim, Yong-Woo;Kwon, Hoon;Kim, Bu-Rim;Kim, Do-Hyeun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.2
    • /
    • pp.175-181
    • /
    • 2006
  • Wireless sensor network forms the self-organization network, and transfers the information among sensor nodes that have computing technology ability and wireless communication ability. The recent sensor network is study for low-power, micro, low cost of node is proceeded. Recently, the research of application services in wireless sensor networks is proceeded. Therefore, in this paper, we design the prototype of the real-time information service that support a user the information of temperature, illumination etc. And, we implement the alarm application service fer the disaster prevention on Internet base on IPv4/IPv6. We develop the module of the extract information using the query processing based on TinyOS, and the module of the server's database using MySQL data base management system and JDBC. Additionally, we develop the client module that receive the real-time sensing data using ODBC in Internet based on IPv4/IPv6.

  • PDF

Plat-Based Key Pre-Distribution Scheme in Sensor Network (센서네트워크에서 평면 그리드 기반의 키 선 분배 기법)

  • Maeng, Young-Jae;Mohaisen, Abedelaziz;Lee, Kyung-Hee;Nyang, Dae-Hun
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.1-8
    • /
    • 2008
  • The security of wireless sensor networks is a challenging research area where the resources constraints are a bottleneck for any successful security design. Due to their computational feasibility, symmetric key algorithms that require key pre-distribution are more desirable for use in these networks. In the pre-distribution scheme, keys or keying materials are assigned to each node prior deployment to guarantee a secure communication within the entire network. Though several works are introduced on this issue, yet the connectivity and resiliency are imperfectly handled. In this paper, we revisit the grid based key pre-distribution scheme aiming to improve the connectivity, introduce a higher resiliency level, simplify the logic of key establishment and maintain same level of used of resources usage. The core of our modification relies on introducing the novel plat-based polynomial assignment and key establishment mechanism. To demonstrate the advantageous properties of our scheme over the revisited one, details of consumed resources, resulting connectivity, security and comparisons with relevant works are introduced.

Log Analysis Method of Separate Security Solution using Single Data Leakage Scenario (단일 정보유출 시나리오를 이용한 개별 보안솔루션 로그 분석 방법)

  • Park, Jang-Su;Lee, Im-Yeong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.2
    • /
    • pp.65-72
    • /
    • 2015
  • According to recent statistics published by the National Industrial Security Center, former and current employees are responsible for 80.4% of companies' technology leakages, and employees of cooperative firms are responsible for another 9.6%. This means that 90% of technology leakages are intentionally or mistakenly caused by insiders. In a recent incident, a credit card company leaked private information, and the person responsible was an employee of a cooperative firm. These types of incidents have an adverse effect not only on a company's assets but also on its reputation. Therefore, most institutions implement various security solutions to prevent information from being leaked. However, security solutions are difficult to analyze and distinguish from one another because their logs are independently operated and managed. A large number of logs are created from various security solutions. This thesis investigates how to prevent internal data leakage by setting up individual scenarios for each security solution, analyzing each scenario's logs, and applying a monitoring system to each scenario.

Sensor Data Abstraction and Utilization in Environmental Monitoring System based on Geosensor Network (지리 센서 네트워크 기반 환경 모니터링 시스템에서의 센서 데이터 추상화 및 활용)

  • Jung, Young-Jin
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.177-184
    • /
    • 2009
  • Environmental monitoring systems are widely developed for analyzing environment and understanding an ecosystem according to the advance of wireless communication and various sensing techniques. To extract useful information, it requires high cost for processing a query, because these systems have to handle huge volume of raw sensor data which is transmitted from a wide area in environmental monitoring applications. Besides, it is also hard to answer an user defined query which requests to check current and near future condition. In this paper, we propose the monitoring system structure for processing a user defined query for environmental monitoring. It also describes the utilization of sensor data filtering and abstraction model. The designed abstraction model which is based on the slope grid in GIS supports fast data access and update. To analyze condition, the extracted data from abstraction model of each sensor type is combined in a query processor. It is useful to provide meaningful information to users.

Improving Search Performance of Tries Data Structures for Network Filtering by Using Cache (네트워크 필터링에서 캐시를 적용한 트라이 구조의 탐색 성능 개선)

  • Kim, Hoyeon;Chung, Kyusik
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.6
    • /
    • pp.179-188
    • /
    • 2014
  • Due to the tremendous amount and its rapid increase of network traffic, the performance of network equipments are becoming an important issue. Network filtering is one of primary functions affecting the performance of the network equipment such as a firewall or a load balancer to process the packet. In this paper, we propose a cache based tri method to improve the performance of the existing tri method of searching for network filtering. When several packets are exchanged at a time between a server and a client, the tri method repeats the same search procedure for network filtering. However, the proposed method can avoid unnecessary repetition of search procedure by exploiting cache so that the performance of network filtering can be improved. We performed network filtering experiments for the existing method and the proposed method. Experimental results showed that the proposed method could process more packets up to 790,000 per second than the existing method. When the size of cache list is 11, the proposed method showed the most outstanding performance improvement (18.08%) with respect to memory usage increase (7.75%).

Analysis Scheme on Backup Files of Samsung Smartphone available in Forensic (포렌식에서 활용 가능한 삼성 스마트폰 백업 파일 분석 기법)

  • Lee, Gyuwon;Hwang, Hyunuk;Kim, Kibom;Chang, Taejoo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.8
    • /
    • pp.349-356
    • /
    • 2013
  • As various features of the smartphone have been used, a lot of information have been stored in the smartphone, including the user's personal information. However, a frequent update of the operating system and applications may cause a loss of data and a risk of missing important personal data. Thus, the importance of data backup is significantly increasing. Many users employ the backup feature to store their data securely. However, in the point of forensic view these backup files are considered as important objects for investigation when issued hiding of smartphone or intentional deletion on data of smartphone. Therefore, in this paper we propose a scheme that analyze structure and restore data for Kies backup files of Samsung smartphone which has the highest share of the smartphone in the world. As the experimental results, the suggested scheme shows that the various types of files are analyzed and extracted from those backup files compared to other tools.

A Study on The Adaptive Equalizer Using High Order Statistics in Multipath Fading Channel (다중 경로 페이딩 채널에서 고차 통계치를 이용한 적응 등화기에 관한 연구)

  • Lim, Seung-Gag
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2562-2570
    • /
    • 1997
  • This paper deals with the design and performance of the adaptive equalizer using high order statistics in order to improve the transmission characteristics of multipath fading channel. The multipath propagational phenomenon occurred in digital radio transmission causes the distortion and ISI of receiving signal. These are main reasons to increase the bit error rate and degrade the performance of receivers. In this paper, the adaptive equalization algorithm using high order statistics of received signal is used instead of CMA algorithm, Bussgang and Godard which are known widely. The performance of this algorithm (residualisi, recovered constellation, calculation) is presented varing SNR. As the result of the computer simulation, equalizer algorithm using high order statistics is better than CMA in the range of low SNR, $10{\sim}20dB$. Therefore, considering the actual communication systems which use the range of $14{\sim}20$ SNR, the adaptive equalizer using high order statistics can be used in the real multipath fading environment.

  • PDF

3차 저장 장치의 장착을 위한 MIDAS-II의 확장

  • Kim, Yeong-Seong;Gang, Hyeon-Cheol;Kim, Jun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.1
    • /
    • pp.21-35
    • /
    • 2000
  • MIDAS-II is the storage system for BADA DBMS developed at ETRI. This paper describes the extension of MIDAS-II for incorporating the tertiary storage device such as an optical disk jukebox or a tape library, enabling MIDAS-II to function as a storage system of the data server that stores a massive amount of multimedia data. The MIDAS-II disk volume structure is extended to efficiently function as a volume for the tertiary storage device with multiple platters, which canstore huge amount of data of the order of tera bytes. The storage structure of the LOB is changed to efficiently manage the LOB data in the tertiary storage device. The data structures of the shared memory, the process structure, and the utilities in MIDAS-II are also extended to efficiently incorporating the tertiary storage device. The functionalities of each MIDAS-II API function are expanded to handle the tertiary storage device, while the prototypes of those functions are intact in order not to affect the existing application programs. The performance evaluation shows that the extended MIDAS-II works effectively with the tertiary storage device. All these extensions and the performance evaluation are conducted in the SunOS 5.4 environment.

  • PDF