• Korean Journal of Digital Imaging in Medicine
• /
• v.5 no.1
• /
• pp.46-63
• /
• 2002

This thesis describes the effective interfacing methods of PACS Modality based on the system installation and operating experiences. PACS(Picture Archiving and Communication Systems) is a system for medical image archiving and communication using large storage device and high-speed network. The standard communication protocol of PACS is DICOM(Digital Imaging and Communication in Medicine) based on TCP/IP and point-to-point protocol. However, there are many Non-DICOM Modalities and DICOM Modalities having problems. First, we had interfaced almost modalities, Fuji CR, GE CT, MRI, Angio, Fluoro, Phillips Angio, Shimadzu Fluoro, Ultrasound PACS, with the main PACS in the Seoul S Hospital as large scale hospital. And we manipulated the intelligent image distribution and the CT, MRI Interfaces never experienced before in the Anyang J Hospital and the Chungju C Hospital as mid or small scale hospital. Technically, we developed both the DICOM Interface and the Non-DICOM Interface. At the last, the DICOM Worklist and the DICOM Print Interface were implemented in the Seoul B Hospital, the Bucheon SJ Hospital and the Seoul K Hospital independently with PACS. The Oracle, Sybase and MS-SQL are used as database, and UNIX, Macintosh, MS Windows as operating systems. And the Visual C++ and UNIX C are the main programming tools. We have used UTP, coaxial and fiber optic Gable under 10/100 mbps LAN for networking.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.3
• /
• pp.417-429
• /
• 1998

The advance of the MPEG (Moving Picture Expert Group) and the DSP (Digital Signal Processing) technologies lead the emergence of the information appliances, which are gradually digitalized and embedded the high-speed networking function. However, there are some difficulties in establishing any one specific model, since standardization of the scale and function of home ATM network is being progressed by standardization organizations and no absolute model has been defined. This paper consider topologies for a home ATM network, such a star-type, tree-type, and mesh-type topology, by comparing the structure, functional characteristics and performance. From this analysis we suggest the design method of the home ATM network.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.6
• /
• pp.1097-1106
• /
• 2011

Tactical Information Communication Network(TICN), a concept-type integrated Military Communication system that enables precise command control and decision making, is designed to advance into high speed, large capacity, long distance wireless relay transmission. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. Ad-hoc network works properly only if the participating nodes cooperate in routing and packet forwarding. However, if selfish nodes not forwarding packets of other nodes and malicious nodes making the false accusation are in the network, it is faced to many threats. Therefore, detection and management of these misbehaving nodes is necessary to make confident in Ad-hoc networks. To solve this problem, we propose an efficient intrusion detection technique to detect and manage those two types of attacks. The simulation-based performance analysis shows that our approach is highly effective and can reliably detect a multitude of misbehaving node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.133-151
• /
• 2019

In order to achieve faster content distribution speed and stronger fault tolerance, a P2P peer can connect to multiple peers in parallel and receive chunks of the data simultaneously. A critical issue in this environment is selecting a set of nodes participating in swarming sessions. Previous related researches only focus on performance metrics, such as downloading time or the round-trip time, but in this paper, we consider a new performance metric which is closely related to the network and propose a peer selection algorithm that produces the set of peers generating optimal worst link stress. We prove that the optimal algorithm is practicable and has the advantages with the experiments on PlanetLab. The algorithm optimizes the congestion level of the bottleneck link. It means the algorithm can maximize the affordable throughput. Second, the network load is well balanced. A balanced network improves the utilization of resources and leads to the fast content distribution. We also notice that if every client follows our algorithm in selecting peers, the probability is high that all sessions could benefit. We expect that the algorithm in this paper can be used complementary to existing methods to derive new and valuable insights in peer-to-peer networking.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1047-1054
• /
• 2022

With the advent of SDN, a next-generation network technology that separates the hardware and software areas of network equipment and defines the network using open source-based software, it solves the problems of complexity and scalability of the existing network system. It is now possible to configure a custom network according to the requirements. However, it has a structural disadvantage that a load on the network may occur due to a lot of control communication occurring between the controller and the switch, and many studies on network load distribution to effectively solve this have been preceded. In particular, in previous studies of load balancing techniques related to flow tables, many studies were conducted without consideration of flow entries, and as the number of flows increased, the packet processing speed decreased and the load was increased. To this end, we propose a new network load balancing technique that monitors flows in real time and applies dynamic flow management techniques to control the number of flows to an appropriate level while maintaining high packet processing speed.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.547-556
• /
• 2008

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose a network adaptive prefetching technique, NAP, for guarantee of constant QoS. The NAP prefetches frames by increasing the frame transmission rate while the available network bandwidth is high. The NAP uses the prefetched frames to guarantee the QoS while the available network bandwidth is low. The experiment result shows that the proposed NAP could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.593-602
• /
• 2005

Overlay multicast delivery method is a new approach in which multicast functionality is implemented at the end-hosts application layer in the timing of sparse deployment of IP multicast. However, existing overlay multicast protocols are not being standardization and many restrictions occur when delivering high capacity contents. Therefore, new delivery mechanism is required for the overlay multicast based high capacity contents delivery. In this paper. we separate group management and delivery management of overlay multicast and describe a capable group management. We also defined high speed delivery method better than that of existing overlay multicast through use of collaborated distribute downloading. This improved efficiency of massive contents transmission.

• The KIPS Transactions:PartA
• /
• v.16A no.5
• /
• pp.327-338
• /
• 2009

Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose a network adaptive prefetching technique, PAP, for guarantee of constant QoS. The PAP prefetches frames by increasing the frame transmission rate while the available network bandwidth is high. The PAP uses the prefetched frames to guarantee the QoS while the available network bandwidth is low and increases the playout interval to prevent buffer underflow. The experiment result shows that the proposed PAP could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

• Journal of Advanced Navigation Technology
• /
• v.23 no.4
• /
• pp.302-308
• /
• 2019

Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

• 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.