• Title/Summary/Keyword: Average control delay

Search Result 252, Processing Time 0.028 seconds

Different QoS Constraint Virtual SDN Embedding under Multiple Controllers

  • Zhao, Zhiyuan;Meng, Xiangru;Lu, Siyuan;Su, Yuze
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4144-4165
    • /
    • 2018
  • Software-defined networking (SDN) has emerged as a promising technology for network programmability and experiments. In this work, we focus on virtual network embedding in multiple controllers SDN network. In SDN virtualization environment, virtual SDN networks (vSDNs) operate on the shared substrate network and managed by their each controller, the placement and load of controllers affect vSDN embedding process. We consider controller placement, vSDN embedding, controller adjustment as a joint problem, together considering different quality of service (QoS) requirement for users, formulate the problem into mathematical models to minimize the average time delay of control paths, the load imbalance degree of controllers and embedding cost. We propose a heuristic method which places controllers and partitions control domains according to substrate SDN network, embeds different QoS constraint vSDN requests by corresponding algorithms, and migrates switches between control domains to realize load balance of controllers. The simulation results show that the proposed method can satisfy different QoS requirement of tenants, keep load balance between controllers, and work well in the acceptance ratio and revenue to cost ratio for vSDN embedding.

A Study on Secure Routing Technique using Trust Value and Key in MANET (신뢰도와 키를 이용한 보안 라우팅 기법에 관한 연구)

  • Yang, Hwanseok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.3
    • /
    • pp.69-77
    • /
    • 2015
  • MANET is composed of only the mobile nodes have a limited transmission range. The dynamic topology by the frequent movement of nodes makes routing difficult and is also cause exposed to security vulnerabilities. In this paper, we propose the security routing technique consisted of mechanism of two steps in order to respond effectively to attack by the modification of the routing information and transmit secure data. The hierarchical structure is used and the authentication node that issues the key of the nodes within each cluster is elected in this proposed method. The authentication node manages key issues and issued information for encrypting the routing information from the source node. The reliability value for each node is managed to routing trust table in order to secure data transmission. In the first step, the route discovery is performed using this after the routing information is encrypted using the key issued by the authentication node. In the second step, the average reliability value of the node in the found path is calculated. And the safety of the data transmission is improved after the average reliability value selects the highest path. The improved performance of the proposed method in this paper was confirmed through comparative experiments with CBSR and SEER. It was confirmed a better performance in the transmission delay, the amount of the control packet, and the packet transmission success ratio.

Development of a Gripper and a Cutter for the Automatic Harvest of Green Perilla Leaves (식용 들깻잎 수확 자동화 시스템의 그리퍼 및 절단 컷터 개발)

  • 송영호;장동일;방승훈;조한성
    • Journal of Biosystems Engineering
    • /
    • v.28 no.6
    • /
    • pp.497-504
    • /
    • 2003
  • The objectives of this study were to develop a harvesting gripper for perilla leaves and test its performance, which was a partial work of the automated perilla leaves harvesting system development. The results of this study could be summarized as the followings: The shear forces for harvesting the perilla were measured. The measured results showed that the average shear force required was 12.13N for cutting the petioles attached to the perilla stalks, and the maximum of 17.42N. The inner diameter of air cylinder used was 6mm and the air pressure was maintained as 0.7㎫ during the tests. The time required for cutting perilla leaves could be adjusted by the control program and cutting operation could be done within 1- 10 seconds. The performance tests were conducted to harvest the perilla leaves by the gripper developed. The average success rates of cutting were 72.2% for the first test, 78.5% for the second, and 74.2% for the last. The perilla leaves were not damaged by the gripper The whole system operation could be finished within three seconds except the delay time for dropping harvested leaves.

A MAC Protocol for Integrated Service in the Multi-Hop Ad-Hoc Maritime Communication Network (다중 홉 해양통신망에서 실시간 통합 서비스를 위한 MAC 프로토콜)

  • Cho, Kumin;Yun, Changho;Lim, Yong-Kon;Kang, Chung G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.7
    • /
    • pp.603-611
    • /
    • 2013
  • In this paper, we propose a new frame structure and the underlying dynamic resource control mechanism to support an integrated service, including a real-time (RT) service that requires to serve the end-to-end delay performance, as well as non-real-time (NRT) service, using Self-Organizing Time Division Multiple Access (SO-TDMA)-based MAC protocol in a multi-hop ad-hoc maritime communication network. The underlying frame structure is dynamically configured by resource allocation to guarantee the average target outage performance of the real-time service. Toward this end, we analyze the average outage probability and its performance is verified for the proposed frame structure by simulation.

Enhanced OLSR Routing Protocol Using Link-Break Prediction Mechanism for WSN

  • Jaggi, Sukhleen;Wasson, Er. Vikas
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.3
    • /
    • pp.259-267
    • /
    • 2016
  • In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

Digitally Current Controlled DC-DC Switching Converters Using an Adjacent Cycle Sampling Strategy

  • Wei, Tingcun;Wang, Yulin;Li, Feng;Chen, Nan;Wang, Jia
    • Journal of Power Electronics
    • /
    • v.16 no.1
    • /
    • pp.227-237
    • /
    • 2016
  • A novel digital current control strategy for digitally controlled DC-DC switching converters, referred to as Adjacent Cycle Sampling (ACS), is proposed in this paper. For the ACS current control strategy, the available time interval from sampling the current to updating the duty ratio, is approximately one switching cycle. In addition, it is independent of the duty ratio. As a result, the contradiction between the processing speed of the hardware and the transient response speed can be effectively relaxed by using the ACS current control strategy. For digitally controlled buck DC-DC switching converters with trailing-edge modulation, digital current control algorithms with the ACS control strategy are derived for three different control objectives. These objectives are the valley, average, and peak inductor currents. In addition, the sub-harmonic oscillations of the above current control algorithms are analyzed and eliminated by using the digital slope compensation (DSC) method. Experimental results based on a FPGA are given, which verify the theoretical analysis results very well. It can be concluded that the ACS control has a faster transient response speed than the time delay control, and that its requirements for hardware processing speed can be reduced when compared with the deadbeat control. Therefore, it promises to be one of the key technologies for high-frequency DC-DC switching converters.

A Heuristic Methodology for Fault Diagnosis using Statistical Patterns

  • Kwon, Young-il;Song, Suh-ill
    • Journal of Korean Society for Quality Management
    • /
    • v.21 no.2
    • /
    • pp.17-26
    • /
    • 1993
  • Process fault diagnosis is a complicated matter because quality control problems can result from a variety of causes. These causes include problems with electrical components, mechanical components, human errors, job justification errors, and air conditioning influences. In order to make the system run smoothly with minimum delay, it is necessary to suggest heuristic remedies for the detected faults. Hence, this paper describes a heuristic methodology of fault diagnosis that is performed using statistical patterns generated by quality characteristics The proposed methodology is described briefly as follows: If a sample pattern generated by random variables is similar to the number of prototype patterns, the sample pattern may be matched by any prototype pattern among them to be resembled. This concept is based on the similarity between a sample pattern and the matched prototype pattern. The similarity is calculated as the weighted average of squared deviation, which is expressed as the difference between the relative values of standard normal distribution to be transformed by the observed values of quality characteristics in a sample pattern and the critical values of the corresponding ones in a matched prototype pattern.

  • PDF

Performance Evaluation of a Cell Reassembly Mechanism with Individual Buffering in an ATM Switching System

  • Park, Gwang-Man;Kang, Sung-Yeol;Han, Chi-Moon
    • ETRI Journal
    • /
    • v.17 no.1
    • /
    • pp.23-36
    • /
    • 1995
  • We present a performance evaluation model of cell reassembly mechanism in an ATM switching system. An ATM switching system may be designed so that communications between processors of its control part can be performed via its switching network rather than a separate inter-processor communications network. In such a system, there should be interface to convert inter-processor communication traffic from message format to cell format and vice versa, that is, mechanisms to perform the segmentation and reassembly sublayer. In this paper, we employ a continuous-time Markov chain for the performance evaluation model of cell reassembly mechanism with individual buffering, judicially defining the states of the mechanism. Performance measures such as message loss probability and average reassembly delay are obtained in closed forms. Some numerical illustrations are given for the performance analysis and dimensioning of the cell reassembly mechanism.

  • PDF

Reservation and Status Sensing Multiple Access Protocol in Slotted CDMA Systems

  • Lim, In-Taek;Ryu, Young-Tae
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.5
    • /
    • pp.513-518
    • /
    • 2010
  • This paper proposes a medium access control protocol for integrated voice and data services in slotted CDMA systems. The proposed protocol, which is named as RCSSMA (Reservation Code and Status Sensing Multiple Access), adopts a code reservation and status sensing schemes. RCSSMA protocol gives higher access priority to the voice traffic than data traffic for reducing the packet dropping probability. The voice terminal reserves an available spreading code to transmit voice packets during a talkspurt, whereas the data terminal transmits a packet over one of the available spreading codes that are not reserved by the voice terminals. In this protocol, the voice packets never contend with the data packets. Packet dropping probability and average data packet transmission delay are analyzed using a Markov chain model.

CLSR: Cognitive Link State Routing for CR-based Tactical Ad Hoc Networks

  • Ahn, Hyochun;Kim, Jaebeom;Ko, Young-Bae
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.50-67
    • /
    • 2015
  • The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.