Gelenbe 2007a - Revision history

Scipediacontent at 15:13, 21 January 2021

2021-01-21T15:13:52Z

Scipediacontent: Scipediacontent moved page Draft Content 531048962 to Gelenbe 2007a

2020-10-14T12:26:02Z

Scipediacontent moved page Draft Content 531048962 to Gelenbe 2007a

Scipediacontent: Created page with " == Abstract == The purpose of this tutorial presentation is to introduce G-Networks, or Gelenbe Networks, which are product form queueing networks which include normal or po..."

2020-10-14T12:25:59Z

Created page with " == Abstract == The purpose of this tutorial presentation is to introduce G-Networks, or Gelenbe Networks, which are product form queueing networks which include normal or po..."

New page

== Abstract ==

The purpose of this tutorial presentation is to introduce G-Networks, or Gelenbe Networks, which are product form queueing networks which include normal or positive customers, as well as negative customers which destroy other customers, and triggers which displace other customers from one queue to another. We derive the balance equations for these models in the context of multiple customer classes, show the product form results, and exhibit the traffic equations which - in this case, contrary to BCMP and Jackson networks - are non-linear. This leads to interesting issues of existence and uniqueness of the steady-state solution. Gelenbe Network can be used to model large scale computer systems and networks in which signaling functions represented by negative customers and triggers are used to achieve flow and congestion control.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_531048962-beopen541-1408-document.pdf</pdf>

== Original document ==

The different versions of the original document can be found in:

* [https://link.springer.com/content/pdf/10.1007%2F3-540-45798-4_1.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-45798-4_1.pdf]

← Older revision		Revision as of 15:13, 21 January 2021
Line 3:		Line 3:

	The purpose of this tutorial presentation is to introduce G-Networks, or Gelenbe Networks, which are product form queueing networks which include normal or positive customers, as well as negative customers which destroy other customers, and triggers which displace other customers from one queue to another. We derive the balance equations for these models in the context of multiple customer classes, show the product form results, and exhibit the traffic equations which - in this case, contrary to BCMP and Jackson networks - are non-linear. This leads to interesting issues of existence and uniqueness of the steady-state solution. Gelenbe Network can be used to model large scale computer systems and networks in which signaling functions represented by negative customers and triggers are used to achieve flow and congestion control.		The purpose of this tutorial presentation is to introduce G-Networks, or Gelenbe Networks, which are product form queueing networks which include normal or positive customers, as well as negative customers which destroy other customers, and triggers which displace other customers from one queue to another. We derive the balance equations for these models in the context of multiple customer classes, show the product form results, and exhibit the traffic equations which - in this case, contrary to BCMP and Jackson networks - are non-linear. This leads to interesting issues of existence and uniqueness of the steady-state solution. Gelenbe Network can be used to model large scale computer systems and networks in which signaling functions represented by negative customers and triggers are used to achieve flow and congestion control.
−
−	~~Document type: Part of book or chapter of book~~
−
−	~~== Full document ==~~
−	~~<pdf>Media:Draft_Content_531048962-beopen541-1408-document.pdf</pdf>~~


Line 15:		Line 10:

	* [https://link.springer.com/content/pdf/10.1007%2F3-540-45798-4_1.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-45798-4_1.pdf]		* [https://link.springer.com/content/pdf/10.1007%2F3-540-45798-4_1.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-45798-4_1.pdf]
		+
		+	* [http://link.springer.com/content/pdf/10.1007/3-540-45798-4_1 http://link.springer.com/content/pdf/10.1007/3-540-45798-4_1],
		+	: [http://dx.doi.org/10.1007/3-540-45798-4_1 http://dx.doi.org/10.1007/3-540-45798-4_1]
		+
		+	* [https://dblp.uni-trier.de/db/conf/performance/performance2002.html#Gelenbe02 https://dblp.uni-trier.de/db/conf/performance/performance2002.html#Gelenbe02],
		+	: [https://link.springer.com/chapter/10.1007/3-540-45798-4_1 https://link.springer.com/chapter/10.1007/3-540-45798-4_1],
		+	: [https://www.scipedia.com/public/Gelenbe_2007a https://www.scipedia.com/public/Gelenbe_2007a],
		+	: [https://rd.springer.com/chapter/10.1007/3-540-45798-4_1 https://rd.springer.com/chapter/10.1007/3-540-45798-4_1],
		+	: [https://academic.microsoft.com/#/detail/1593962000 https://academic.microsoft.com/#/detail/1593962000]

← Older revision	Revision as of 12:26, 14 October 2020
(No difference)