• Title/Summary/Keyword: gigabit networking

Search Result 9, Processing Time 0.03 seconds

ETRI신기술-Gigabit 정보통신 시스템 S/W 기술

  • Electronics and Telecommunications Research Institute
    • Electronics and Telecommunications Trends
    • /
    • v.14 no.4 s.58
    • /
    • pp.126-128
    • /
    • 1999
  • GIANT(Gigabit Information-processing And Networking Technology)는 초고속 정보통신망 환경에서 취급되어지는 멀티미디어 정보를 처리할 수 있는 플랫폼을 의미한다. GIANT는 분산 환경에서 컴퓨터를 이용하는 사용자간 공동작업을 가능하도록 지원하는 시스템으로 원격자의 사용자들은 영상/음성을 이용한 통신 기능과 정보/아이디어를 공유하는 데 필요한 보조 도구들을 활용하여 상호 대화 및 협동작업을 수행할 수 있다.

  • PDF

Systems Engineering Approaches for the System Software Development of Gigab it Informations-processing and Networking Technology (초고속 정보통신 시스템 소프트웨어 개발의 시스템 공학적 접근)

  • Min, Byeong-Ui;Yun, Seok-Hwan;Park, Seung-Min;Gung, Sang-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.87-96
    • /
    • 1997
  • As the society features evolve to information society, some advanced countries promote to construct the gigabit information and communication networks, to develop system software to operate these networks, and to develop application software to help end-user-daily-life as information infrastructure. In this paper, we will present the development methodologies of the Gigabit Information-processing and Networking Technology(GIANT) and the special features of configuration management system applied to GIANT project, and suggest some proposals about its utilization with respect to systems engineering point of view.

  • PDF

Physical-Layer Technology Trend and Prospect for AI-based Mobile Communication (AI 기반 이동통신 물리계층 기술 동향과 전망)

  • Chang, K.;Ko, Y.J.;Kim, I.G.
    • Electronics and Telecommunications Trends
    • /
    • v.35 no.5
    • /
    • pp.14-29
    • /
    • 2020
  • The 6G mobile communication system will become a backbone infrastructure around 2030 for the future digital world by providing distinctive services such as five-sense holograms, ultra-high reliability/low-latency, ultra-high-precision positioning, ultra-massive connectivity, and gigabit-per-second data rate for aerial and maritime terminals. The recent remarkable advances in machine learning (ML) technology have recognized its efficiency in wireless networking fields such as resource management and cell-configuration optimization. Further innovation in ML is expected to play an important role in solving new problems arising from 6G network management and service delivery. In contrast, an approach to apply ML to a physical-layer (PHY) target tackles the basic problems in radio links, such as overcoming signal distortion and interference. This paper reviews the methodologies of ML-based PHY, relevant industrial trends, and candiate technologies, including future research directions and standardization impacts.

An Efficient If Routing Lookup by Using Routing Interval

  • Wang, Pi-Chung;Chan, Chia-Tai;Chen, Yaw-Chung
    • Journal of Communications and Networks
    • /
    • v.3 no.4
    • /
    • pp.374-382
    • /
    • 2001
  • Nowadays, the commonly used table lookup scheme for IP routing is based on the sc-called classless interdomain routing (CIDR). With CIDR, routers must find out the best matching prefix (BMP) for IP packets forwarding, this complicates the IP lookup. Currently, this process is mainly performed in software and several schemes hale been proposed for hardware implementation. Since the IP lookup performance is a major design issue for the new generation routers, in this article we investigate the properties of the routing table and present a new approach for IP lookups, our approach is not based Gn BMP and significantly reduces the complexity, thus the computation cast of existing schemes can be significantly reduced. We also propose an efficient IP lookup algorithm, with which we improve the binary search on prefixes to 30 millions of packets per second (MPPS) and 5,000 route updates/s under the same experiment setup with an even larger routing table.

  • PDF

A Development Methodology for Quality Assurance System in Large-Scale Software Development Project (대규모 소프트웨어 개발 사업에서의 품질 보증을 위한 개발방법론)

  • 윤석환;박지은;신용백
    • Journal of Korean Society for Quality Management
    • /
    • v.25 no.1
    • /
    • pp.142-155
    • /
    • 1997
  • To successfully carry out large scale research projects while su, pp.rting quality assurance of research output, effective and systematic management through utilization of resources such as manpower, time and cost as well as engineering techniques such as component technology and design methodology is required. It is necessary to establish development methodology to su, pp.rt quality assurance. The development methodology covers the contents and procedures of the project, such as division of the project into independently executable units, allocation of resources including researchers, component technology, related know-how and equipment, deployment of research units and integration of the project at the end. In this paper we present systematic development methodology for quality assurance in large scale software development projects by analyzing the contents of the methodology a, pp.ied to the Gigabit Information-processing And Networking Technology development project(GIALT).

  • PDF

A Bit-Map Trie for the High-Speed Longest Prefix Search of IP Addresses (고속의 최장 IP 주소 프리픽스 검색을 위한 비트-맵 트라이)

  • 오승현;안종석
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.2
    • /
    • pp.282-292
    • /
    • 2003
  • This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.

Optimizing System Performance for Uncompressed HDTV over 10-Gigabit Ethernet (10 기가비트 이더넷 기반 비압축 HDTV의 인터넷 전송을 위한 시스템 최적화 연구)

  • Jo, Jin-Yong;Seok, Woo-Jin;Lee, Min-Sun;Byeon, Ok-Hwan
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.575-582
    • /
    • 2006
  • Guaranteeing network bandwidth and system performance becomes important technical matters to make seamless delivery of bulky data at high speed. Tuning system and network parameters including jumbo frame, kernel buffer size, and interrupt coalescence determines end-to-end transmission throughput. Additionally, fine-tuning of the parameters alleviates workload on high-end systems. Until now, many studies have concentrated on how to increase transmission throughput but rarely discussed how to mitigate system workload. In this paper, we have investigated various tuning parameters, which positively affect networking and processing performance of uncompressed HDTV system.

QoS-Guaranteed Realtime Multimedia Service Provisioning on Broadband Convergence Network(BcN) with IEEE 802.11e Wireless LAN and Fast/Gigabit Ethernet

  • Kim, Young-Tak;Jung, Young-Chul;Kim, Seong-Woo
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.511-523
    • /
    • 2007
  • In broadband convergence network(BcN), heterogeneous broadband wired & wireless subnetworks and various terminal equipments will be interconnected. In order to provide end-to-end realtime multimedia services on such heterogeneous networking environment, as a result, two major problems should be resolved: i) Multimedia session establishment & negotiation that adjusts the differences in the capability of multimedia data processing at the end terminal nodes, ii) quality of service(QoS)-guaranteed connection establishment or resource reservation with connection admission control(CAC) in each heterogeneous subnetworks along the path. The session layer signaling(e.g., SIP/SDP) should be extended for QoS negotiation, and must be tightly cooperating with network layer signaling or resource reservation with CAC function. In this paper we propose a session and connection management architecture for the QoS-guaranteed realtime multimedia service provisioning on BcN, with Q-SIP/SDP, resource reservation protocol with traffic engineering extension, and CAC functions. The detailed interaction scenario and related algorithms for QoS-guaranteed realtime multimedia session, resource reservation and connection establishment are explained and analyzed. From the experimental implementation of the proposed scheme on a small scale BcN testbed, we verified that the proposed architecture is applicable for the realtime multimedia service provisioning. We analyze the network performance and QoS parameters in detail.

An Optimization Tool for Determining Processor Affinity of Networking Processes (통신 프로세스의 프로세서 친화도 결정을 위한 최적화 도구)

  • Cho, Joong-Yeon;Jin, Hyun-Wook
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.2
    • /
    • pp.131-136
    • /
    • 2013
  • Multi-core processors can improve parallelism of application processes and thus can enhance the system throughput. Researchers have recently revealed that the processor affinity is an important factor to determine network I/O performance due to architectural characteristics of multi-core processors; thus, many researchers are trying to suggest a scheme to decide an optimal processor affinity. Existing schemes to dynamically decide the processor affinity are able to transparently adapt for system changes, such as modifications of application and upgrades of hardware, but these have limited access to characteristics of application behavior and run-time information that can be collected heuristically. Thus, these can provide only sub-optimal processor affinity. In this paper, we define meaningful system variables for determining optimal processor affinity and suggest a tool to gather such information. We show that the implemented tool can overcome limitations of existing schemes and can improve network bandwidth.