• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.24-30
• /
• 2002

Label switching technology is currently emerging as a solution for the rapidly growing of Internet traffic demand. Multiprotocol label switching(MPLS) is one of the standards made by the Internet Engineering Task Force(IETE) intended to enhance speed, scalability, and inter-opearability between label switching technologies. In MPLS, utilization of label space is a very important factor of network performance because labels are basic unit in packet switching. We propose a algorithm to effectively use label space by a multiple disconnect timer at the label switching router. Our algorithm is based on multiple utilization of the connection release timer over the MPLS network with multiple domains. In our algorithm, a relatively linger timeout interval is assigned to the traffic with higher class by the aid of the packet classifier. This reduces delay for making a new connection and also reduces the amount of packets which will be routed to the layer 3. Simulation results shows that reduction of required label number in MPLS network and this indicate our algorithm offers better performance than the existing ones in term of utilization of label space.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.65-76
• /
• 2002

QoS routing is a routing technique for finding feasible path that satisfies QoS requirements required by application programs. Since QoS routing determines such paths in terms of dynamic network state, it satisfies the requirement of applications and increases the utilization of the network. The overhead is, however, generated by routers to exchange the information of the dynamic state of network. In order to reduce this protocol overhead, a timer based update mechanism is proposed in which router checks the change of the network status periodically and network state information is exchanged if the change is greater than a certain value. Using large update period makes, though, routing performance irresponsive to the parameters which determine the update of the network state of the router. In addition to this, large update period may result in inaccurate network state information at routers and cause resource reservation failure. The resource reservation failure generates additional overhead to cancel the resource reservation of the part of the path. In this paper, we propose mechanisms enhancing the existing network state update policy with respect to these two problems. Performance of the proposed schemes are evaluated through a course of simulation.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2002

The most important issue in providing multimedia traffic on a mobile computing environments is to guarantee the mobile host(client) with consistent QoS(Quality of Service). However, the QoS negotiated between the client and network in one cell may not be honored due to client mobility, causing hand-offs between cells. In this paper, a call admission control mechanism is proposed to provide consistent QoS guarantees for multimedia traffics in a mobile computing environment. Each cell can reserve fractional bandwidths for hand-off calls to its adjacent cells. It is important to determine the right amount of reserved bandwidth for hand-off calls because the blocking probability of new calls may increase if the amount of reserved bandwidth is more than necessary. An adaptive bandwidth reservation based on an MPP(Mobility Pattern Profile) and a 2-tier cell structure has been proposed to determine the amount of bandwidth to be reserved in the cell and to control dynamically its amount based on its network condition. We also propose a call admission control based on this bandwidth reservation and "next-cell prediction" scheme using an MPP. In order to evaluate the performance of our call admission control mechanism, we measure the metrics such as the blocking probability of our call admission control mechanism, we measure the metrics such as the blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of the existing mechanisms such as NR-CAT1, FR-CAT1, and AR-CAT1.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.12
• /
• pp.1310-1317
• /
• 2012

The Global Navigation Satellite System (GNSS) like US Global Positioning System (GPS) and EU Galileo are based on providing precise time and frequency synchronized ranging signals. Because of the exploitation of very precise timing signals these GNSS are used to provide both navigation and time distribution services. Moreover, because the positioning accuracy will improve as more satellites become available, we should expect that a combination of Galileo and GPS will provide better performance than those of both systems separately. However, Galileo will not use the same time reference as GPS and thus, a time difference arises - the GPS-Galileo Time Offset (GGTO). The navigation solution calculated by receivers using signals from both navigation systems will consequently contain a supplementary error if the GGTO is not accounted for. In this paper, we compared GPS Time (GPST) with Galileo Sytem Time (GST) and analyzed the effects of GGTO on positioning accuracy by simulation test. And then we also analyzed the characteristics of two representative GGTO correction methods such as the navigation message based method at system level and the estimation method at user level and propose the conceptual design of the novel correction method being capable of preventing previous method's problems.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.67-76
• /
• 2020

With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.73-78
• /
• 2002

In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of 'buffer full state'to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to 'low (more than threshold)' and 'abrupt increase' it generates 'buffer full' state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1770-1780
• /
• 1997

Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.412-427
• /
• 2002

This paper proposes a restoration scheme based on mobility learning and prediction in the presence of the failure of mobility databases in mobile communication systems. In mobile communication systems, mobility databases must maintain the current location information of users to provide a fast connection for them. However, the failure of mobility databases may cause some location information to be lost. As a result, without an explicit restoration procedure, incoming calls to users may be rejected. Therefore, an explicit restoration scheme against the failure of mobility databases is needed to guarantee continuous service availability to users. Introducing mobility learning and prediction into the restoration process allows systems to locate users after a failure of mobility databases. In failure-free operations, the movement patterns of users are learned by a Neuro-Fuzzy Inference System (NFIS). After a failure, an inference process of the NFIS is initiated and the users' future location is predicted. This is used to locate lost users after a failure. This proposal differs from previous approaches using checkpoint because it does not need a backup process nor additional storage space to store checkpoint information. In addition, simulations show that our proposal can reduce the cost needed to restore the location records of lost users after a failure when compared to the checkpointing scheme

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.428-436
• /
• 2002

Providing a mobile host with its required QoS is highly influenced by its mobility. The resource ReSerVation Protocol(RSVP) establishes and maintains a reservation state to ensure a given QoS level along the path from the sender to the receiver. However, RSVP is designed for use in fixed networks and thus it is inadequate in the mobile networking environment where a host changes its point of attachment. In this paper, we propose a new resource reservation protocol, RSVP-RA(RSVP by RSVP Agent) for mobile hosts. Our protocol assumes IETF Mobile IP as a mobility support mechanism. The proposed protocol introduce a new protocol entity - RSVP agent - to manage reservations in a mobile host's current visiting network. RSVP Agent is located in a local network and makes resource reservations in neighboring cells that the mobile host is expected to visit in the future. Thus, the proposed Protocol can provide a seamless QoS to the mobile host and significantly improve the scalability problem of RSVP by reducing the end-to-end signalling messages acrossing the backbone networks. The proposed protocols reduce packet delay, bandwidth overhead and the number of RSVP messages to maintain reservation states. We compared the performance of our proposed protocol with other proposed protocols in terms of signalling overhead, packet delay by simulation.

• Journal of Korean Society of Transportation
• /
• v.19 no.1
• /
• pp.17-28
• /
• 2001

The purpose of this study is to analyze logistics cost of transportation systems on EC(electronic commerce) between company and consumer. Transportation system in logistics is classified by three types on EC. The first type is the direct delivery from supply factory to consumers(type I). The second type is the delivery through distribution center in each area by owner logistics company (type II). The third type is the commission of delivery to the third party logistics company(type III). The logistics of EC has various service characteristics such as dealing with small quantity, various goods, and high frequency. This study assumes that all day's order is delivered on a next day. The logistics cost function is calculated according to the number of orders, delivery distance, transport quantify. and allocated freight trucks for daily order of the subject zone. The logistics cost changes according to the daily order characteristics. Therefore it is simulated to analyze the logistics cost change that considers the type of transportation's order characteristics. As a result of analysis, if the number of order is less than 10 and the quantify of each order is less than 10kg, type III has an advantage over the others And if the number of order is more than 10 and the quantity of each order is more than 10kg, type I has an advantage in the same zone and type II has an advantage in the other zones. This study is limited on the actual application because this study doesn't consider logistics infra of supply company and transport service time. If further study that considers these factors is implemented, it can estimate more accurate logistics cost on EC and propose an efficient freight transport alternatives to the company. This study attributes to estimate the logistics cost change over the frequency of daily order, the quantify of supply goods, and the transport distance on EC.