This HTML5 document contains 33 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/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n10https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Norton's_theorem
dbo:wikiPageWikiLink
dbr:Flow-equivalent_server_method
Subject Item
dbr:Flow-equivalent_server_method
rdf:type
dbo:Software
rdfs:label
Flow-equivalent server method
rdfs:comment
In queueing theory, a discipline within the mathematical theory of probability, the flow-equivalent server method (also known as flow-equivalent aggregation technique, Norton's theorem for queueing networks or the Chandy–Herzog–Woo method) is a divide-and-conquer method to solve product form queueing networks inspired by Norton's theorem for electrical circuits. The network is successively split into two, one portion is reconfigured to a closed network and evaluated.
dcterms:subject
dbc:Queueing_theory
dbo:wikiPageID
38576819
dbo:wikiPageRevisionID
1021901032
dbo:wikiPageWikiLink
dbr:Norton's_theorem dbr:Product_form_queueing_network dbr:Queueing_theory dbc:Queueing_theory dbr:Poisson_process dbr:Divide-and-conquer_method
owl:sameAs
n10:4jaQg freebase:m.0r4q4yc wikidata:Q5462046
dbp:wikiPageUsesTemplate
dbt:Queueing_theory dbt:Reflist dbt:Probability-stub
dbo:abstract
In queueing theory, a discipline within the mathematical theory of probability, the flow-equivalent server method (also known as flow-equivalent aggregation technique, Norton's theorem for queueing networks or the Chandy–Herzog–Woo method) is a divide-and-conquer method to solve product form queueing networks inspired by Norton's theorem for electrical circuits. The network is successively split into two, one portion is reconfigured to a closed network and evaluated. Marie's algorithm is a similar method where analysis of the sub-network are performed with state-dependent Poisson process arrivals.
gold:hypernym
dbr:Method
prov:wasDerivedFrom
wikipedia-en:Flow-equivalent_server_method?oldid=1021901032&ns=0
dbo:wikiPageLength
2401
foaf:isPrimaryTopicOf
wikipedia-en:Flow-equivalent_server_method
Subject Item
dbr:Chandy-Herzog-Woo_method
dbo:wikiPageWikiLink
dbr:Flow-equivalent_server_method
dbo:wikiPageRedirects
dbr:Flow-equivalent_server_method
Subject Item
dbr:Chandy–Herzog–Woo_method
dbo:wikiPageWikiLink
dbr:Flow-equivalent_server_method
dbo:wikiPageRedirects
dbr:Flow-equivalent_server_method
Subject Item
dbr:Flow_equivalent_aggregation_technique
dbo:wikiPageWikiLink
dbr:Flow-equivalent_server_method
dbo:wikiPageRedirects
dbr:Flow-equivalent_server_method
Subject Item
dbr:Flow_equivalent_server_method
dbo:wikiPageWikiLink
dbr:Flow-equivalent_server_method
dbo:wikiPageRedirects
dbr:Flow-equivalent_server_method
Subject Item
wikipedia-en:Flow-equivalent_server_method
foaf:primaryTopic
dbr:Flow-equivalent_server_method