• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.153-159
• /
• 2005

In this paper, we propose All-Optical WDM Buffer System for resolving the contention of Packets in Optical Packet Switching System. The proposed system consists of tunable wavelength converters based on SOA, N×N AWG, and fiber delay lines. This structure can reduce ASE and cross-talk noise because the contending packets are sent and buffered through each different path determined by a wavelength routing. We also performed buffering experiment for two contending WDM optical pulses with each 50ns width, and found that the contending problem is resolved well.

• IE interfaces
• /
• v.4 no.1
• /
• pp.63-69
• /
• 1991

In this paper, the Go-Back-N ARQ protocol with decoding in communication network is considered. The time delay and throughput are respectively analyzed as a function of window size and decoding time out. Packets arrive continuously at the decoder, and are stored in a buffer if the decoder is busy upon its arrival. The decoder devotes no more than a time-out period of predetermined length to the decoding of any single packet. If packet decoding is completed within that period, the packet leaves the system. Otherwise, it is retransimitted and its decoding starts anew. The time delay and throughput are obtained using recursive formula and difference equation. An appropriate time out and window size that satisfies the grade of service can be determined.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.142-145
• /
• 1999

In this paper, delay performances are evaluated and compared for three dual-plane switch architectures; dual input queue/dual switching plane (DQDP The terms of DQDP, DQDP-PS and DQDP-GQ were not used in [Turner88], [Lee96] and [Son97]. All these tern are designated in this letter for convenience.) switch, DQDP with plane selector (DQDP-PS) switch and DQDP based on output group queueing (DQDP-OGQ) switch. We show that under random traffic these switches give almost identical delay performances to that of the output queueing switch but under bursty traffic only the DQDP-PS and the DQDP-OGQ switches ran do.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.12
• /
• pp.1208-1211
• /
• 2010

We propose a variable structure control design method for a class of multivariable uncertain state-delayed systems which can be represented by polytopic models. In terms of LMIs, we derive a sufficient condition for the existence of a linear sliding surface guaranteeing the asymptotic stability of the sliding mode dynamics. We parameterize the sliding surface by using the solution of the LMI existence condition. We also give a switching feedback control strategy guaranteeing stable sliding mode. By using a numerical example, we show that our method supplements the existing results and it can be better than the existing results.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.7
• /
• pp.76-91
• /
• 1996

In this paper, we proposed the new medium access control protocol for the virtual token bus netowrk. The network is applied to inter-processor communication network of large capacity digital switching system and digital mobile system with distributed control architecture. in the virtual token bus netowrk, the existing medium access control protocols hav ea switchove rtime overhead when traffic load is light or asymmetric according ot arbitration address of node that has message to send. The proposed protocol optimized average message delay using cyclic bus access chain to exclude switchover time of node that do not have message to send. Therefore it enhanced bus tuilization and average message delay that degrades the performance of real time communication netowrks. It showed that the proposed protocol is more enhacned than virtual token medium access control protocol and virtual token medium access control protocol iwth reservation through performance analysis.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.97-100
• /
• 1999

Mobile network applications are growing and this requires a fast and efficient transport method between the BS(Base Station) and the MSC(Mobile Switching Center). One possible solution is to use ATM and a voice CODEC standard which compresses 64kbps voice data to less than 8kbps. The low bit tate and small-sized packets made by the voice CODEC imply that significant amount of link bandwidth would be wasted, if this small-sized packet is carried by one ATM cell. The cell assembly delay increases if one ATM cell is fully filled with the small-sized packets. For the bandwidth-efficient transmission of low-rate, short, and variable length packets in delay sensitive applications, AAL-2 was standardized. This paper evaluates performance of AAL-2 by using voice CODEC standard.

• Journal of the Optical Society of Korea
• /
• v.18 no.5
• /
• pp.466-471
• /
• 2014

An asynchronous optical packet-switching (AOPS) node with load-balancing capability can achieve better performance in reducing the high packet-loss ratio (PLR) and time delay caused by unbalanced traffic. This paper proposes a novel dynamic load-balancing algorithm for an AOPS node with limited buffer and without wavelength converters, and considering the data flow distribution and service levels. By calculating the occupancy state of the output ports, load state of the input ports, and priorities for data flow, the traffic is balanced accordingly. Simulations demonstrate that asynchronous variant data packets and output traffic can be automatically balanced according to service levels and the data flow distribution. A PLR of less than 0.01% can be achieved, as well as an average time delay of less than 0.46 ns.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.2
• /
• pp.104-112
• /
• 2007

We developed a $7{\times}7$ parallel multiplier using LTPS-TFT. The proposed multiplier has multi-valued logic 7-3 Compressor with folding, 3-2 Compressor, and final carry propagation adder. Architecture minimized the carry propagation. And power consumption reduced by switching the current source to the circuit which is operated in current mode. The proposed multiplier improved PDP by 23%, EDP by 59%, and propagation delay time by 47% compared with Wallace Tree multiplier.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.