• Journal of Digital Contents Society
• /
• v.5 no.3
• /
• pp.234-238
• /
• 2004

The system facilities in mobile communications networks are mainly classified into the coverage and usage in the viewpoint of the investments requirements. Based on the classification criterion, the interconnection charging between the wired operators art wireless operators is determined. In this paper, to decide the scale of the interconnection charging a new classification method is proposed by using the system capacity(Erlang, throughput) and subscriber`s estimated demand. The coverage ratio is first evaluated for each facility, and then more efficient interconnection charging model will be presented.

• Journal of Korea Technology Innovation Society
• /
• v.8 no.3
• /
• pp.1139-1156
• /
• 2005

The explosive growth in wireless networks and Internet services has created considerable demand for mobile Internet services based on the mobile phone. Mobile Internet has become the new business model in telecommunication market, therefore the open network policy for mobile Internet has been formulated and implemented by the government in Korea. In spite of the open network policy for mobile Internet, there has been no systematic analysis of the various interconnection issues, including pricing, in mobile Internet network. This paper aims to suggest the interconnection pricing methods for mobile Internet network by reviewing the current pricing models for various communications services, and adapting them to mobile Internet communications circumstances. Results of this paper can be used as a guideline for government policy directions and management decision making after the introduction of the open network policy for mobile Internet.

• The Journal of Information Technology
• /
• v.7 no.3
• /
• pp.119-126
• /
• 2004

In multicast traffic, an input can request to connect to up to a certain number of outputs. This reviews the multicast nonblocking multistage interconnection networks. In a multistage interconnection network each stage consists of crossbars of the same size. This paper focuses on the three-stage network and its recursive extensions. Not only will this article bring the literature upto date, but it also will provide some fresh viewpoints to either clarify or simplify some issues.

• The KIPS Transactions:PartA
• /
• v.18A no.5
• /
• pp.205-214
• /
• 2011

We propose a new interconnection network, called Twisted cube torus(TT) network based on well-known 3-dimensional twisted cube. Twisted cube torus network has smaller diameter and improved network cost than honeycomb torus with the same number of nodes. In this paper, we propose routing algorithm of Twisted cube torus network and analyze its diameter, network cost, bisection width and hamiltonian cycle.

• Journal of Internet Computing and Services
• /
• v.24 no.1
• /
• pp.27-37
• /
• 2023

In this paper, we define a new Lucas-Padoovan sequence using the Padovan sequence, and a new topological interconnection network is constructed using it. Coding nonnegative integers using subsequences of the Lucas-Padovan sequence, and using this to construct a new Lucas-Padovan cubes to deal with topological properties.

• Journal of information and communication convergence engineering
• /
• v.22 no.3
• /
• pp.215-220
• /
• 2024

This paper presents an efficient method for expanding interconnections in scenarios involving the reconstruction of interconnections across arbitrarily divided planes. Conventionally, such situations necessitate rebuilding interconnections based on all targets, ensuring minimal cost but incurring substantial time expenditure. In this paper, we present a tinkered tree algorithm designed to efficiently expand interconnections within a Euclidean plane divided into m randomly generated regions. The primary objective of this algorithm is to construct an optimal tree by utilizing the minimum spanning tree (MST) of each region, resulting in swift interconnection expansion. Interconnection construction is applied in various design fields. Notably, in the context of ad hoc networks, which lack a fixed-wired infrastructure and communicate solely with mobile hosts, the heuristic proposed in this paper is anticipated to significantly reduce costs while establishing rapid interconnections in scenarios involving expanded connection targets.

• Journal of Information Technology Services
• /
• v.12 no.3
• /
• pp.111-126
• /
• 2013

As the gaps become narrower in interconnection fee and volume rate, the MNOs began to introduce flat pricing for unlimited voice traffic competitively in Korea wireless telecommunication market : 'unlimited talks within intra-network' by the 1st operator, followed by the 3rd operator's 'unlimited talks over all networks'. As a result, subscribers tip in toward the third ranked operator and could bring a substantial change to steadfast market structure over the last decade in Korea. This paper aims to develop a simple economic model to analyze competition with flat pricing for unlimited voice traffic, and to check whether the pricing can be appropriate for the MNOs. The results show that MNOs already step in the necessary conditions to launch flat pricing for voice traffic. It also predicts that the MNOs compete with unlimited talk over all networks and set a single fee in an equilibrium. At present, the MNOs run virtually identical pricing for unlimited talk over all networks, considering their differentiation with respect to service quality, coverage and brand preference.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.4
• /
• pp.1889-1896
• /
• 2011

There has been a lot of researches to develop techniques that provide redundant paths, there by making Multistage Interconnection Networks(MINs) fault tolerant. So far, the redundant paths in MINs have been realized by adding additional hardware such as extra stages or duplicated data links. This paper presents a new MIN topology called Hierarchical MIN. The proposed MIN is constructed with 2.5N-4 switching elements, which are much fewer than that of the classical MINs. Even though there are fewer hardware than the classical MINs, the HMIN possesses the property of full access and also provides alternative paths for the fault tolerant. Furthermore, since there is the short cut in HMIN for the localized communication, it takes advantage of exploiting the locality of reference in multiprocessor systems. Its performance under varying degrees of localized communication is analysed and simulated.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.189-198
• /
• 2004

We consider the fault hamiltonian properties of m ${\times}$ n meshes with two wraparound links on the first row and the last row, denoted by M$_2$(m,n), (m$\geq$2, n$\geq$3). M$_2$(m,n), which is bipartite, with a single faulty link has a fault-free path of length mn-l(mn-2) between arbitrary two nodes if they both belong to the different(same) partite set. Compared with the previous works of P$_{m}$ ${\times}$C$_{n}$ , it also has these hamiltonian properties. Our result show that two additional wraparound links are sufficient for an m${\times}$n mesh to have such properties rather than m wraparound links. Also, M$_2$(m,n) is a spanning subgraph of many interconnection networks such as multidimensional meshes, recursive circulants, hypercubes, double loop networks, and k-ary n-cubcs. Thus, our results can be applied to discover fault-hamiltonicity of such interconnection networks. By applying hamiltonian properties of M$_2$(m,n) to 3-dimensional meshes, recursive circulants, and hypercubes, we obtain fault hamiltonian properties of these networks.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.9
• /
• pp.26-37
• /
• 2016

The core technologies of the current transport network are OAM and protection switching to meet the sub-50ms protection switching time via a path redundancy when a link or node failure occurs. The transport networks owned by public network operators, central/local governments, and major enterprises are individually configured and managed with service resiliency in each own protected sub-network. When such networks are cascaded, it is also important to provide a node resiliency between two protected sub-networks. However, the linear protection switching in packet transport networks, such as MPLS-TP and Carrier Ethernet, does not define a solution of dual node interconnection. Although Ethernet ring protection switching covers the dual node interconnection scheme, a large amount of duplicated data frames may be flooded when a failure occurs on an adjacent (sub) ring. In this paper, we suggest a dual node interconnection scheme with linear protection switching technology in multiple protected sub-networks. And we investigate how various protected sub-network combinations with a proposed linear or ring protection process impact the service resiliency of multiple protected sub-networks through extensive experiments on link and interconnected node failures.