• Journal of Communications and Networks
• /
• v.1 no.3
• /
• pp.145-152
• /
• 1999

A new switch architecture is presented to enhance out-put queuing in photonic packet switches. Its appkication is for a packet switching enviroment based on the optical transport of fixed length packets. This architecture consists of a couple of cas-cading switching elements with output queuing, whose buffer ca-pacity is limited by photonic technology. The introduction of a suitable buffer management allows a very good and balanced ex-ploitation of the available optical memories, realized with fiber de-lay lines. In particular, packet loss performance is here evaluated showing the improvement with respect to the single switch and a way to design large optical switches is shown in order to meet broadband network requirements.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.551-555
• /
• 2011

Optical packet switching is a promising technology, which can integrate both data and optical network. In this paper, we present a comparative study of various traffic arrival approaches in WDM packet switches. The comparison is made based on packet loss rate and average delay under uniform and self-similar Pareto traffic. Computer simulations are performed in order to obtain the switch performance metrics. Study shows that burstiness of data traffic has a strong negative impact in the performance of WDM packet switches.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.330-341
• /
• 2007

This work analyzes the performance of the parallel packet switch (PPS) with a sliding window (SW) method. The PPS involves numerous packet switches that operate independently and in parallel. The conventional PPS dispatch algorithm adopts a round robin (RR) method. The class of PPS is characterized by deployment of parallel low-speed switches whose all memory buffers run more slowly than the external line rate. In this work, a novel SW packet switching method for PPS, called SW-PPS, is proposed. The SW-PPS employs memory space more effectively than the existing PPS using RR algorithm. Under identical Bernoulli and bursty data traffic, the SW-PPS provided significantly improved performance when compared to PPS with RR method. Moreover, this investigation presents a novel mathematical analytical model to evaluate the performance of the PPS using RR and SW method. Under various operating conditions, our proposed model and analysis successfully exhibit these performance characteristics including throughput, cell delay, and cell drop rate.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.469-472
• /
• 2005

To enhance the scalability of high performance packet switches, a two-stage load-balanced switch has recently been introduced, in which each stage uses a deterministic sequence of configurations. The switch is simple to make scalable and has been proven to provide 100% throughput. However, the load-balanced switch may mis-sequence the packets. In this paper, we propose an algorithm called full frame stuff (FFS), which maintains packet order in the two-stage load-balanced switch and has excellent switching performance. This algorithm is distributed and each port can operate independently.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.3
• /
• pp.136-142
• /
• 2006

Existing buffer management schemes for shared-memory output queueing switches can be classified into two types: In the first type, some constant amount of memory space is guaranteed to each virtual queue using static queue thresholds. The static threshold method (ST) belongs to this type. On the other hand, the second type of approach tries to maximize the buffer utilization in 머 locating buffer memories. The complete sharing (CS) method is classified into this type. In the case of CS, it is very hard to protect regular traffic from mis-behaving traffic flows while in the case of ST the thresholds can not be adjusted according to varying traffic conditions. In this paper, we propose a new buffer management method called weighted dynamic thresholds (WDT) which can process packet flows based on loss priorities for quality-of-service (QoS) functionalities with fairly high memory utilization factors. We verified the performance of the proposed scheme through computer simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.855-868
• /
• 2012

In this paper, we consider the discrete memoryless user relaying channel (DMURC) in which a user-relay switches its operational mode symbol-by-symbol. In particular, we obtain upper and lower bounds on the channel capacity for the general DMURC and then show that these the upper and lower bounds coincide for degraded DMURC. It is also shown that the capacity of the degraded DMURC can be achieved using two separate codebooks corresponding to the two UR states. While the UR is assumed to switch states symbol-by-symbol, the results in this paper is the same as when the UR switches states packet-by-packet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.80-86
• /
• 2003

High speed networking applications like video-on-demand require the support of switches that can handle very high multicast loads. Switches studied in the past can support multicast loads of 25${\sim}$30% To overcome this limitation, Tandem Expanded Delta Network(TEDN) multicast switch was proposed to support more higher multicast load by 85${\sim}$90% without degradation in the performance But there is tremendous routing capacity that is not used in the series of routing network blocks. This paper presents modified TEDN multicast switches to save the excessive routing capacity. by recirculating packets in last routing network, we can achieve the acceptable packet loss ratio with the smaller number of routing network blocks. Extensive simulations show that our proposed switches have the acceptable packet loss ratio with reduced hardware cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.733-750
• /
• 2019

Software Defined Networking (SDN) is a new network paradigm, allowing administrators to manage networks through central controllers by separating control plane from data plane. So, one or more controllers must locate outside switches. However, this separation may cause delay problems between controllers and switches. In this paper, we therefore propose a Priority-based Scheduling policy for OpenFlow (PSO) to reduce the delay of some significant traffic. Our PSO is based on packet prioritization mechanisms in both OpenFlow switches and controllers. In addition, we have prototyped and experimented on PSO using a network simulator (ns-3). From the experimental results, PSO has demonstrated low delay for targeted traffic in the out-of-brand control network. The targeted traffic can acquire forwarding rules with lower delay under network congestion in control links (with normalized load > 0.8), comparing to traditional OpenFlow. Furthermore, PSO is helpful in the in-band control network to prioritize OpenFlow messages over data packets.

• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.332-338
• /
• 2008

This paper handles, implementation of multiple access bidirectional serial communications protocol using two common DC power lines, whict are power supply and ground, connecting multiple devices. Communication between the host and the multiple clients are performed using unique packet data with device ID unique to each devices connected on the common power lines. Host initiates data communications by transmitting command packet to the designated client with the client's ID and the client responds by transmitting response packet to the host and in this way, multiple clients and host exchange the packet through the common power lines. The normal voltage of the power communication line maintains 24V corresponding to level 1 and the host drops the voltage to 12V on sending level 0 signal, also the clients normally keeps the line voltage to 24V use pull-down circuit to drop the voltage to 12V on sending level 1 signal. Power supply originates from the host, the host senses the voltage level of the power communication lines and when the clients activates pull down circuit to send level 0 signal and the voltage drops to 12V, the hosts switches power source from 24V to 12V. Also, when clients deactivate pull down circuit to send level 1 signal, the host senses the voltage increase and switches the power source from 12V to 24V. Experimental circuit is designed with one hosts and four clients and verified the power line voltage switching operation depending on the data signal levels on the power line. The proposed research result can be applied to two wire power communications system with one host and multiple low current consumption clients.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.937-944
• /
• 2002

The current fast-growing Internet traffic is demanding more and more network capacity. Photonic packet switching offers high-speed, data rate/format transparency, and configurability, which are some of the important characteristics needed in future networks supporting different forms of data. In this paper, we define that optical backbone networks for IP transport consist of optical packet core switches and optical fibers. We propose a multi-link photonic packet switch managing as single media which unifies the whole bandwidth of multiple wavelengths on the optical fiber in the WDM optical networks. The proposed switch uses optical packet memories of output link equally as well as using the WDM buffer. So it cuts down the required number of buffers and realizes of the optical packet memory economically.