• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1106-1112
• /
• 2007

As a demand for high speed uplink packet services increases, the WCDMA enhanced uplink, also known as high speed uplink packet access (HSUPA), has been specified in release 6 by 3GPP. This HSUPA will provide various types of multimedia services, such as real-time video streaming, gaming, VoIP, and FTP. Generally, the performance of HSUPA is dominated by scheduling policy. Therefore, it is required to design a scheduling algorithm considering the traffic characteristics to provide QoS guaranteed services in various traffic environments. In this paper, we propose a scheduling algorithm considering the traffic characteristics to guarantee QoS in a mixed traffic environment. Finally, the performance of the proposed scheduling algorithm is evaluated in terms of average packet delay, packet delay jitter, and system throughput using a system level simulator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.4
• /
• pp.266-278
• /
• 2013

In this paper, to manage the efficient control of IP packet flows crossing multi-provider networks such as Internet, we propose a SDN(Software Defined Networking)-based policy controller. The proposed policy controller leverages the visibility of underlying network and manages both virtual links and ports to inter-connect networking elements. The controller is capable of quickly composing multiple on-demand virtual networks and dynamically managing the composed networks, thus it can provide more flexible and optimized overlay networking environment to end-user applications. More specifically, we first look into the proposed structure and features of policy controller. With two kinds of service applications, we then verify the applicability of the proposed controller by evaluating its service composition time.

• Journal of Convergence for Information Technology
• /
• v.10 no.1
• /
• pp.22-27
• /
• 2020

With the deployment of 5G infrastructure, content delivery network (CDN) will be a key role to provide explosive growing services for the independent media and YouTube which contain high-speed mobile contents. Without a local cache, the mobile backhaul and fronthaul should endure huge burden of bandwidth request for users as the increase number of direct accesses from contents providers. To deal with this issue, this paper fist presents both fronthaul solutions for CDN that use dark fibers and a passive optical network (PON). On top of that, we propose the aggregated content request specialized for PON caching and evaluate and compare its performance to legacy schemes through the simulation. The proposed PON caching scheme can reduce average access time of up to 0.5 seconds, 1/n received request packets, and save 60% of backhaul bandwidth compared to the no caching scheme. This work can be a useful reference for service providers and will be extended to further improve the hit ratio of cache in the future.

• Journal of Korea Game Society
• /
• v.4 no.4
• /
• pp.3-9
• /
• 2004

Expansion of internet and construction of high speed network which require multimedia services like MMORPG are exceeding the infra-structure. In this work, CBT is analyzed by focusing on the multicast routing protoco and the algorithm which is transformable to Anycast scheme from CBT scheme is suggested to adapt game traffic. Anycast routing scheme is suitable to distribute high density traffic. Simulation model was set per a number of group and group member, which enabled to reflect real environments. Performance evaluation of routing based on the characteristics of end-to-end delay of CBT and Anycast was mainly focused, The result showed that Anycast method was improved up 8.7%, 25.5%, 34.0%, 38.6% and 51.8%, 56.6% comparing with PIM-DM and CBT routing when packet site was 128, 512 and 1K byte respectively. From the simulation, CBT/Anycast routing scheme can be presented as a flexible and solid solution for the MMORPG traffic to improve the delay characteristics of game packets.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.535-544
• /
• 2003

Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.

• Journal of KIISE:Information Networking
• /
• v.34 no.5
• /
• pp.328-339
• /
• 2007

Conventional topology-based routing protocols are not suitable for inter-vehicular communication, where frequent route updates are necessary due to continuous and abrupt changes in network topology Position-based routing protocols are widely accepted to better serve their purpose in such a scenario as they do not require path discovery or maintenance. However they have to deal with the overhead of the location service and inaccurate position information. This paper proposes the MMFP (Multi-hop MAC Forwarding Protocol) for inter-vehicle communication that relies on reachability information collected from received packets in making a forwarding decision without path discovery. The MMFP is designed as an extension to the IEEE 802.11 MAC layer to ensure accuracy in its time-critical operations. This paper also presents some simulation results that demonstrate the superior performance of the MMFP over AODV in a realistic inter-vehicular communication.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.1-7
• /
• 2012

DDoS attack is a malicious attempt to exhaust resources of target system and network capacities using lots of distributed zombi systems. DDoS attack introduced in early 2000 has being evolved over time and presented in a various form of attacks. This paper proposes a scheme to detect DDoS attacks and to reduce possibility of such attacks that are especially based on vulnerabilities presented by using control packets of existing network protocols. To cope with DDoS attacks, the proposed scheme utilizes a buffer management techniques commonly used for congestion control in Internet. Our scheme is not intended to detect DDoS attacks perfectly but to minimize possibility of overloading of internal system and to mitigate possibility of attacks by discarding control packets at the time of detecting DDoS attacks. In addition, the detection module of our scheme can adapt dynamically to instantly increasing traffic unlike previously proposed schemes.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.450-461
• /
• 2007

In this paper, we propose the method to use power-saving mode (PSM) applicable to non real-time traffic and PSM applicable to real-time traffic simultaneously, for VoIP traffic with silence suppression. The proposed method uses PSC II during talk-spurt interval of parties A and/or B and uses PSC I or probabilistic sleep interval decision (PSID) method during mutual silence interval, respectively. To evaluate the performance of hybrid PSM (HPSM) based on PSC II or PSID method, we present average buffering delay, energy consumption of mobile station and VoIP packet drop probability with simulation runs. Results shows that proposed HPSM decreases energy consumption of mobile station up to 25 % while satisfying the packet drop probability within QoS requirement in case of end-to-end VoIP connection.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.6
• /
• pp.339-348
• /
• 2006

Recently, many researches on detecting and responding worms due to the fatal infrastructural damages explosively damaged by automated attack tools, particularly worms. Network service vulnerability exploiting worms have high propagation velocity, exhaust network bandwidth and even disrupt the Internet. Previous worm researches focused on signature-based approaches however these days, approaches based on behavioral features of worms are more highlighted because of their low false positive rate and the attainability of early detection. In this paper, we propose a Distributed Worm Detection Model based on packet marking. The proposed model detects Worm Cycle and Infection Chain among which the behavior features of worms. Moreover, it supports high scalability and feasibility because of its distributed reacting mechanism and low processing overhead. We virtually implement worm propagation environment and evaluate the effectiveness of detecting and responding worm propagation.