• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.184-194
• /
• 1999

We present a new algorithm to minimize channel contention while sending multiple messages from multiple source to overlapped destination set on Multistage Interconnection Network (MIN) which supports wormhole routed turnaround routing. The multicast tree of the U-MIN(Unicast MIN) algorithm is useful in performing messages from one source to multiple destination but gives rise to a serious channel connection in performing multiple multicast because it has been designed for only single multicast. For multiple multicast communication on MIN, we address how to implement multiple multicast services efficiently. And a SPU-MIN(Source Partitioned Unicast MIN) algorithm is proposed and shown to be superior than the U-MIN algorithm for multiple multicast. The turnaround routing algorithm based on wormhole routing technique is employed as a message sending method.

• Journal of Digital Convergence
• /
• v.11 no.12
• /
• pp.479-485
• /
• 2013

Virtualization is a promising approach to consolidating multiple online services onto a smaller number of computing resources. A virtualized server environment allows computing resources to be shared among multiple performance isolated platforms called virtual machines. Through server virtualization software, applications servers are encapsulated into VMs, and deployed with APIs on top generalized pools of CPU and memory resources. Networking and security have been moved to a software abstraction layer that transformed computing, network virtualization. And it paves the way for enterprise to rapidly deploy networking and security for any application by creating the virtual network. Stochastic reward net (SRN) is an extension of stochastic Petri nets which provides compact modeling facilities for system analysis. In this paper, we develop SRN model of network virtualization based on virtual switch. Measures of interest such as switching delay and throughput are considered. These measures are expressed in terms of the expected values of reward rate functions for SRNs. Numerical results are obtained according to the virtual switch capacity and number of active VMs.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.167-174
• /
• 1999

In this paper, we propose the adaptive separated-queueing ATM switching model for the effective processing of the various types of multimedia traffic by virtue of ATM switching network with multiple outlets which is the essential part of B-ISDN. This proposed model employs the dynamically separated buffering mechanism in the processing of two classes of cell, realtime service traffic and non-realtime service traffic, at the output buffer to enhance the overall QoS(Quality of Service). The adopted ATM switch architecture has Batcher-banyan based network, but it uses different topologies and control techniques 6to resolve the cell contention. For the performance evaluation of our proposed method, we have done both analytical modeling and simulation. The both results show that our proposed queueing strategy is quite appropriate to the ATM switch with multiple outlets and can quarantee the QoS requirements of the incoming multimedia traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1139-1151
• /
• 2002

In this paper, we propose the novel module-type optical space switch, employing time division multiplexing (TDM) method and multihop structure, in order to enlarge the capacity of the switching system. And we show that the proposed structure is superior over conventional ones, in terms of power loss, the number of the devices used, and signal to crosstalk (SXR). We also analyze the saturation throughput with the number of module M. As a result, the saturation throughput of the switching system with M modules is M+ 1-√(M$^2$+1), when the number of input port in a module (N) is large. Finally, we confirmed the cell loss rate (CLR) performance with the proposed switch through simulation. For example, when p=0.9, M=8 and N=32, to get the CLR that is less than or equal to 10$\^$-6/, the number of input buffers storage unit is greater than or equal to 6 and output buffers storage unit is greater than or equal to 52.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.73-80
• /
• 2004

In this paper, we present the cell resequencing buffer to solve the cell sequence integrity problem of the Cyclic banyan network that is a high-performance fault-tolerant cell switch. By offering multiple paths between input ports and output ports, using the deflection self-routing, the Cyclic banyan switch offer high reliability, and it also solves congestion problem for the internal links of the switch. By the way, these multiple paths can be different lengths for each other. Therefore, the cells departing from an identical source port and arriving at an identical destination port can reach to the output port as the order that is different from the order arriving at input port. The proposed cell resequencing buffer is a hardware sliding window mechanism. to solve such cell sequence integrity problem. To calculate the size of sliding window that cause the prime cost of the presented device, we analyzed the distribution of the cell delay through the simulation analyses under traffic load that have a nonuniform address distribution that express tile Property of traffic of the Internet. Through these analyses, we found out that we can make a cell resequencing buffer by which the cell sequence integrity is to be secured, by using a, few of ordinary memory and control logic. The cell resequencing buffer presented in this paper can be used for other multiple paths switching networks.

• Proceedings of the KIPE Conference
• /
• 2014.07a
• /
• pp.165-166
• /
• 2014

기존 LED(Light Emitting Diode) 전류 제어용 SSPR(Secondary Side Post Regulator) 스위치를 갖는 구조의 다중출력 컨버터는 LED 정 전류 제어를 위한 별도의 부스트 컨버터 없이 전류제어가 가능하여 원가 및 부피 저감과 효율이 상승하는 장점이 있다. 하지만, 주 출력단(Master)의 피드백을 받아 1차 측 메인 스위치를 제어하게 되어 제어 회로가 복잡하고 주 출력단 부하 변동에 의해 부 출력단(Slave)의 크로스-레귤레이션(Cross-Regulation) 특성이 좋지 않은 단점이 있다. 따라서, 본 논문에서는 기존 SSPR 스위치의 장점을 갖고 주 출력 단의 부하 변동에도 부 출력단의 크로스-레귤레이션 특성이 좋은 새로운 직렬 공진형 LED 구동회로를 제안한다. 최종적으로 제안 회로를 4채널 LED 구동회로에 적용하여 그 실험결과를 바탕으로 제안 회로의 타당성을 검증하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2A
• /
• pp.201-206
• /
• 2006

A SPST Switch MMIC which used for Microwave Switch Matrix(MSM) of communications satellite payload with multi-beam function has been designed and fabricated. New RE FET switch configuration has been devised to improve power characteristics and isolation. Input and output return losses are better than another switches reported previously for both On and Off states. The MMIC chips were fabricated in 0.15um GaAs pHEMT process and measured insertion loss less than 2.0dB and isolation more than 63dB in the frequency range of 3GHz$\∼$4GHz. Output 3rd order interceptpoint above 32dBm has been recorded and the value is very high even though the unit pHEMT has gate width of 0.2mm and only four pHEMT are used in the MMTC.

• Proceedings of the Optical Society of Korea Conference
• /
• 2000.02a
• /
• pp.78-79
• /
• 2000

재구성이 가능한 광 크로스-커넥트(optical cross connect)는 전광 네트워크를 구성하기 위한 핵심소자 중의 하나이다. 일반적인 구조의 파장분배기는 공간분할 스위치(space division switch)를 두 쌍의 파장 다중화기(multiplexer)와 역다중화기(demultiplexer)의 가운데에 삽입하여 구현된다$^{(1)}$ . 최근에, 광섬유 브래그 격자와 광스위치 쌍을 직렬 연결하여 재구성이 가능한 광 크로스-커넥트가 제안되었다$^{(2)}$ . 그러나, 이 구조는 광신호에 따라 광섬유 브래그 격자에 반사되면서 겪는 광스위치에 의한 삽입손실이 다르다는 문제점이 있다. 이러한 문제를 해결하기 위하여 본 논문에서는 한 쌍의 파장 다중화기/역다중화기와 파장가변 광섬유 브래그 격자를 이용한 새로운 구조의 광 크로스-커넥트를 제안하고자 한다. 또한, 제안된 구조는 일반적인 구조의 파장분배기에 비해 파장 다중화기/역다중화기의 개수를 반으로 줄일 수 있는 장점이 있다. (중략)

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.523-525
• /
• 2001

MPLS(Multi-Protocol Label Switching)망에서 LSP(Label Switched Path)의 수와 레이블 수를 줄이는 것은 망 자원 관리 측면에서 매우 중요하다. 다중점대점(Multipoint-to-Point) LSP[1]는 이러한 요구사항으로 제안되었다. 하나의 다중점대점 LSP는 다수의 망 입구 노드로부터 하나의 망 출구 노드까지의 경로를 나타낸다. 다중 점대점 LSP는 미리 정의된 경로이다. 망 형태 정보가 빈번히 변하는 실제 망을 고려할 대 다중점대점 LSP는 경로가 신속히 재결정될 필요가 있다. 본 논문에서는 망의 트래픽 부하 균형을 위해 Monte-Carlo 시뮬레이션을 이용한 빠른 LSP 결정 방법을 제시한다. 또한 경로 결정시 Greedy 알고리즘을 사용하므로 최적의 다중점대점 LSP 결정에 접근하는 경로를 결정한다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.96-106
• /
• 2009

Extending the scale of the distributed processing in a single Ethernet cluster is physically restricted by maximum ports per switch. This paper presents an implementation of MPI-based multicluster consisting of multiple Ethernet switches for extending the scale of distributed processing, and a asymptotical analysis for communication overhead through execution-time analysis model. To determine an optimum task partitioning, we analyzed the processing time for various partitioning schemes, and AAP(accumulator array partitioning) scheme was finally chosen to minimize the overall communication overhead. The scope of data partitioned in AAP was modified to fit for incremented nodes, and suitable load balancing algorithm was implemented. We tried to alleviate the communication overhead through exploiting the pipelined broadcast and flat-tree based result gathering, and overlapping of the communication and the computation time. We used the linear pipeline broadcast to reduce the communication overhead in intercluster which is interconnected by a single link. Experimental results shows nearly linear speedup by the proposed parallel distributed GHT implemented on MPI-based Ethernet multicluster with four 100Mbps Ethernet switches and up to 128 nodes of Pentium PC.