• Title/Summary/Keyword: Dynamic Network

Search Result 3,200, Processing Time 0.027 seconds

A study of handover for dynamic QoS in B3G networks (B3G 네트워크에서 동적 QoS를 위한 핸드오버 연구)

  • Park, Sang-Joon;Lee, Jong-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.3
    • /
    • pp.1373-1379
    • /
    • 2011
  • The SLA (Service Level Agreement) is once determined between service provider and users in B3G networks so that the network service must be provided as QoS management. Here, the network situation is changed as the time flow, and the service environment is also altered. Hence, dynamic QoS management scheme should be considered. In this paper, we propose a handover scheme for dyanamic QoS as the network situation in B3G networks. The heterogeneous networks can be used for dynamic QoS management in B3G networks.

First- and Second-best Pricing in Stable Dynamic Models (안정동력학 모형에서 최선 통행료 및 차선 통행료)

  • Park, Koo-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.4
    • /
    • pp.123-138
    • /
    • 2009
  • This study examined the first- and second-best pricing by stable dynamics in congested transportation networks. Stable dynamics, suggested by Nesterov and de Palma (2003), is a new model which describes and provides a stable state of congestion in urban transportation networks. The first-best pricing in user equilibrium models introduces user-equilibrium in the system-equilibrium by tolling the difference between the marginal social cost and the marginal private cost on each link. Nevertheless, the second-best pricing, which levies the toll on some, but not all, links, is relevant from the practical point of view. In comparison with the user equilibrium model, the stable dynamic model provides a solution equivalent to system-equilibrium if it is focused on link flows. Therefore the toll interval on each link, which keeps up the system-equilibrium, is more meaningful than the first-best pricing. In addition, the second-best pricing in stable dynamic models is the same as the first-best pricing since the toll interval is separately given by each link. As an effect of congestion pricing in stable dynamic models, we can remove the inefficiency of the network with inefficient Braess links by levying a toll on the Braess link. We present a numerical example applied to the network with 6 nodes and 9 links, including 2 Braess links.

Capacity Improvement with Dynamic Channel Assignment and Reuse Partitioning in Cellular Systems

  • Chen Steven Li;Chong Peter Han Joo
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.13-20
    • /
    • 2006
  • In cellular mobile communications, how to achieve optimum system capacity with limited frequency spectrum is one of the main research issues. Many dynamic channel assignment (DCA) schemes have been proposed and studied to allocate the channels more efficiently, thus, the capacity of cellular systems is improved. Reuse partitioning (RP) is another technique to achieve higher capacity by reducing the overall reuse distance. In this paper, we present a network-based DCA scheme with the implementation of RP technique, namely dynamic reuse partitioning with interference information (DRP-WI). The scheme aims to minimize the effect of assigned channels on the availability of channels for use in the interfering cells and to reduce their overall reuse distances. The performance of DRP-WI is measured in terms of blocking probability and system capacity. Simulation results have confirmed the effectiveness of DRP-WI scheme. Under both uniform and non-uniform traffic distributions, DRP-WI exhibits outstanding performance in improving the system capacity. It can provide about 100% capacity improvement as compared to conventional fixed channel assignment scheme with 70 system channels.

Agent-based Adaptive Multimedia Streaming Considering Device Capabilities and Dynamic Network Conditions (무선 단말의 처리능력과 동적 네트워크 환경을 고려한 에이전트 기반의 적응적 멀티미디어 스트리밍 기법)

  • Jang, Minsoo;Seong, Chaemin;Kim, Jingu;Lim, Kyungshik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.6
    • /
    • pp.353-362
    • /
    • 2015
  • In order to provide smart devices with high quality multimedia streaming services, an adaptive streaming technique over HTTP has been received much attention recently and the Dynamic Adaptive Streaming over HTTP (DASH) standard has been established. In DASH, however, the technique to select an appropriate quality of multimedia based on the performance metrics measured in a smart device might have some difficulties to reflect the capabilities of other neighboring smart devices and dynamic network conditions in real time. To solve the problem, this paper proposes a novel software agent approach, called DASH agent (DA), which gathers and analyzes the device capabilities and dynamic network conditions in real time and finally determines the highest achievable quality of segment to meet the best Quality of Experience (QoE) in current situations. The simulation results show that our approach provides higher quality of multimedia segments with less frequency of quality changes to lower quality of multimedia segments.

Dynamic Boundary Tracking Control in Active Sensor Network (동적 센서네트워크에서의 유동적 경계선 추종 제어)

  • Jang, Seyong;Lee, Giroung;Song, Bongsob;Chwa, Dongkyoung;Hong, Sukkyo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.9
    • /
    • pp.1628-1635
    • /
    • 2008
  • In this paper, the motion coordination algorithm of mobile agents in active sensor network is proposed to track the dynamic boundary for environmental monitoring. While most of dynamic boundary tracking algorithms in the literature were studied under the assumption that the boundary and/or its evolving rate is known a priori, the proposed algorithm is assumed that the individual active agent can measure the state of environment locally without any information of the boundary. When the boundary is evolving dynamically, the formation of active agents is designed to achieve two objectives. One is to track boundary layer based on the measured information and a small deviation. The other is to maintain a uniform distance between adjacent agents. The algorithm structure based on a state diagram is proposed to achieve these two objectives. Finally, it will be shown in the simulations that all given agents converge to a desired boundary layer and maintain a formation along the boundary. (e.g., a circle, an ellipse, a triangle and a rectangle)

A Dynamic Defense Using Client Puzzle for Identity-Forgery Attack on the South-Bound of Software Defined Networks

  • Wu, Zehui;Wei, Qiang;Ren, Kailei;Wang, Qingxian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.846-864
    • /
    • 2017
  • Software Defined Network (SDN) realizes management and control over the underlying forwarding device, along with acquisition and analysis of network topology and flow characters through south bridge protocol. Data path Identification (DPID) is the unique identity for managing the underlying device, so forged DPID can be used to attack the link of underlying forwarding devices, as well as carry out DoS over the upper-level controller. This paper proposes a dynamic defense method based on Client-Puzzle model, in which the controller achieves dynamic management over requests from forwarding devices through generating questions with multi-level difficulty. This method can rapidly reduce network load, and at the same time separate attack flow from legal flow, enabling the controller to provide continuous service for legal visit. We conduct experiments on open-source SDN controllers like Fluid and Ryu, the result of which verifies feasibility of this defense method. The experimental result also shows that when cost of controller and forwarding device increases by about 2%-5%, the cost of attacker's CPU increases by near 90%, which greatly raises the attack difficulty for attackers.

Energy Efficient Dynamic S-MAC Protocol for Sensor Networks (센서 네트워크에서 에너지 효율적인 동적 S-MAC 프로토콜)

  • Yoo, Dae-Suk;Choi, Seung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.502-509
    • /
    • 2008
  • Wireless sensor networks consist of sensor nodes which are expected to be battery-powered and hard to replace or recharge. Thus, reducing the energy consumption of sensor nodes is an important design consideration in wireless sensor networks. For the implementation of energy-efficient MAC protocol, Sensor-MAC based on IEEE 802.11 protocol. In this paper, which has energy efficient scheduling, was proposed. In this paper, we propose Dynamic S-MAC that is dynamically operated by network-traffic states. Dynamic S-MAC protocol improves energy consumption of S-MAC due to change the frame length according to network-traffic states. Using NS-2 Simulation, we compare the performance of Dynamic S-MAC with S-MAC protocol.

Neural-Fuzzy Controller Based on Reinforcement Learning (강화 학습에 기반한 뉴럴-퍼지 제어기)

  • 박영철;김대수;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.245-248
    • /
    • 2000
  • In this paper we improve the performance of autonomous mobile robot by induction of reinforcement learning concept. Generally, the system used in this paper is divided into two part. Namely, one is neural-fuzzy and the other is dynamic recurrent neural networks. Neural-fuzzy determines the next action of robot. Also, the neural-fuzzy is determined to optimal action internal reinforcement from dynamic recurrent neural network. Dynamic recurrent neural network evaluated to determine action of neural-fuzzy by external reinforcement signal from environment, Besides, dynamic recurrent neural network weight determined to internal reinforcement signal value is evolved by genetic algorithms. The architecture of propose system is applied to the computer simulations on controlling autonomous mobile robot.

  • PDF

Routing optimization algorithm for logistics virtual monitoring based on VNF dynamic deployment

  • Qiao, Qiujuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1708-1734
    • /
    • 2022
  • In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

Dynamic deflection monitoring method for long-span cable-stayed bridge based on bi-directional long short-term memory neural network

  • Yi-Fan Li;Wen-Yu He;Wei-Xin Ren;Gang Liu;Hai-Peng Sun
    • Smart Structures and Systems
    • /
    • v.32 no.5
    • /
    • pp.297-308
    • /
    • 2023
  • Dynamic deflection is important for evaluating the performance of a long-span cable-stayed bridge, and its continuous measurement is still cumbersome. This study proposes a dynamic deflection monitoring method for cable-stayed bridge based on Bi-directional Long Short-term Memory (BiLSTM) neural network taking advantages of the characteristics of spatial variation of cable acceleration response (CAR) and main girder deflection response (MGDR). Firstly, the relationship between the spatial and temporal variation of the CAR and the MGDR is described based on the geometric deformation of the bridge. Then a data-driven relational model based on BiLSTM neural network is established using CAR and MGDR data, and it is further used to monitor the MGDR via measuring the CAR. Finally, numerical simulations and field test are conducted to verify the proposed method. The root mean squared error (RMSE) of the numerical simulations are less than 4 while the RMSE of the field test is 1.5782, which indicate that it provides a cost-effective and convenient method for real-time deflection monitoring of cable-stayed bridges.