• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1338-1341
• /
• 2004

In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1346-1349
• /
• 2004

In this paper, we have proposed the new link-weight calculating function using for routing decision in WDM networks. The proposed link-weight calculating functions includes following factors those are available wavelengths per link, distance loss, total wavelengths, and limited wavelength conversion. The calculated link-weight is applied into the algorithm of routing decision in order to determine the available lightpath that qualifies user requests. The objective is to improve the performance of wavelengths assignment with fast determining the suitable lightpath by using the proposed link-weights calculating function. The analytical model of WDM switching networks is introduced for numerical analysis. The link-weight calculating function is performed. Finally, the performance of proposed algorithm is displayed with numerical results in term of the blocking probability, the probability that connection requests from users are rejected due to there are no available lightpath to be assigned for them. It is also shown that the blocking probability is varied in depending on the number of available wavelengths and the degree of wavelength conversion. The numerical results also show that the proposed link-weight calculating function is more cost-effective choice for the routing decision in WDM switching networks.

• Journal of Korea Multimedia Society
• /
• v.17 no.2
• /
• pp.191-199
• /
• 2014

The unicasting routing technology of VANET is very important for user convenience. Unicasting packets must be forwarded to the appropriate path in order to arrive to the destination. However, there are so many problems because the vehicle nodes have limited information related to the routing decision. In particular, packet delivery failure will be occurred by selecting the path already failed again. We call this problem as 'Failed Path Re-Selection Problem'. In this paper, we propose an enhanced rerouting function of VANET Routing. The proposed rerouting function uses the failed path information when rerouting function executed. For this rerouting function, failed path information will be stored in the packet whenever the routing fail occurred. By the comparison with the performance of legacy VANET routing function, the superiority of the proposed method can be seen.

• Convergence Security Journal
• /
• v.2 no.2
• /
• pp.89-97
• /
• 2002

We use the call routing to interpret the number or name for routing address in multimedia internet. The routing address is used for connection setup. The traffic engineering consists of traffic management, capacity management and network planning. In this paper, in the traffic management function, the basic functions for call routing and connection/bearer-path routing will be presented.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.77-85
• /
• 2013

Recently, location information based routing protocol has been studied to estimate end-to-end path in wireless ad-hoc network. This protocol assumes all nodes can get heir location information via GPS devices and floods only limited area with routing message through acquired location information. Therefore, this protocol has advantage that can reduce the number of routing message than the existing IP-based routing protocols. In addition, all nodes enabling this protocol must acquire their own location information to participate in the location-based routing. However, recent because of the miniaturization of sensor node, sensor node without GPS function has been launched. Therefore in case of the sensor node that does not know location information, it is impossible to participate in the ad hoc network configuration and location information based routing. In this paper, a virtual location information based routing scheme is proposed for wireless nodes without GPS function to be able to participate in location information based routing within ad hoc network environments consisting of wireless nodes with GPS function and wireless nodes without GPS function. Therefore, the proposed protocol has the advantage that a wireless node without a GPS function is able to participate in ad hoc network configuration and the location information based routing.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.1
• /
• pp.14-19
• /
• 2009

In Mobile Ad-hoc Network, link failure and packet loss may occur frequently due to its nature of mobility and limited battery life. In this paper, an enhanced robust routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance is presented. If the node movement is detected, the routing agent switches local path to its neighbor node. Simulation results show that the performance of the proposed routing scheme is superior to previous AODV protocol.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.418-420
• /
• 2013

Issues on design of routing scheme and routing metric for multicast in multi-channel multi-radio (MCMR) wireless mesh networks (WMNs) are discussed. Emphasis is placed on channel-diversity oriented routing metrics. From case study the conclusion to be drawn is that the key for design of channel-diversity oriented routing metrics is how to construct an optimization function to quantify interdependence between channel assignment and multicast routing throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1690-1700
• /
• 2000

Connection management function of the TINA which is developed by TINA-C provides network connection services such as setup modification and release of connections. The connection management function provides these services to network operators to the fault management function that provides backup-path and to the performance management function that provides load-balancing. The connection management function necessarily requires a routing algorithm to set up a new connection. In this paper we propose a new routing algorithm named QTHR (QoS and Traffic parameter based Hierarchical Routing) for TINA based connection management of ATM/B-ISDN network. And we implemented the QTHR and analyzed the performance of the QTHR.

• Journal of Korean Society of Water and Wastewater
• /
• v.12 no.2
• /
• pp.127-139
• /
• 1998

The objectives of this study is at the development of the channel routing model which can be used for flood prediction. Among the routing models, the hydraulic technique of the implicit scheme in the dynamic equation is selected to route the unsteady varied flow in the open channel. The channel routing model is catchment runoff which computed by the conceptual and transfer function model. The conceptual and transfer function model can simulate the catchment runoff accurately. As a result of investigating the channel routing model, the optimal weighting factor ${\theta}$ which fixes two points between time line is chosen, and also, the optimal error tolerance which satisfies computing time and converge of solution is determined in this study.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.304-308
• /
• 1998

With the advances in concurrent engineering, schedulability has become an important design issue in machine loading and routing procedure. In this paper, four rules to improve schedulability of loading and routing are formulated as a mixed-integer programming model based on machine, routing and tool flexibilities. In this model, these rules are represented as an objective function or constraints. The impact of rules on the quality of schedules for the result of loading and routing is measured with makespan, throughput and average machine utilization.