Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Online Publikationen...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
https://dx.doi.org/10.18419/op...
Master thesis . 2018
Data sources: Datacite
versions View all 2 versions
addClaim

Routing algorithms for time sensitive networks

Authors: Singh, Subarna;

Routing algorithms for time sensitive networks

Abstract

IEEE 802.1Qbv standard is an enhancement introduced by Time Sensitive Network Task Group to provide real time communication in a converged Ethernet network capable of transmitting both time critical traffic and best effort traffic. The standard includes a gating mechanism which controls the access to the transmission medium at the egress port of a switch, allowing transmission of frames from the specified queue. The gating events are time triggered and are programmed using a transmission schedule. A transmission schedule is a cyclic schedule that can be generated using various independent scheduling methods. However, the first step to each method involves routing the traffic across the network, followed by computation of gate schedules along the route. Due to lack of a standard, assessment of the quality of a schedule is difficult. Therefore independent metrics are used to measure the quality of schedule generated by different scheduling methods. However, the aim of each scheduling method is to transmit maximum amount of data traffic in a single cycle of a schedule. This thesis proposes that routing impact the quality of a transmission schedule irrespective of the scheduling method used. To begin evaluations showing the impact of routing algorithms on the data load distribution across the network are present. Followed by evaluations of the impact of data load distribution on the quality of a transmission schedule. Consequently establishing a direct relation between routing of the data traffic and the quality of a schedule. In response a generic routing algorithm aimed at optimizing the data load distribution is presented. The algorithm is based on heuristic algorithm Tabu Search to make it scalable in nature, allowing its use across different scenarios. We evaluate the algorithms with respect to data load distribution, impact on the quality of a schedule and scalability.

Country
Germany
Related Organizations
Keywords

000, 004

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green