• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.123-132
• /
• 2014

Internet is composed of many independent networks referred to as Internet Service Providers (ISPs) and each provider is generally interconnected based on a commercial agreement. Though many countries are engaged in deregulation in internet interconnection, there is still debate whether the large ISPs are unwilling to peer with small providers, have incentives to lower the quality of data transmission of transit operators or set the interconnection charge regarding the actual costs incurred by the interconnection. Korean government introduced regulations in internet interconnection after observing noticeable anti-competitive behaviors from 2005. This paper analyzes whether there is margin squeeze problem/market concentration, and suggests political proposals in Korean regulation status.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.911-915
• /
• 1987

In this thesis, the architecture and design of IWS(Inter Working System) which interconnects two different networks (PSDN: Packet Switched Data Network, PSTN:Public Switched Telephone Network) are described. IWS provides interconnection services for the compatibility of communication between two networks. IWS consists of network interface protocols, protocol conversion facilities and management facilities.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.75-84
• /
• 2011

The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the graph is only four.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.10
• /
• pp.57-66
• /
• 2010

Today the various types of communication and application service are provided by the development of Internet and IP technologies. It is expected to be extended the service domain of two networks through the interconnecting P2PSIP overlay which is highlighted as an important technologies for Internet based services and IMS(IP Multimedia Subsystem) which is the new architecture adopted in the evolution of NGN. Therefore, this paper explains the possible methods of the service expansion with interconnecting P2PSIP overlay and IMS network. Specially this paper suggests the interconnection architectures of P2PSIP overlay and IMS network as subscriber's types and analyzes the traffic analysis model and session set up delay characteristics by simulation model. As a results, this paper shows that the interconnection architecture using gateway AS(Application Server) is the excellent method to interconnect the IMS in case of P2PSIP overlay only subscriber, and that interconnection architecture using I-CSCF is good method to interconnect the IMS in case of P2PSIP overlay and IMS subscriber.

• The KIPS Transactions:PartC
• /
• v.10C no.4
• /
• pp.463-470
• /
• 2003

Many types of switching fabrics have been proposed for use in ATM networks. Multistage Interconnection Networks (MINs) constitute a large class of ATM switching systems that are widely used in today´s internetworking. One of the most veil-known types of multistage networks is the banyan network. The banyan network is attractive for its simple routing scheme and low hardware complexity, but its throughput is very limited due to internal blocking and output contention. In this paper, we propose an input-buffered dual-banyan switch model with multiple switching fabric between switch input and output to avoid internal and Head-of Line blocking. By performance analysis and simulation, we show that our model has a lower ceil delay and 96% throughput which is much better than other banyan-type switch architecture.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.84-92
• /
• 2006

In this paper, we propose an efficient multicasting algorithm in multistage interconnection networks (MIN's) employing the region encoding scheme. The proposed algorithm uses the recursive scheme to recycle a multicast message at most two times through MIN, in order to send it to its desired destinations. It is composed of two recycling phases which are the copying phase and the routing phase of the multicast message. In the first phase, a source sends the message to a region that contains the largest number of destination regions, and destinations in these regions receive and store the message in this phase. The remaining destinations can finally receive the message in the second phase. This method of the algorithm can improve its performance by reducing the delay of message and the volume of traffic. Moreover, we evaluate the performance of our algorithm in terms of the average number of recycling and the number of internal links used per destination, comparing with the previously proposed algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2302-2311
• /
• 1998

The problem of scheduling general packet traffic on WDM optical interconnection networks is NP-complete, It is known that the list scheduling is a good approximation algurithm fur this problem, The resulting list schedules vary depending on the order of transmitters considered to be placed on each time slot We propose an improvement of the list scheduling that tries different orders of transmitters to obtain shorter schedule lengths, Genetic algorithms are used to explore various orders of transmitters.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1045-1057
• /
• 1999

Packet-switched multistage interconnection networks(MINs) have been widely used for digital switching systems and super computers. In this paper we show that multiple packets in a switching element can move to the succeeding switching element in one network cycle by fully utilizing the cycle bandwidth. Only one packet movement was usually assumed in typical MINs. we present an analytical model for the MNs with the multiple packet movement scheme, and validate it by computer simulation. Comparisons with the traditional MINs of single packet movement reveal that the throughput is increased up to about 30% for practical size MINs. Similar result was also obtained for delays. The performance increase is more significant when the network traffic is nonuniform.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.27-34
• /
• 2005

In this paper, we propose the Q-edge labeling method related to the graph embedding problem in binomial trees. This result is able to design a new reliable interconnection networks with maximum connectivity using Q-edge labels as jump sequence of circulant graph. The circulant graph is a generalization of Harary graph which is a solution of the optimal problem to design a maximum connectivity graph consists of n vertices End e edgies. And this topology has optimal broadcasting because of having binomial trees as spanning tree.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.10
• /
• pp.807-821
• /
• 1991

A mulitpath MIN(Multistage Interconnection Network), CSMP(Chained Shuffle Multi-Path) network, is proposed, having fault-tolerance and dynamic reroutability. The number of stages and the number of links between adjacent stagges are the same as in single path MINs, so the overall hardware complexity is considerably reduced in comparison with other multipath MINs. The CSMP networks feature links between switches belonging to the same state, forming loops of switches. The network can tolerate multiple faults, up to (N/4)*(log$_2$N-1), having occured in any stages including the first and the last ones(N:NO. of input). To analyze reliability, terminal reliability (TR) and mean time to failure( MTTE) age given for the networks, and the TR figures are compared to those of other static and dynamic rerouting multipath MINs. Also the MTTE figures are compared. The performance of the proposed network with respect to its bandwidth (BW) and probability of acceptance(PA) is analyzed and is compared to that of other more complex multipath MINs. The cost efficiency analysis of reliability and performance shows that the network is more cost-effective than other previously proposed fault-tolerant multipath MINs.