A Strategic Search Method for Requirement-Aware Functional-Block Selection and Composition in a Flexible Network

Günther, Daniel; Kerr, Nathan; Müller, Paul
June 2012
Journal of Digital Information Management;Jun2012, Vol. 10 Issue 3, p194
Academic Journal
Internet applications have reached such a high complexity that the network stack concept introduced decades ago is not suitable anymore. Future Internet research activities try to increase the flexibility of the Internet in order to allow the network to adapt to present and future requirements and applications. A well known approach is to build protocol graphs, which will be used instead of inflexible network stacks, by connecting functional blocks together. A functional block encapsulates a particular network function. The protocol graph that should be used is the one most suitable to the application's requirements. To find the most suitable graph, all possible protocol graphs must be evaluated. However, the number of possible protocol graphs increases exponentially as the number of functional blocks increases. This article presents a method of modeling the protocol graph search space as a set of search trees and then using search strategies to manage the inherent complexity of the search process. We evaluate our proposed method by simulation.


Related Articles

  • Optimization of Latency of Temporal Key Integrity Protocol (TKIP) Using Graph Theory and Hardware Software Co-Design. Deotare, Vilas V.; Padole, Dinesh V.; Shelke, Swati // International Journal of Computer Science, Engineering & Informa;Jun2013, Vol. 3 Issue 3, p33 

    Temporal Key Integrity Protocol (TKIP) [1] encapsulation consists of multiple-hardware and software block which can be implemented either software or hardware block or combination of both. This papers aims to design the TKIP technique using graph theory and hardware software co-design for...

  • The Algorithm for Blind Multi-user Detector Based on Subspace Tracking. Meng JIA; Bing WU // Sensors & Transducers (1726-5479);Apr2014, Vol. 169, p117 

    Multi-user detection (MUD) is an efficient technique for interference suppression that reduces the Multiple access interference (MAI) and improves the performance and increases the capacity of the system. Nowadays most of the research to MUD focuses on the blind multi-user detector because it...

  • Efficient Data Retrieving in Distributed Data-streaming Environments. Jinsong Han; Jun Miao; Jizhong Zhao; Jinpeng Huai; Ni, Lionel M. // Adhoc & Sensor Wireless Networks;2010, Vol. 10 Issue 2/3, p135 

    In Automobile Tracking Systems (ATS), automobile location data is continuously generated and kept in a distributed manner. As a large amount of traffic is incurred during the search process, it is critical to construct an efficient overlay multicast structure for the ATS so as to evenly...

  • Load Balancing in Metro Ethernet Networks by Selecting the Best Spanning Tree. MIRJALILY, GHASEM; TAFTI, MOHAMMAD HADI KARIMI; RAJAEE, SHAHRAM // Journal of Information Science & Engineering;Sep2011, Vol. 27 Issue 5, p1747 

    Ethernet networks rely on the so-called spanning tree protocol (STP) in order to prevent loops. This protocol imposes a severe penalty on the performance and scalability of metro Ethernet networks, since it makes inefficient use of the links and switches. This paper presents a new scheme that...

  • Normal forms for unary probabilistic automata. Bianchi, Maria Paola; Pighizzini, Giovanni // RAIRO -- Theoretical Informatics & Applications;Oct2012, Vol. 46 Issue 4, p495 

    We investigate the possibility of extending Chrobak normal form to the probabilistic case. While in the nondeterministic case a unary automaton can be simulated by an automaton in Chrobak normal form without increasing the number of the states in the cycles, we show that in the probabilistic...

  • Bee-MANET: A New Swarm-based Routing Protocol for Wireless Ad Hoc Networks. Albayrak, Z.; Zengin, A. // Electronics & Electrical Engineering;2014, Vol. 20 Issue 3, p91 

    Recently, mobile ad hoc networks (MANETs) have drawn attention by many researchers due to the development of portable devices and wireless network appliances have accounted for ad hoc networks. Many academic researchers have shown great interest in ad hoc networks for twenty years. One of the...

  • Preface. Xhafa, Fatos; Barolli, Leonard // Journal of Algorithms & Computational Technology;Jun2011, Vol. 5 Issue 2, pi 

    An introduction to the journal is presented in which the guest editors discuss the advances in the simulation and modeling techniques used for the complex systems in modern computational system, optimization and engineering systems, as well as the problems that arises within the techniques.

  • Conditional reactive simulatability. Backes, Michael; Dürmuth, Markus; Hofheinz, Dennis; Küsters, Ralf // International Journal of Information Security;Apr2008, Vol. 7 Issue 2, p155 

    Simulatability has established itself as a salient notion for defining and proving the security of cryptographic protocols since it entails strong security and compositionality guarantees, which are achieved by universally quantifying over all environmental behaviors of the analyzed protocol. As...

  • Formal verification and validation of a movement control actor relocation algorithm for safety-critical applications. Imran, Muhammad; Zafar, Nazir; Alnuem, Mohammed; Aksoy, Mehmet; Vasilakos, Athanasios // Wireless Networks (10220038);Jan2016, Vol. 22 Issue 1, p247 

    Wireless sensor and actor networks (WSAN) are captivating significant attention because of their suitability for safety-critical applications. Efficient actor placement in such applications is extremely desirable to perform effective and timely action across the deployment region. Nonetheless,...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics