• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.613-627
• /
• 2004

In this paper, we propose an Aggregate Fairness Maker (ARM) required for an Edge router to improve fairness of throughput among the flows of Assured Service in DiffServ with different round trip time (RTT) and we propose a user flow Three Color Marker (uf-TCM) as a flow marker that marks packets from the flow as green, yellow, or red. A yellow packet is the packet that consumes loss token in uf-TCM as well as that is demoted green packet in AM due to disobey the aggregate traffic profile. The proposed AFH promotes yellow packet to green packet or demotes green packet to yellow packet through the fair method without per-flow management, and it improves the feirness of throughput among the flows as well as link utilization. A yellow packet and a red packet have the same drop precedence at Core Router in our scheme. So we can use the RIO buffer management scheme. We evaluated the performance of our proposed AFM and the REDP Marker that was proposed to improve fairness without per-flow management. Simulation results show that, compared with the REDP marker, proposed AFM can improve performance of throughput fairness among the flows with different RTT and link utilization under the over-provisioning, exact-provisioning, and under-provisioning network environments at Multiple DiffServ domains as well as at Single DiffServ domain.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.608-618
• /
• 2006

The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, in order to apply the prefix caching service based on IETF's RTSP environment to the wireless networks, we propose the effective RTSP handling scheme that can adapt to the radio situation in wireless network and reduce the cutting phenomenon. Also, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU and RTSP handling scheme performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.679-689
• /
• 2006

Delivering multicast stream is one of the cost-saving approach in the large scale VOD environment. Because implementing VCR-like interactions for user's convenience in the multicast streaming system involves complex problems, we need the proper solutions for them. In this paper, we propose a hybrid scheme which uses the general P2P and the patching scheme with the Collaborative Interaction Streaming Scheme(CISS). CISS provides jumping functionability to the appropriate multicast session after VCR-like interaction in the environment in which multiple peers transmit VCR-like interaction streams to the VCR-like functionability request node to reduce the loads generated by frequent join or departure of peers at the multicast tree during providing VCR-like functionability. Therefore, with the proposed scheme we can distribute network traffic and reduce control overhead and latency. And to evaluate the performance of proposed scheme we compare it in the aspect of the performance of streaming delivery topology, control overhead and streaming quality with P2Cast[10] and DSL[11]. The simulation result shows that proposed P2Patching reduces about 30% of process overhead and enhances about $25{\sim}30%$ of streaming quality compared with DSL.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.395-403
• /
• 2016

This paper introduces a multi-cell search method for heterogeneous networks (HetNet), in which user equipments need to search multiple cells in its vicinity simultaneously. Due to the difficulty of acquiring channel informations for multiple cells, a non-coherent approach is preferred. In this paper, a non-coherent single-cell search scheme using a weighted vector is proposed, and the successive interference cancellation based multi-cell search algorithm is devised. In order to improve cell search performance, the weighted vector is designed in a way to exploit the general characteristic of wireless channel. Based on the fact that the performance of the proposed single-cell search scheme deviates slowly from the one using the optimal weighted vector, a universal weighted vector is also proposed, which shows the performance close to the optimal ones for various channel environments and signal-to-noise ratio regimes. Simulation results confirm that the proposed multi-cell search algorithm is capable of identifying cells more accurately with the help of the proposed single-cell search scheme, and can detect the remaining cells more effectively by removing the signals of the identified cells from the received signal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1346-1356
• /
• 2011

Transportation has been playing important role in our society by providing for people, freight, and information. However, it cuts its own throat by causing car accidents, traffic congestion, and air pollution. The main cause of these problems is a noticeable growth in the number of vehicles. The easiest way to mitigate these problems is to build new road infrastructures unless resources such as time, money, and space are limited. Therefore, there is a need to manage the existing road infrastructures effectively and safely. In this paper, we propose a road reservation scheme that provides fast and safe response for emergency vehicles using ubiquitous sensor network. Our idea is to allow emergency vehicle to reserve a road on a freeway for arriving to the scene of the accident quickly and safely. We evaluate the performance by three reservation method (No, Hop, and Full) to show that emergency vehicles such as ambulances, fire trucks, or police cars can rapidly and safely reach their destination. Simulation results show that the average speed of road reservation is about 1.09 ~ 1.20 times faster than that of non-reservation at various flow rates. However, road reservation should consider the speed of the emergency vehicle and the road density of the emergency vehicle processing direction, as a result of Hop Reservation and Full Reservation performance comparison analysis. We confirm that road reservation can guarantee safe driving of emergency vehicles without reducing their speed and help to mitigate traffic congestion.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• Korean Journal of Optics and Photonics
• /
• v.14 no.5
• /
• pp.545-554
• /
• 2003

Design of the optical modulator composed of a three-waveguide coupler and CPW traveling-wave electrodes was carried out. Switching phenomena of three-waveguide couplers were analyzed by using the coupled mode theory, and the coupling-lengths of the devices were calculated by means of the FDM. CPW traveling-wave electrodes were analysed by the CMM and SOR simulation technique in order to find the conditions of phase-velocity and impedance matching. Traveling-wave modulators were fabricated on z-cut LiNbO$_3$ substrate. Ti was in-diffused in LiNbO$_3$ to make waveguides and Au electrodes were built on the waveguides by the electrolyte technique. The fabricated modulator chip was end-polished, pig-tailed and packaged in a brass mount with K-connector. The insertion loss and the switching voltage of the optical modulator were about 4㏈ and 19V, respectively. Network analyzer was used to obtain the S parameter and the corresponding RF response. From the measurement, parameters of the traveling-wave electrodes were extracted to be Z$_{c}$= 45 Ω, N$_{eff}$=2.20, and $\alpha$$_{0}$=0.055/cm√GHZ. The measured optical response R($\omega$) was compared with the theoretically estimated one, showing both responses agree well. The measurement results revealed that 3㏈ bandwidth turned out to be about 13 GHz.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.11-20
• /
• 2014

For Web-based applications in IoT environment, IETF CoRE WG has standardizing the CoAP. One of limitations of CoAP is that CoAP standard does not consider the mobility management of the CoAP sensor node. In this paper, we propose the mobility management protocol of CoAP sensor node by considering the characteristics of the constrained network. The proposed mobility management protocol supports for Web client to be transmitted the sensing data from CoAP node reliably while the CoAP sensor moves into different wireless networks. To do this, we designed the architecture with the separate IP address management of CoAP sensor node and presented the mobility management protocol, which includes the holding and binding mode, in order to provide the reliable transmission. Finally, the numerical analysis and simulation with NS2 tool have been done for the performance evaluation in terms of the handover latency and packet loss with comparing the proposed mobility management protocol with other the existing mobility management protocols. The performance result shows that the proposed mobility management can provide the transmission of sensing data without the packet loss comparing with the existing mobility management protocol reliably.

• 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.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.3
• /
• pp.12-19
• /
• 2010

In road network, especially in urban area, inefficiency of travel time is caused by signal control and turn maneuver at intersection and this inefficiency has substantial effects on travel time. When searching for the shortest path, this inefficiency which is caused by turn maneuver must be considered. Therefore, travel time, vehicle volume and delay for each link were calculated by using simulation package, PARAMICS V5.2 for adaptation of turn penalty at 16 intersections of Gangnam-gu. Turn penalty was calculated respectively for each intersection. Within the same intersection, turn penalty differs by each approaching road and turn direction so the delay was calculated for each approaching road and turn direction. Shortest path dealing with 16 intersections searched by Dijkstra algorithm using travel time as cost, considering random turn penalty, and algorithm considering calculated turn penalty was compared and analyzed. The result shows that by considering turn penalty searching the shortest path can decrease the travel time can be decreased. Also, searching the shortest path which considers turn penalty can represent reality appropriately and the shortest path considering turn penalty can be utilized as an alternative.