• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.279-282
• /
• 2007

Typically a wireless sensor network consists of a number of nodes that sense surrounding environment and collaboratively work to process and route the sensing data to a sink or gateway node. We propose an architecture with support of multiple routers in IPv6-based Low-power Wireless Personal Area Network (6LoWPAN). Our architecture provides traffic load balancing and increases network lifetime as well as self-healing mechanism so that in case of a router failure the network still can remain operational. Each router sends its own Router Advertisement message to nodes and all the nodes receiving the messages can select which router is the best router with the minimum hop-count and link information. We have implemented the architecture and assert our architecture helps in traffic load balancing and reducing data transmission delay for 6LoWPAN.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2010.03a
• /
• pp.1073-1076
• /
• 2010

Shallow foundations of various columns such as traffic signs, CCTVs, traffic lights, street lights, steel telephone poles and so on are made by cast-in-situ concrete method. However, typical cast-in-situ method has many problems because of the long duration of construction, occupation of sidewalks and low strength of the concrete after curing. In order to solve the problems, field load tests for the prefabricated DSF foundation made by combination of column and foundation was conducted to know load-deformation behavior by torsional tests.

• Journal of the Korea Society for Simulation
• /
• v.9 no.1
• /
• pp.11-19
• /
• 2000

The main idea behind the Intelligent Networks (IN) concept is the separation of switching function from the service control, in order to meet various service requirements of subscribers and development of new services in time. The (N+l) architecture of the IN service system consists of front-end processors (FEP) and back-end processors (BEP), which is in service in a domestic telecommunication company, and balances the traffic load for services among the processors. Under this architecture, the IN service system can distribute the traffic load dynamically, and M services are easily launched and manipulated minimizing impacts on the existing services. This paper traces the performance of the (N＋1) structured system by means of the simulation approach, and shed a light on the result.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.889-894
• /
• 2004

Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.6
• /
• pp.109-116
• /
• 2007

The lack of load-balancing functionality in most existing ad hoc routing protocols often causes congestion resulting in bad performance and short lifetime of participating nodes. We present an auxiliary scheme for reactive routing protocols to discover an unloaded route, thereby decreasing possibility of congestion. The scheme allows an intermediate node to determine whether to be a relaying node for a newly constructed route autonomously based on the occupancy of its queue. Thus the scheme does not require network-wide load information. Simulation results show that the proposed scheme distributes traffic load well.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.174-180
• /
• 2002

With the invention of MPLS and the Improvement in traffic engineering, multipath packet forwarding and dynamic load control has become a reality. A dynamic load control, while it can improve network efficiency by controlling loads between paths according to the network state, can lead to unstable and oscillating state because of the staleness of the state information. In this paper, we propose a efficient load control scheme which remains stable. The proposed scheme introduces prediction to reduce the staleness of state message and to prevent oscillation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1971-1978
• /
• 1999

In this paper, we study the effects of long-range dependence (LRD) in VBR video traffic on queueing system. This paper consists of Part I and II. In Part I, we present a (LRD) video traffic model based on the shifting-level (SL) process. We observe that the ACF of an empirical video trace is accurately captured by the shifting-level process with compound correlation (SLCC): an exponential function in short range and a hyperbolic function in long range. We present an accurate parameter matching algorithm for video traffic. In the Part II, we offer the queueing analysis of SL/D/1/K called ‘quantization reduction method’. Comparing the queueing performances of the DAR(1) model and the SLCC with that of a real video trace, we identify the effects of SRD and LRD in VBR video traffic on queueing performance. Simulation results show that Markoivian models can estimate network performances fairly accurately under a moderate traffic load and buffer condition, whereas LRD may have a significant effect on queueing behavior under a heavy traffic load and large buffer condition.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.404-414
• /
• 2005

In the packet data network systems beyond 3G, the service quality of current users is affected by traffic load due to the packet burstiness. There also exists a hot cell problem, a well-known problem of cellular systems, caused by traffic centraliBation. Hot cell problem is one of the major reasons of degrading system performance because hot cell increases the call drop rate without fully utilization of system resource. Therefore, it is very important to distribute the traffic on the several neighboring cells so that system uses its resource effectively and maintains the quality of service. In this paper, we propose the adaptive handoff algorithms for distributing traffic in the packet data network systems. In addition, we propose a new load estimation method with MAC state diagram suitable for packet data network systems. Through the simulation results, we could find that proposed algorithm is able to improve efficiency of system resource and to assure the service quality of users through traffic distribution.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.101-114
• /
• 2002

The real multimedia application in wide area communication needs the guaranteed performance of communication service. Therefore, the resource is reserved at the moment of traffic burst and the region of connection admission possibility is widened at the basis of maximum cell rate. This of study shows that the end-to-end traffic delay to the traffic of burst state is guaranteed when the total of maximum transmission rate is higher than link speed by using the region of deterministic delay. The network load rate of connection admission can be improved by the inducement of delay bounds consideration each traffic characteristic to guarantee the end-to-end delay of network from single switch. This suggested buffering system using deterministic service do not give any influence to service quality and can guarantee the bounds of end-to-end delay. And it can also reduce the load of network even if the delay is increased according to the burst traffic characteristic. The above suggested system can be applied effectively to the various kinds of general network specification which admit both real time trafnc service and non-real time traffic service.