• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.907-917
• /
• 2000

In this paper the network costing model alternatives for reasonable interconnection charging are suggested. The current interconnection charge regimes is based on fully distributed costing method. Basically this method doesn't consider the common carrier's efficient network cost because it reflects the actual cost of network In this paper, 1 suggest the basic structure of the network costing model fur applications of incremental costing method that considers the efficient cost based on economics-prospective. And I classify network cost with capital cost and operating cost and analysis their reasonable costing methods.

• Journal of Information Technology Applications and Management
• /
• v.9 no.3
• /
• pp.97-111
• /
• 2002

This paper attempts to provide an overview of relationship between the characteristics of the network and competitive strategies. We review the theoretical background of the efficiency of network, which Is very important for the network-based industries. Network externality, positive feedback effects, bandwagon effects, economies of scale, economies of scope in network-base businesses are reviewed. Various network situations, including interconnection, and strategies are also discussed. In this purpose, simple but meaningful examples and cases are used to show the economic goals and means of network competition strategies. We try to link network strategies to the generic strategies and coopetition suggested by Porter and by Brandenburger and Nalebuff respectively. Since this study is an exploratory research, further studies on more complex network situation in the real work can be executed with taking advantage of this effort.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.1
• /
• pp.24-32
• /
• 2002

This paper is concerned with the fault diagnosis for stuck-at faults of a multistage interconnection network(MIM) which is a kind of interconnection networks in multicomputer systems. Up to the present, a fault diagnosis scheme has dealt with a fault model of all types, which results in complicated algorithms. In the literature, it is shown that a number of steps and computation are required for the fault detection and isolation algorithms for a class of MINs. In this paper, we propose a simple and easily implementable algorithm for the detection and isolation of the stuck-at fault in MIM. specifically, we develope an at algorithm for the isolation of the source fault in switching elements whenever tile stuck-at fault is detected in MINs. After all, the proposed algorithm is illustrated by an example of 16$\times$16 baseline networks of MINs.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.49-56
• /
• 2004

The performance of the multiprocessor systems is limited by the several factors. The system performance is affected by the processor speed, memory delay, and interconnection network bandwidth/latency. By the evolution of semiconductor technology, off the shelf microprocessor speed breaks beyond GHz, and the processors can be scalable up to multiprocessor system by connecting through the interconnection networks. In this situation, the system performances are bound by the latencies and the bandwidth of the interconnection networks. SCI, Myrinet, and Gigabit Ethernet are widely adopted as a high-speed interconnection network links for the high performance cluster systems. Performance improvement of the interconnection network can be achieved by the bandwidth extension and the latency minimization. Speed up of the operation clock speed is a simple way to accomplish the bandwidth and latency betterment, while its physical distance makes the difficulties to attain the high frequency clock. Hence the system performance and scalability suffered from the interconnection network limitation. Duplicating the link of the interconnection network is one of the solutions to resolve the bottleneck of the scalable systems. Dual-ring SCI link structure is an example of the interconnection network improvement. In this paper, I propose a network topology and a transaction path algorism, which optimize the latency and the efficiency under the duplicated links. By the simulation results, the proposed structure shows 1.05 to 1.11 times better latency, and exhibits 1.42 to 2.1 times faster execution compared to the dual ring systems.

• Journal of Information Technology Applications and Management
• /
• v.22 no.4
• /
• pp.59-76
• /
• 2015

The study on Wholesale pricing of MVNO using two way interconnection charge system is rare. This paper considers MVNO possessing its own facilities and subscribers. While previous studies focus on wholesale provision by MNO, this paper employs another approach from existing MVNO model. This paper introduces two way interconnection charge system by recognizing that mobile network interconnection is important to complete the call from MNO to MVNO as well as the call from MVNO to MNO. Also it is interesting to analyze wholesale pricing when there is brand loyalty between MNO and MVNO. This paper analyzes retail pricing and wholesale pricing under duopoly competition and drives social optimal solutions using linear city model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.4
• /
• pp.678-691
• /
• 2015

Internet and mobile traffic continues to surge exponentially in recent years due to popularization of smart devices, the appearance of various internet services carrying large amount of traffic from richer content and applications. This phenomenon leaded to various network problems such as the congestion delay, the non-balanced traffic ratio between ISPs, the continuous network investment cost and the Internet access problems. In light of changed data-driven communication ecosystem, There are growing concerns by both academia and industry that settlement-free peering and full transit regime have the limitations such as not only difficulties in maintaining mutual benefits but also difficulties in securing investment incentives for upgrading network performance and quality. Thus, it becomes more necessary for introducing the evolved internet interconnection regime which can fulfill the All-IP network environment. This study derives core issues regarding internet interconnection regime in Korea and suggest new evolved alternatives based on three point of view(traffic optimization, cost optimization, network investment optimization) through the empirical analysis.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.734-745
• /
• 2006

This paper presents a PC cluster-based distributed VOD server that minimizes the load of an interconnection network by adopting the VIA communication protocol and the interval cache algorithm. Video data is distributed to the disks of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large amount of video data transferred. This paper developed a distributed VOD file system, which is based on VIA, to minimize cost using interconnection network when accessing remote disks. VIA is a user-level communication protocol removing the overhead of TCP/IP. This papers also improved the performance of the interconnection network by expanding the maximum transfer size of VIA. In addition, the interval cache reduces traffic on the interconnection network by caching, in main memory, the video data transferred from disks of remote server nodes. Experiments using the distributed VOD server of this paper showed a maximum performance improvement of 21.3% compared with a distributed VOD server without VIA and the interval cache, when used with a four-node PC cluster.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.6
• /
• pp.263-272
• /
• 2008

We propose and analyze a new interconnection network, called petersen-torus(PT) network based on well-known petersen graph. PT network has a smaller diameter and a smaller network cost than honeycomb torus with same number of nodes. In this paper, we propose optimal routing algorithm and hamiltonian cycle algorithm. We derive diameter, network cost and bisection width.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.159-172
• /
• 2022

The role of the interconnect network, which connects computing nodes to each other, is important in high-performance computing (HPC) systems. In recent years, the peripheral component interconnect express (PCIe) has become a promising interface as an interconnection network for high-performance and cost-effective HPC systems having the features of non-transparent bridge (NTB) technologies. OpenSHMEM is a programming model for distributed shared memory that supports a partitioned global address space (PGAS). Currently, little work has been done to develop the OpenSHMEM library for PCIe-interconnected HPC systems. This paper introduces a prototype implementation of the OpenSHMEM library through a switchless interconnect network using PCIe NTB to provide a PGAS programming model. In particular, multi-interrupt, multi-thread-based data transfer over the OpenSHMEM shared memory model is applied at the implementation level to reduce the latency and increase the throughput of the switchless ring network system. The implemented OpenSHMEM programming model over the PCIe NTB switchless interconnection network provides a feasible, cost-effective HPC system with a PGAS programming model.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.63-66
• /
• 2001

In this paper, We propose the new interconnection network which is designed to edge numbering labeling using postorder traversal which can reduce diameter when it has same node number with Hypercube, which can reduce total node numbers considering node degree and diameter on Fibonacci trees and its jump sequence of circulant is Fibonacci numbers. It has a simple (shortest oath)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded to Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube.