This HTML5 document contains 73 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n12http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n16https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n6http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Traffic_policing_(communications)
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
Subject Item
dbr:Generic_cell_rate_algorithm
rdf:type
yago:Activity100407535 yago:Act100030358 yago:WikicatNetworkingAlgorithms yago:Abstraction100002137 yago:Rule105846932 dbo:Software yago:YagoPermanentlyLocatedEntity yago:PsychologicalFeature100023100 yago:Procedure101023820 yago:Event100029378 yago:Algorithm105847438
rdfs:label
Generic cell rate algorithm
rdfs:comment
The generic cell rate algorithm (GCRA) is a leaky bucket-type scheduling algorithm for the network scheduler that is used in Asynchronous Transfer Mode (ATM) networks. It is used to measure the timing of cells on virtual channels (VCs) and or (VPs) against bandwidth and jitter limits contained in a traffic contract for the VC or VP to which the cells belong. Cells that do not conform to the limits given by the traffic contract may then be re-timed (delayed) in traffic shaping, or may be dropped (discarded) or reduced in priority (demoted) in traffic policing. Nonconforming cells that are reduced in priority may then be dropped, in preference to higher priority cells, by downstream components in the network that are experiencing congestion. Alternatively they may reach their destination (V
foaf:depiction
n6:GCRA.jpg n6:Variable_Bit_Rate.jpg n6:Dual_LBC.jpg
dcterms:subject
dbc:Network_scheduling_algorithms dbc:Networking_algorithms dbc:Teletraffic
dbo:wikiPageID
1616583
dbo:wikiPageRevisionID
1013924784
dbo:wikiPageWikiLink
dbr:Token_bucket dbr:ITU-T dbr:Virtual_circuit dbc:Teletraffic dbr:FPGA n12:Variable_Bit_Rate.JPG dbr:Jitter dbr:UPC_and_NPC dbr:Priority_control dbr:Leaky_bucket dbr:Network_scheduler dbr:Traffic_policing_(communications) dbr:Traffic_Contract dbr:Connection_admission_control dbc:Network_scheduling_algorithms dbr:Virtual_Paths dbr:Traffic_contract dbr:Asynchronous_Transfer_Mode dbr:Traffic_shaping dbr:Bandwidth_(signal_processing) dbc:Networking_algorithms dbr:Network_interface_card n12:Dual_LBC.JPG dbr:ATM_Forum dbr:Scheduling_algorithm dbr:User–network_interface n12:GCRA.JPG dbr:Network-to-network_interface
owl:sameAs
freebase:m.05gz7n n16:4kzCF wikidata:Q5532665 yago-res:Generic_cell_rate_algorithm
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:thumbnail
n6:GCRA.jpg?width=300
dbo:abstract
The generic cell rate algorithm (GCRA) is a leaky bucket-type scheduling algorithm for the network scheduler that is used in Asynchronous Transfer Mode (ATM) networks. It is used to measure the timing of cells on virtual channels (VCs) and or (VPs) against bandwidth and jitter limits contained in a traffic contract for the VC or VP to which the cells belong. Cells that do not conform to the limits given by the traffic contract may then be re-timed (delayed) in traffic shaping, or may be dropped (discarded) or reduced in priority (demoted) in traffic policing. Nonconforming cells that are reduced in priority may then be dropped, in preference to higher priority cells, by downstream components in the network that are experiencing congestion. Alternatively they may reach their destination (VC or VP termination) if there is enough capacity for them, despite them being excess cells as far as the contract is concerned: see . The GCRA is given as the reference for checking the traffic on connections in the network, i.e. usage/network parameter control (UPC/NPC) at user–network interfaces (UNI) or inter-network interfaces or network-network interfaces (INI/NNI) . It is also given as the reference for the timing of cells transmitted (ATM PDU Data_Requests) onto an ATM network by a network interface card (NIC) in a host, i.e. on the user side of the UNI . This ensures that cells are not then discarded by UPC/NCP in the network, i.e. on the network side of the UNI. However, as the GCRA is only given as a reference, the network providers and users may use any other algorithm that gives the same result.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Generic_cell_rate_algorithm?oldid=1013924784&ns=0
dbo:wikiPageLength
13249
foaf:isPrimaryTopicOf
wikipedia-en:Generic_cell_rate_algorithm
Subject Item
dbr:Generic_Cell_Rate_Algorithm
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
dbo:wikiPageRedirects
dbr:Generic_cell_rate_algorithm
Subject Item
dbr:Leaky_bucket
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
Subject Item
dbr:Asynchronous_Transfer_Mode
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
Subject Item
dbr:Net_neutrality
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
Subject Item
dbr:Network_scheduler
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
Subject Item
dbr:Traffic_shaping
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
Subject Item
dbr:GCRA
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
dbo:wikiPageRedirects
dbr:Generic_cell_rate_algorithm
Subject Item
dbr:Virtual_scheduling_algorithm
dbo:wikiPageWikiLink
dbr:Generic_cell_rate_algorithm
dbo:wikiPageRedirects
dbr:Generic_cell_rate_algorithm
Subject Item
wikipedia-en:Generic_cell_rate_algorithm
foaf:primaryTopic
dbr:Generic_cell_rate_algorithm