• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.267-270
• /
• 2002

Downlink Shared Channel (OSCH) is used for high-speed packet service transmission in WCOMA. The power-controlled performances of the OSCH are studied through simulation works. Under various channel conditions and mobile speeds, the simulation results show that current power control scheme in WCDMA, especially for the OSCH power control, has some problems. In this paper, cause of problems is revealed. Also, the quantitative result related to the OSCH power control problem is analyzed.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.923-928
• /
• 2003

This paper proposes a bottleneck link bandwidth measurement algorithm for reducing packet transmission delay within the grid network. There are two methods for measuring bottleneck link bandwidth：Packet Pair algorithm and Paced Probes algorithm. They measure bottleneck link bandwidth using the difference in arrival times of two paced probe packets of the same size traveling from the same source to destination. In addition, they reduce the influences of cross traffic by pacer packet. But there are some problems on these algorithms：it's not possible to know where bottleneck link occurred because they only focus on measuring the smallest link bandwidth along the path without considering bandwidth of every link on the path. So hop-by-hop based bottleneck link bandwidth measurement algorithm can be used for reducing packet transmission delay on grid network. Timestamp option was used on the paced probe packet for the link level measurement of bottleneck bandwidth. And the reducing of packet transmission delay was simulated by the solving a bottleneck link. The algorithm suggested in this paper can contribute to data transmission ensuring FTP and realtime QoS by detecting bandwidth and the location where bottleneck link occurred.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.38-45
• /
• 2007

With the emergence of new applications, packet classification is essential for supporting advanced internet applications, such as network security and QoS provisioning. As the packet classification on multiple-fields is a difficult and time consuming problem, internet routers need to classify incoming packet quickly into flows. In this paper, we present multi-phase packet classification architecture using an internal buffer for fast packet processing. Using internal buffer between address pair searching phase and remained fields searching phases, we can hide latency from the characteristic that search times of source and destination header fields are different. Moreover we guarantee the improvement by using single entry caching. The proposed architecture is easy to apply to different needs owing to its simplicity and generality.

• Journal of Communications and Networks
• /
• v.14 no.2
• /
• pp.162-168
• /
• 2012

This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two source-destination pairs and apply the concept of cognitive radio communication in sharing the common channel. Specifically, we give high-priority to the energy-constrained source-destination pair, i.e., primary pair, and low-priority to the pair which is free from such constraint, i.e., secondary pair. In contrast to the traditional notion of cognitive radio, in which the secondary transmitter is required to relinquish the channel as soon as the primary is detected, the secondary transmitter not only utilizes the idle slots of primary pair but also transmits along with the primary transmitter with probability p. This is possible because we consider the general multi-packet reception model. Given the requirement on the primary pair's throughput, the probability p is chosen to maximize the secondary pair's throughput. To this end, we obtain two-dimensional maximum stable throughput region which describes the theoretical limit on rates that we can push into the network while maintaining the queues in the network to be stable. The result is obtained for both cases in which the capacity of the battery at the primary node is infinite and also finite.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.53-58
• /
• 2013

A Fat-Tree topology has multiple paths between any pair of hosts. The delay for the multiple paths with an equal number of hops depends mainly on the queuing delay. However, most of the existing load-balancing schemes do not sufficiently exploit the characteristics of Fat-Tree. In most schemes load-balancing is performed at a flow level. Packet-level load-balancing schemes usually require the availability of special transport layer protocols to address packet reordering. In this paper, we propose a new packet-level load-balancing scheme which can enhance network utilization while minimizing packet reordering in Fat-Trees. Simulation results show that the proposed scheme provides as high TCP throughput as a randomized flow-level Valiant load balancing scheme for a best case.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.199-202
• /
• 2001

In this paper, we proposed and analyzed a new class of irregular fault-tolerant multistage interconnection network named as Extended-QT(Quad Tree) network. E-QT network is extended QT network. A unique path MIN usually is low hardware complexity and control algorithm. So we proposes a class of multipath MIN which are obtained by adding self-loop auxiliary links at the a1l stages in QT(Quad Tree) networks so that they can provide more paths between each source-destination pair. The routing of proposed structure is adaptived and is based by a routing tag. Starting with the routing tag for the minimum path between a given source-destination pair, routing algorithm uses a set of rules to select switches and modify routing tag. Trying the self-loop auxiliary link when both of the output links are unavailable. If the trying is failure, the packet discard. In simulation, an index of performance called reliability and cost are introduced to compare different kinds of MINs. As a result, the prouosed MINs have better capacity than 07 networks.

• Journal of Internet Computing and Services
• /
• v.5 no.3
• /
• pp.35-43
• /
• 2004

In packet switching using multistage interconnection networks (MIN's), it is generally assumed that the packet movements successively propagate from the last stage to the first stage in one network cycle. However, Ding and Bhuyan has shown that the network performance can be significantly improved if the packet movements are confined within each pair of adjacent stages using small clock cycles. In this paper, an analytical model for evaluating the performance of input-buffered MlN's employing this network cycle approach is proposed, The effectiveness of the proposed model is confirmed by comparing results from the simulation as well as from Ding and Bhuyan model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.2
• /
• pp.233-239
• /
• 1999

With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.7
• /
• pp.834-841
• /
• 2004

Experimental study on the three-dimensional topology of hairpin packet structures in turbulent boundary layers were carried out. Two different Reynolds number based on momentum thickness, Re$\sub$$\theta$/=514 and 934 were generated in a blowing type wind tunnel under the condition of zero pressure gradient. Simultaneous measurements of velocity fields at a wall-normal plane and wall-parallel plane by a plane PIV and a Stereo-PIV systems. The two Nd:Yag laser systems and three CCD cameras were synchronized to obtain instantaneous velocity fields at the same time. To avoid optical noise at the crossing line by the two laser light sheets, a new optical arrangement using polarization was applied. The obtained velocity fields show the existence of hairpin packet structure vividly and the idealized hairpin vortex signature is confirmed by experiment. Two counter-rotating vortex pair which reflects the cutting plane of hairpin legs are found both side of a strong streaky structure when the wall-normal plane cuts the hairpin head.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.215-221
• /
• 2012

To address the bottleneck problem in data center networks, there have been several proposals for network architectures providing high path-diversity. In devising new schemes to utilize multiple paths, one must consider the effects on TCP performance because packet reordering can make TCP perform poorly. Therefore most schemes prevent packet reordering by sending packets through one of multiple available paths. In this study we show that packet reordering does not occur severely enough to have a significant impact on TCP performance when scattering packets through all available paths between a pair of hosts in Fat-Tree. Simulation results imply that it is possible to find a low-cost solution to the TCP performance problem for Fat-Tree-like topologies.