DSpace About DSpace Software
 

DSpace at ICSY >
ICSY - Integrated Communication Systems Lab >
01: Publications / Publikationen >

Please use this identifier to cite or link to this item: http://dspace.icsy.de/handle/123456789/355

Title: A Requirement Aware Method to Reduce Complexity in Selecting and Composing Functional-block-based Protocol Graphs
Authors: Günther, Daniel
Kerr, Nathan
Müller, Paul
Keywords: future network
composition
complexity
protocol graph
Issue Date: Apr-2012
Publisher: The Fourth International Conference on Networked Digital Technologies (NDT’2012)
Abstract: Future Internet research activities try to increase the flexibility of the Internet. A well known approach is to build protocol graphs by connecting functional blocks together. 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 paper presents a method of representing the protocol graph search space as a set of search trees and then uses forward pruning to reduce the number of protocol graphs evaluated. We evaluate our proposed method by simulation.
URI: http://dspace.icsy.de/handle/123456789/355
Appears in Collections:01: Publications / Publikationen

Files in This Item:

File Description SizeFormat
NA.pdf11,58 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback