BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:10@lincs.fr
DTSTART;TZID=Europe/Paris:20110210T110000
DTEND;TZID=Europe/Paris:20110210T120000
DTSTAMP:20170313T170636Z
URL:https://www.lincs.fr/events/seeking-simplicity-in-complex-systems-2/
SUMMARY:Seeking simplicity in complex systems
DESCRIPTION:Queueing network models are an important tool in the evaluation
 of the performance of computer systems and networks. Explicit analytical
 solutions exist for a class of such models\, but features such as realistic
 global dependencies\, priorities\, or simple commonly used service
 disciplines\, preclude their direct application. Additionally\, even when
 such solutions are known\, their numerical computation may still be
 challenging due to the size of the state space of classical queueing
 models.\n\nIn this talk\, we try to show that the use of conditional
 probabilities may be valuable in exposing simple properties hidden from
 view by classical state descriptions. Examples include tandem networks with
 blocking\, multiclass models\, multi-server systems with priorities\, as
 well as guided state sampling in large systems.
CATEGORIES:Seminars
LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\,
 France
GEO:48.8283983;2.3568972000000485
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room
 40:geo:48.8283983,2.3568972000000485
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20101031T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR