• Title/Summary/Keyword: value based routing

Search Result 89, Processing Time 0.028 seconds

Dynamic Routing Algorithm based on Minimum Path-Cost in Optical Burst Switching Networks (광 버스트 스위칭 망에서 최소 경로비용 기반의 동적 경로배정 기법)

  • Lee Hae joung;Song Kyu yeop;Yoo Kyoung min;Yoo Wan;Kim Young chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.72-84
    • /
    • 2005
  • Optical burst switching networks usually employ one-way reservation by sending a burst control packet with a specific offset time, before transmitting each data burst Same. Due to such a Property, burst-contentions occur when multiple bursts contend for the same wavelength in the same output link simultaneously in a node, leading to burst losses, eventually degrading the quality of service. Therefore, in this paper, we propose a dynamic routing algorithm using minimum local state information in order to decrease burst-contentions. In this proposed scheme, if burst loss rate exceeds a threshold value at a certain node, a new alternative routing path is chosen according to burst priority and location of burst generation, which enables the contending bursts to detour around the congested link. Moreover, for reducing the effect of sending bursts on the primary path due to the alternative path, we also apply a minimum path-cost based routing on link-cost concept. Our simulation results show that proposed scheme improves the network performance in terms of burst loss probability and throughput by comparing with conventional one.

A Study on the Efficient TICC(Time Interval Clustering Control) Algorithm using Attribute of Node (노드의 속성을 고려한 효율적인 TICC(Time Interval Clustering Control) 알고리즘에 관한 연구)

  • Kim, Young-Sam;Doo, Kyoung-Min;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.9
    • /
    • pp.1696-1702
    • /
    • 2008
  • A MANET(Mobile Ad-hoc Network) is a multi-hop routing protocol formed by a collection without the intervention of infrastructure. So the MANET also depended on the property as like variable energy, high degree of mobility, location environments of nodes etc. Generally the various clustering technique and routing algorithm would have proposed for improving the energy efficiency. One of the popular approach methods is a cluster-based routing algorithm using in MANET. In this paper, we propose an algorithm techniques which is TICC (Time Interval Clustering Control) based on energy value in property of each node for solving cluster problem. It provides improving cluster energy efficiency how can being node manage to order each node's energy level. TICC could be able to manage the clustering, re-configuration, maintenance and detection of Node in MANET. Furthermore, the results of modeling shown that Node's energy efficiency and lifetime are improved in MANET.

Pro-active Routing Selection and Maintenance Algorithms for Mobile Ad Hoc Network Environments (이동 Ad Hoc 네트워크 환경에서 사전 활성화 라우팅 선택과 관리유지 알고리즘)

  • Cho Young-Joo;Chung Il-Yong
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.606-614
    • /
    • 2006
  • The conventional on-demand mobile ad hoc routing algorithms (DSR and AODV) initiate route discovery only after a path breaks, incurring a significant cost and time in detecting the disconnection and establishing a new route. In this theory, we investigate adding proposed pro-active route selection and maintenance to the conventional on-demand mobile ad hoc routing algorithms(DSR and AODV). The key idea is to be only considered likely to be a path break when the received packet power becomes close to the minimum critical power and to be generated the forewarning packet when the signal power of a received packet drops below a optimal threshold value. After generated the forewarning packet, the source node can initiate rout discovery in advance; potentially avoiding the disconnection altogether. Our extensive simulation study shows that the proposed advance-active route selection and maintenance algorithms outperforms the conventional on-demand routing protocol based on DSR and AODV in terms of packet delivery ratio, packet latency and overhead.

  • PDF

Evaluation of Flood Control Capacity for Seongju Dam against Extreme Floods (이상강우에 대비한 성주댐의 홍수조절 능력 분석)

  • 권순국;한건연;서승덕;최혁준
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.45 no.6
    • /
    • pp.109-118
    • /
    • 2003
  • As a fundamental research to establish a safety operation plan for irrigation dams, this study presents hydrologic analysis conducted in Sungju Dam watershed based on various rainfall data. Especially those reservoirs without flood control feature are widely exposed to the risk of flooding, a safe and optimized operation program need to be improved against arbitrary flooding. In this study, reservoir routing program was developed and simulated for reservoir runoff estimation using WMS hydrology model. The model simulated the variations of reservoir elevation under the condition of open or closed emergency gate. In case of closed emergency gate, water surface elevation was given as 193.15 m, and this value exceeds the dam crest height by 1.65 m. When the emergency gate is open, the increment of water surface elevation is given as 192.01 m, and this value exceeds dam crest height by 0.57 m. As an alternative plan, dam height increase can be considered for flood control under the PMP (Probable Maximum Precipitation) condition. Since the dam size is relatively small compare to the watershed area, sound protection can be expected from the latter option rather than emergency gate installation.

Intrusion Detection Algorithm in Mobile Ad-hoc Network using CP-SVM (Mobile Ad - hoc Network에서 CP - SVM을 이용한 침입탐지)

  • Yang, Hwan Seok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.2
    • /
    • pp.41-47
    • /
    • 2012
  • MANET has vulnerable structure on security owing to structural characteristics as follows. MANET consisted of moving nodes is that every nodes have to perform function of router. Every node has to provide reliable routing service in cooperation each other. These properties are caused by expose to various attacks. But, it is difficult that position of environment intrusion detection system is established, information is collected, and particularly attack is detected because of moving of nodes in MANET environment. It is not easy that important profile is constructed also. In this paper, conformal predictor - support vector machine(CP-SVM) based intrusion detection technique was proposed in order to do more accurate and efficient intrusion detection. In this study, IDS-agents calculate p value from collected packet and transmit to cluster head, and then other all cluster head have same value and detect abnormal behavior using the value. Cluster form of hierarchical structure was used to reduce consumption of nodes also. Effectiveness of proposed method was confirmed through experiment.

An Efficient Dynamic Network Status Update Mechanism for QoS Routing (QoS 라우팅을 위한 효율적인 동적 네트워크 상태 정보 갱신 방안)

  • Kim, Jee-Hye;Lee, Mee-Jeong
    • 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.

Design and Implementation of the Sinkhole Traceback Protocol against DDoS attacks (DDoS 공격 대응을 위한 Sinkhole 역추적 프로토콜 설계 및 구현)

  • Lee, Hyung-Woo;Kim, Tae-Su
    • Journal of Internet Computing and Services
    • /
    • v.11 no.2
    • /
    • pp.85-98
    • /
    • 2010
  • An advanced and proactive response mechanism against diverse attacks on All-IP network should be proposed for enhancing its security and reliability on open network. There are two main research works related to this study. First one is the SPIE system with hash function on Bloom filter and second one is the Sinkhole routing mechanism using BGP protocol for verifying its transmission path. Therefore, advanced traceback and network management mechanism also should be necessary on All-IP network environments against DDoS attacks. In this study, we studied and proposed a new IP traceback mechanism on All-IP network environments based on existing SPIE and Sinkhole routing model when diverse DDoS attacks would be happen. Proposed mechanism has a Manager module for controlling the regional router with using packet monitoring and filtering mechanism to trace and find the attack packet's real transmission path. Proposed mechanism uses simplified and optimized memory for storing and memorizing the packet's hash value on bloom filter, with which we can find and determine the attacker's real location on open network. Additionally, proposed mechanism provides advanced packet aggregation and monitoring/control module based on existing Sinkhole routing method. Therefore, we can provide an optimized one in All-IP network by combining the strength on existing two mechanisms. And the traceback performance also can be enhanced compared with previously suggested mechanism.

A New Deadlock Detection Mechanism in Wormhole Networks (웜홀 네트웍을 위한 새로운 교착상태 발견 기법)

  • Lee, Su-Jung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.5_6
    • /
    • pp.280-289
    • /
    • 2003
  • Deadlock recovery-based routing algorithms in wormhole networks have gained attraction due to low hardware complexity and high routing adaptability Progressive deadlock recovery techniques require a few dedicated resources to transmit deadlocked packets rather than killing them. Selection of deadlocked packets is primarily based on time-out value which should be carefully determined considering various traffic patterns or packet length. By its nature, current techniques using time-out accompany unignorable number of false deadlock detections especially in a heavy-loaded network or with long packet size. Moreover, when a deadlock occurs, more than one packet may be marked as deadlocked, which saturate the resources allocated for recovery. This paper proposes more accurate deadlock detection scheme which does not make use of time-out to declare deadlock. The proposed scheme reduces the probability to detect false deadlocks considerably. Furthermore, a single message is selected as deadlocked for each cycle of blocked messages, thereby eliminating recovery overheads.

Weight Adjustment Scheme Based on Hop Count in Q-routing for Software Defined Networks-enabled Wireless Sensor Networks

  • Godfrey, Daniel;Jang, Jinsoo;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.1
    • /
    • pp.22-30
    • /
    • 2022
  • The reinforcement learning algorithm has proven its potential in solving sequential decision-making problems under uncertainties, such as finding paths to route data packets in wireless sensor networks. With reinforcement learning, the computation of the optimum path requires careful definition of the so-called reward function, which is defined as a linear function that aggregates multiple objective functions into a single objective to compute a numerical value (reward) to be maximized. In a typical defined linear reward function, the multiple objectives to be optimized are integrated in the form of a weighted sum with fixed weighting factors for all learning agents. This study proposes a reinforcement learning -based routing protocol for wireless sensor network, where different learning agents prioritize different objective goals by assigning weighting factors to the aggregated objectives of the reward function. We assign appropriate weighting factors to the objectives in the reward function of a sensor node according to its hop-count distance to the sink node. We expect this approach to enhance the effectiveness of multi-objective reinforcement learning for wireless sensor networks with a balanced trade-off among competing parameters. Furthermore, we propose SDN (Software Defined Networks) architecture with multiple controllers for constant network monitoring to allow learning agents to adapt according to the dynamics of the network conditions. Simulation results show that our proposed scheme enhances the performance of wireless sensor network under varied conditions, such as the node density and traffic intensity, with a good trade-off among competing performance metrics.

Flood Damage Assessment According to the Scenarios Coupled with GIS Data (GIS 자료와 연계한 시나리오별 홍수피해액 분석)

  • Lee, Geun-Sang;Park, Jin-Hyeg
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.19 no.4
    • /
    • pp.71-80
    • /
    • 2011
  • A simple and an improved methods for the assessment of flood damage were used in previous studies, and the Multi-Dimensional Flood Damage Assessment (MD-FDA) has been applied since 2004 in Korea. This study evaluated flood damage of dam downstream using considering MD-FDA method based on GIS data. Firstly, flood water level with FLDWAV (Flood Wave routing) model was input into cross section layer based on enforcement drainage algorithm, water depth grid data were created through spatial calculation with DEM data. The value of asset of building and agricultural land according to local government was evaluated using building layer from digital map and agricultural land map from landcover map. Also, itemized flood damage was calculated by unit price to building shape, evaluated value of housewares to urban type, unit cost to crop, tangible and inventory asset of company connected with building, agricultural land, flooding depth layer. Flood damage in rainfall frequency of 200 year showed 1.19, 1.30 and 1.96 times to flood damage in rainfall frequency of 100 year, 50 year and 10 year respectively by flood damage analysis.