Routing messages with release time and deadline constraints

Routing messages with release time and deadline constraints

The problem of deciding if a set of real-time messages can be transmitted in a unidirectional ring network with m>1 nodes is considered. Complexity results are given for various restrictions on the four parameters associated with each message: origin node, destination node, release time and deadl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Leung, J.Y.-J., Tam, T.W., Wong, C.S., Young, G.H.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Centralized control
Communication system control
Computer science
Integral equations
Message passing
Polynomials
Real time systems
Routing
Time factors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 177
container_issue
container_start_page 168
container_title
container_volume
creator Leung, J.Y.-J.
Tam, T.W.
Wong, C.S.
Young, G.H.
description The problem of deciding if a set of real-time messages can be transmitted in a unidirectional ring network with m>1 nodes is considered. Complexity results are given for various restrictions on the four parameters associated with each message: origin node, destination node, release time and deadline. For nonpreemptive transmission, it is shown that the problem is solvable in polynomial time for any case when only one of the four parameters is allowed to be arbitrary. Also shown is that it is NP-complete for each case when any two of the four parameters are fixed. For preemptive transmission, the problem is solvable in polynomial time for any case when only one of the four parameters is allowed to be arbitrary. Also, it is NP-complete for each case when any two of the four parameters are fixed, except the following two cases: (1) same origin node and release time; and (2) same destination node and deadline.< >
doi_str_mv 10.1109/EMWRT.1989.43456
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_43456</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>43456</ieee_id><sourcerecordid>43456</sourcerecordid><originalsourceid>FETCH-LOGICAL-i86t-31d139df4eec724f0635fbc45d54bf9f8a747c027fa235fbf69ffdb1c92dadab3</originalsourceid><addsrcrecordid>eNotj0tLxDAURgMiqOPsdZc_0JqbVxtcyTA-YEQYCi6H2-RmjLQdaSLiv_f5bc7iwIGPsQsQNYBwV-vH521Xg2tdrZU29oidiRZaC85YecKWOb-K72kDIJtTdr09vJc07flIOeOeMv9I5YXPNBBm4iWNxHEKPBCGIU3E_WHKZcY0lXzOjiMOmZb_XLDudt2t7qvN093D6mZTpdaWSkEA5ULURL6ROgqrTOy9NsHoPrrYYqMbL2QTUf6YaF2MoQfvZMCAvVqwy79sIqLd25xGnD93v-fUF-01Rt4</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Routing messages with release time and deadline constraints</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Leung, J.Y.-J. ; Tam, T.W. ; Wong, C.S. ; Young, G.H.</creator><creatorcontrib>Leung, J.Y.-J. ; Tam, T.W. ; Wong, C.S. ; Young, G.H.</creatorcontrib><description>The problem of deciding if a set of real-time messages can be transmitted in a unidirectional ring network with m&gt;1 nodes is considered. Complexity results are given for various restrictions on the four parameters associated with each message: origin node, destination node, release time and deadline. For nonpreemptive transmission, it is shown that the problem is solvable in polynomial time for any case when only one of the four parameters is allowed to be arbitrary. Also shown is that it is NP-complete for each case when any two of the four parameters are fixed. For preemptive transmission, the problem is solvable in polynomial time for any case when only one of the four parameters is allowed to be arbitrary. Also, it is NP-complete for each case when any two of the four parameters are fixed, except the following two cases: (1) same origin node and release time; and (2) same destination node and deadline.&lt; &gt;</description><identifier>ISBN: 0818619562</identifier><identifier>ISBN: 9780818619564</identifier><identifier>DOI: 10.1109/EMWRT.1989.43456</identifier><language>eng</language><publisher>IEEE Comput. Soc. Press</publisher><subject>Centralized control ; Communication system control ; Computer science ; Integral equations ; Message passing ; Polynomials ; Real time systems ; Routing ; Time factors</subject><ispartof>[1989] Proceedings. EUROMICRO Workshop on Real Time, 1989, p.168-177</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/43456$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,4049,4050,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/43456$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Leung, J.Y.-J.</creatorcontrib><creatorcontrib>Tam, T.W.</creatorcontrib><creatorcontrib>Wong, C.S.</creatorcontrib><creatorcontrib>Young, G.H.</creatorcontrib><title>Routing messages with release time and deadline constraints</title><title>[1989] Proceedings. EUROMICRO Workshop on Real Time</title><addtitle>EMWRT</addtitle><description>The problem of deciding if a set of real-time messages can be transmitted in a unidirectional ring network with m&gt;1 nodes is considered. Complexity results are given for various restrictions on the four parameters associated with each message: origin node, destination node, release time and deadline. For nonpreemptive transmission, it is shown that the problem is solvable in polynomial time for any case when only one of the four parameters is allowed to be arbitrary. Also shown is that it is NP-complete for each case when any two of the four parameters are fixed. For preemptive transmission, the problem is solvable in polynomial time for any case when only one of the four parameters is allowed to be arbitrary. Also, it is NP-complete for each case when any two of the four parameters are fixed, except the following two cases: (1) same origin node and release time; and (2) same destination node and deadline.&lt; &gt;</description><subject>Centralized control</subject><subject>Communication system control</subject><subject>Computer science</subject><subject>Integral equations</subject><subject>Message passing</subject><subject>Polynomials</subject><subject>Real time systems</subject><subject>Routing</subject><subject>Time factors</subject><isbn>0818619562</isbn><isbn>9780818619564</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1989</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj0tLxDAURgMiqOPsdZc_0JqbVxtcyTA-YEQYCi6H2-RmjLQdaSLiv_f5bc7iwIGPsQsQNYBwV-vH521Xg2tdrZU29oidiRZaC85YecKWOb-K72kDIJtTdr09vJc07flIOeOeMv9I5YXPNBBm4iWNxHEKPBCGIU3E_WHKZcY0lXzOjiMOmZb_XLDudt2t7qvN093D6mZTpdaWSkEA5ULURL6ROgqrTOy9NsHoPrrYYqMbL2QTUf6YaF2MoQfvZMCAvVqwy79sIqLd25xGnD93v-fUF-01Rt4</recordid><startdate>1989</startdate><enddate>1989</enddate><creator>Leung, J.Y.-J.</creator><creator>Tam, T.W.</creator><creator>Wong, C.S.</creator><creator>Young, G.H.</creator><general>IEEE Comput. Soc. Press</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1989</creationdate><title>Routing messages with release time and deadline constraints</title><author>Leung, J.Y.-J. ; Tam, T.W. ; Wong, C.S. ; Young, G.H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i86t-31d139df4eec724f0635fbc45d54bf9f8a747c027fa235fbf69ffdb1c92dadab3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1989</creationdate><topic>Centralized control</topic><topic>Communication system control</topic><topic>Computer science</topic><topic>Integral equations</topic><topic>Message passing</topic><topic>Polynomials</topic><topic>Real time systems</topic><topic>Routing</topic><topic>Time factors</topic><toplevel>online_resources</toplevel><creatorcontrib>Leung, J.Y.-J.</creatorcontrib><creatorcontrib>Tam, T.W.</creatorcontrib><creatorcontrib>Wong, C.S.</creatorcontrib><creatorcontrib>Young, G.H.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Leung, J.Y.-J.</au><au>Tam, T.W.</au><au>Wong, C.S.</au><au>Young, G.H.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Routing messages with release time and deadline constraints</atitle><btitle>[1989] Proceedings. EUROMICRO Workshop on Real Time</btitle><stitle>EMWRT</stitle><date>1989</date><risdate>1989</risdate><spage>168</spage><epage>177</epage><pages>168-177</pages><isbn>0818619562</isbn><isbn>9780818619564</isbn><abstract>The problem of deciding if a set of real-time messages can be transmitted in a unidirectional ring network with m&gt;1 nodes is considered. Complexity results are given for various restrictions on the four parameters associated with each message: origin node, destination node, release time and deadline. For nonpreemptive transmission, it is shown that the problem is solvable in polynomial time for any case when only one of the four parameters is allowed to be arbitrary. Also shown is that it is NP-complete for each case when any two of the four parameters are fixed. For preemptive transmission, the problem is solvable in polynomial time for any case when only one of the four parameters is allowed to be arbitrary. Also, it is NP-complete for each case when any two of the four parameters are fixed, except the following two cases: (1) same origin node and release time; and (2) same destination node and deadline.&lt; &gt;</abstract><pub>IEEE Comput. Soc. Press</pub><doi>10.1109/EMWRT.1989.43456</doi><tpages>10</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0818619562
ispartof [1989] Proceedings. EUROMICRO Workshop on Real Time, 1989, p.168-177
issn
language eng
recordid cdi_ieee_primary_43456
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Centralized control
Communication system control
Computer science
Integral equations
Message passing
Polynomials
Real time systems
Routing
Time factors
title Routing messages with release time and deadline constraints
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T21%3A32%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Routing%20messages%20with%20release%20time%20and%20deadline%20constraints&rft.btitle=%5B1989%5D%20Proceedings.%20EUROMICRO%20Workshop%20on%20Real%20Time&rft.au=Leung,%20J.Y.-J.&rft.date=1989&rft.spage=168&rft.epage=177&rft.pages=168-177&rft.isbn=0818619562&rft.isbn_list=9780818619564&rft_id=info:doi/10.1109/EMWRT.1989.43456&rft_dat=%3Cieee_6IE%3E43456%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=43456&rfr_iscdi=true