About: Bandwidth guaranteed polling     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : dbo:Software, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FBandwidth_guaranteed_polling&invfp=IFP_OFF&sas=SAME_AS_OFF

Bandwidth Guaranteed Polling (BGP) in computing and telecommunications is a dynamic bandwidth allocation algorithm for Ethernet passive optical networks designed by Maode Ma et al. at the National University of Singapore. This is an instance of an algorithm that allocates bandwidth based on fixed weights. The BGP algorithm may not be entirely compatible with the MPCP standard. This is because the MPCP does not provide any way for the ONU to inform the OLT about the fraction of the time slot that it wishes to use.

AttributesValues
rdf:type
rdfs:label
  • Bandwidth guaranteed polling (en)
rdfs:comment
  • Bandwidth Guaranteed Polling (BGP) in computing and telecommunications is a dynamic bandwidth allocation algorithm for Ethernet passive optical networks designed by Maode Ma et al. at the National University of Singapore. This is an instance of an algorithm that allocates bandwidth based on fixed weights. The BGP algorithm may not be entirely compatible with the MPCP standard. This is because the MPCP does not provide any way for the ONU to inform the OLT about the fraction of the time slot that it wishes to use. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Bandwidth Guaranteed Polling (BGP) in computing and telecommunications is a dynamic bandwidth allocation algorithm for Ethernet passive optical networks designed by Maode Ma et al. at the National University of Singapore. This is an instance of an algorithm that allocates bandwidth based on fixed weights. BGP divides a window of time into fixed-sized slots, a number of which are allocated to each Optical Network Unit (ONU). The number allocated depends upon the ONU customer's service level agreement (SLA). If an ONU does not wish to use its entire allocated time slot, it may inform the OLT about this. The OLT may then decide to reallocate the remaining time slot to another ONU which does not have an SLA. The BGP algorithm may not be entirely compatible with the MPCP standard. This is because the MPCP does not provide any way for the ONU to inform the OLT about the fraction of the time slot that it wishes to use. (en)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 59 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software