2018
DOI: 10.1007/s10922-018-9482-z
|View full text |Cite
|
Sign up to set email alerts
|

OpenFlow Compatible Key-Based Routing Protocol: Adapting SDN Networks to Content/Service-Centric Paradigm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 29 publications
0
7
0
Order By: Relevance
“…Primarily, when different purposes require the same content, this identifier scheme supports an efficient routing forward action in delay and information collision. Besides, the paper [109] proposed an OpenFlow compatible key-based routing (OFC-KBR) solution to enable content-based networks to be deployed on the current networks. In this scheme, end hosts are identified by virtual identifiers, which were used for network communications.…”
Section: Sdn Over Icnmentioning
confidence: 99%
“…Primarily, when different purposes require the same content, this identifier scheme supports an efficient routing forward action in delay and information collision. Besides, the paper [109] proposed an OpenFlow compatible key-based routing (OFC-KBR) solution to enable content-based networks to be deployed on the current networks. In this scheme, end hosts are identified by virtual identifiers, which were used for network communications.…”
Section: Sdn Over Icnmentioning
confidence: 99%
“…For example, the range [303, 319[= [000100101111, 000100111110] cannot be expressed by one bitmasked value. This fact causes a technical difficulty in OpenFlow-based networks, as it was identified in [4], because OpenFlow specification only enables the use of bitmasks to express ranges of values in the IPv4 source and destination matching fields. To solve this problem in OpenFlow networks, proposed the use of the prefix expansion algorithm [22] was proposed, converting each obtained range into a set of bitmasked equivalent ranges.…”
Section: Key-based Routing Mechanismmentioning
confidence: 99%
“…The prefix extension algorithm was proposed as a useful tool that allows programmers to implement this key-based routing protocol in OpenFlow networks [4]. However, as described before (see the example in Section 4.1), this prefix extension algorithm involves the insertion of a relatively high number of flow table entries in the nodes.…”
Section: Translation Of Ranges Solutionmentioning
confidence: 99%
See 2 more Smart Citations