Adversarial Queueing Model for Continuous Network Dynamics
Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in w...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Blesa, Maria [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2007 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2007 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Theory of computing systems - Springer-Verlag, 1997, 44(2007), 3 vom: 28. Sept., Seite 304-331 |
|---|---|
| Übergeordnetes Werk: |
volume:44 ; year:2007 ; number:3 ; day:28 ; month:09 ; pages:304-331 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00224-007-9046-1 |
|---|
| Katalog-ID: |
OLC2061917704 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2061917704 | ||
| 003 | DE-627 | ||
| 005 | 20230323224807.0 | ||
| 007 | tu | ||
| 008 | 200819s2007 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00224-007-9046-1 |2 doi | |
| 035 | |a (DE-627)OLC2061917704 | ||
| 035 | |a (DE-He213)s00224-007-9046-1-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 510 |q VZ |
| 082 | 0 | 4 | |a 510 |a 000 |q VZ |
| 100 | 1 | |a Blesa, Maria |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Adversarial Queueing Model for Continuous Network Dynamics |
| 264 | 1 | |c 2007 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media, LLC 2007 | ||
| 520 | |a Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. | ||
| 650 | 4 | |a Adversarial queueing theory | |
| 650 | 4 | |a Packet-switched networks | |
| 650 | 4 | |a Stability of networks | |
| 650 | 4 | |a Stability of queueing policies | |
| 700 | 1 | |a Calzada, Daniel |4 aut | |
| 700 | 1 | |a Fernández, Antonio |4 aut | |
| 700 | 1 | |a López, Luis |4 aut | |
| 700 | 1 | |a Martínez, Andrés L. |4 aut | |
| 700 | 1 | |a Santos, Agustín |4 aut | |
| 700 | 1 | |a Serna, Maria |4 aut | |
| 700 | 1 | |a Thraves, Christopher |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Theory of computing systems |d Springer-Verlag, 1997 |g 44(2007), 3 vom: 28. Sept., Seite 304-331 |w (DE-627)222610387 |w (DE-600)1355722-1 |w (DE-576)056755198 |x 1432-4350 |7 nnns |
| 773 | 1 | 8 | |g volume:44 |g year:2007 |g number:3 |g day:28 |g month:09 |g pages:304-331 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00224-007-9046-1 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_21 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2012 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_4029 | ||
| 912 | |a GBV_ILN_4035 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4319 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 44 |j 2007 |e 3 |b 28 |c 09 |h 304-331 | ||
| author_variant |
m b mb d c dc a f af l l ll a l m al alm a s as m s ms c t ct |
|---|---|
| matchkey_str |
article:14324350:2007----::desraqeenmdlocniuun |
| hierarchy_sort_str |
2007 |
| publishDate |
2007 |
| allfields |
10.1007/s00224-007-9046-1 doi (DE-627)OLC2061917704 (DE-He213)s00224-007-9046-1-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Blesa, Maria verfasserin aut Adversarial Queueing Model for Continuous Network Dynamics 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. Adversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies Calzada, Daniel aut Fernández, Antonio aut López, Luis aut Martínez, Andrés L. aut Santos, Agustín aut Serna, Maria aut Thraves, Christopher aut Enthalten in Theory of computing systems Springer-Verlag, 1997 44(2007), 3 vom: 28. Sept., Seite 304-331 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:44 year:2007 number:3 day:28 month:09 pages:304-331 https://doi.org/10.1007/s00224-007-9046-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2190 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 AR 44 2007 3 28 09 304-331 |
| spelling |
10.1007/s00224-007-9046-1 doi (DE-627)OLC2061917704 (DE-He213)s00224-007-9046-1-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Blesa, Maria verfasserin aut Adversarial Queueing Model for Continuous Network Dynamics 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. Adversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies Calzada, Daniel aut Fernández, Antonio aut López, Luis aut Martínez, Andrés L. aut Santos, Agustín aut Serna, Maria aut Thraves, Christopher aut Enthalten in Theory of computing systems Springer-Verlag, 1997 44(2007), 3 vom: 28. Sept., Seite 304-331 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:44 year:2007 number:3 day:28 month:09 pages:304-331 https://doi.org/10.1007/s00224-007-9046-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2190 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 AR 44 2007 3 28 09 304-331 |
| allfields_unstemmed |
10.1007/s00224-007-9046-1 doi (DE-627)OLC2061917704 (DE-He213)s00224-007-9046-1-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Blesa, Maria verfasserin aut Adversarial Queueing Model for Continuous Network Dynamics 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. Adversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies Calzada, Daniel aut Fernández, Antonio aut López, Luis aut Martínez, Andrés L. aut Santos, Agustín aut Serna, Maria aut Thraves, Christopher aut Enthalten in Theory of computing systems Springer-Verlag, 1997 44(2007), 3 vom: 28. Sept., Seite 304-331 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:44 year:2007 number:3 day:28 month:09 pages:304-331 https://doi.org/10.1007/s00224-007-9046-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2190 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 AR 44 2007 3 28 09 304-331 |
| allfieldsGer |
10.1007/s00224-007-9046-1 doi (DE-627)OLC2061917704 (DE-He213)s00224-007-9046-1-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Blesa, Maria verfasserin aut Adversarial Queueing Model for Continuous Network Dynamics 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. Adversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies Calzada, Daniel aut Fernández, Antonio aut López, Luis aut Martínez, Andrés L. aut Santos, Agustín aut Serna, Maria aut Thraves, Christopher aut Enthalten in Theory of computing systems Springer-Verlag, 1997 44(2007), 3 vom: 28. Sept., Seite 304-331 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:44 year:2007 number:3 day:28 month:09 pages:304-331 https://doi.org/10.1007/s00224-007-9046-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2190 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 AR 44 2007 3 28 09 304-331 |
| allfieldsSound |
10.1007/s00224-007-9046-1 doi (DE-627)OLC2061917704 (DE-He213)s00224-007-9046-1-p DE-627 ger DE-627 rakwb eng 004 510 VZ 510 000 VZ Blesa, Maria verfasserin aut Adversarial Queueing Model for Continuous Network Dynamics 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. Adversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies Calzada, Daniel aut Fernández, Antonio aut López, Luis aut Martínez, Andrés L. aut Santos, Agustín aut Serna, Maria aut Thraves, Christopher aut Enthalten in Theory of computing systems Springer-Verlag, 1997 44(2007), 3 vom: 28. Sept., Seite 304-331 (DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 1432-4350 nnns volume:44 year:2007 number:3 day:28 month:09 pages:304-331 https://doi.org/10.1007/s00224-007-9046-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2190 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 AR 44 2007 3 28 09 304-331 |
| language |
English |
| source |
Enthalten in Theory of computing systems 44(2007), 3 vom: 28. Sept., Seite 304-331 volume:44 year:2007 number:3 day:28 month:09 pages:304-331 |
| sourceStr |
Enthalten in Theory of computing systems 44(2007), 3 vom: 28. Sept., Seite 304-331 volume:44 year:2007 number:3 day:28 month:09 pages:304-331 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Adversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Theory of computing systems |
| authorswithroles_txt_mv |
Blesa, Maria @@aut@@ Calzada, Daniel @@aut@@ Fernández, Antonio @@aut@@ López, Luis @@aut@@ Martínez, Andrés L. @@aut@@ Santos, Agustín @@aut@@ Serna, Maria @@aut@@ Thraves, Christopher @@aut@@ |
| publishDateDaySort_date |
2007-09-28T00:00:00Z |
| hierarchy_top_id |
222610387 |
| dewey-sort |
14 |
| id |
OLC2061917704 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2061917704</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323224807.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00224-007-9046-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2061917704</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00224-007-9046-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">000</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Blesa, Maria</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Adversarial Queueing Model for Continuous Network Dynamics</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Adversarial queueing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Packet-switched networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stability of networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stability of queueing policies</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Calzada, Daniel</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fernández, Antonio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">López, Luis</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martínez, Andrés L.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Santos, Agustín</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Serna, Maria</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thraves, Christopher</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theory of computing systems</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">44(2007), 3 vom: 28. Sept., Seite 304-331</subfield><subfield code="w">(DE-627)222610387</subfield><subfield code="w">(DE-600)1355722-1</subfield><subfield code="w">(DE-576)056755198</subfield><subfield code="x">1432-4350</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:3</subfield><subfield code="g">day:28</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:304-331</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00224-007-9046-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">2007</subfield><subfield code="e">3</subfield><subfield code="b">28</subfield><subfield code="c">09</subfield><subfield code="h">304-331</subfield></datafield></record></collection>
|
| author |
Blesa, Maria |
| spellingShingle |
Blesa, Maria ddc 004 ddc 510 misc Adversarial queueing theory misc Packet-switched networks misc Stability of networks misc Stability of queueing policies Adversarial Queueing Model for Continuous Network Dynamics |
| authorStr |
Blesa, Maria |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)222610387 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 510 - Mathematics 000 - Computer science, information & general works |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1432-4350 |
| topic_title |
004 510 VZ 510 000 VZ Adversarial Queueing Model for Continuous Network Dynamics Adversarial queueing theory Packet-switched networks Stability of networks Stability of queueing policies |
| topic |
ddc 004 ddc 510 misc Adversarial queueing theory misc Packet-switched networks misc Stability of networks misc Stability of queueing policies |
| topic_unstemmed |
ddc 004 ddc 510 misc Adversarial queueing theory misc Packet-switched networks misc Stability of networks misc Stability of queueing policies |
| topic_browse |
ddc 004 ddc 510 misc Adversarial queueing theory misc Packet-switched networks misc Stability of networks misc Stability of queueing policies |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Theory of computing systems |
| hierarchy_parent_id |
222610387 |
| dewey-tens |
000 - Computer science, knowledge & systems 510 - Mathematics |
| hierarchy_top_title |
Theory of computing systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)222610387 (DE-600)1355722-1 (DE-576)056755198 |
| title |
Adversarial Queueing Model for Continuous Network Dynamics |
| ctrlnum |
(DE-627)OLC2061917704 (DE-He213)s00224-007-9046-1-p |
| title_full |
Adversarial Queueing Model for Continuous Network Dynamics |
| author_sort |
Blesa, Maria |
| journal |
Theory of computing systems |
| journalStr |
Theory of computing systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 500 - Science |
| recordtype |
marc |
| publishDateSort |
2007 |
| contenttype_str_mv |
txt |
| container_start_page |
304 |
| author_browse |
Blesa, Maria Calzada, Daniel Fernández, Antonio López, Luis Martínez, Andrés L. Santos, Agustín Serna, Maria Thraves, Christopher |
| container_volume |
44 |
| class |
004 510 VZ 510 000 VZ |
| format_se |
Aufsätze |
| author-letter |
Blesa, Maria |
| doi_str_mv |
10.1007/s00224-007-9046-1 |
| dewey-full |
004 510 000 |
| title_sort |
adversarial queueing model for continuous network dynamics |
| title_auth |
Adversarial Queueing Model for Continuous Network Dynamics |
| abstract |
Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. © Springer Science+Business Media, LLC 2007 |
| abstractGer |
Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. © Springer Science+Business Media, LLC 2007 |
| abstract_unstemmed |
Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model. © Springer Science+Business Media, LLC 2007 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-MAT GBV_ILN_21 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_40 GBV_ILN_70 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2190 GBV_ILN_4029 GBV_ILN_4035 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4307 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4324 GBV_ILN_4700 |
| container_issue |
3 |
| title_short |
Adversarial Queueing Model for Continuous Network Dynamics |
| url |
https://doi.org/10.1007/s00224-007-9046-1 |
| remote_bool |
false |
| author2 |
Calzada, Daniel Fernández, Antonio López, Luis Martínez, Andrés L. Santos, Agustín Serna, Maria Thraves, Christopher |
| author2Str |
Calzada, Daniel Fernández, Antonio López, Luis Martínez, Andrés L. Santos, Agustín Serna, Maria Thraves, Christopher |
| ppnlink |
222610387 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00224-007-9046-1 |
| up_date |
2024-07-04T04:46:03.046Z |
| _version_ |
1803622403851419648 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2061917704</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323224807.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00224-007-9046-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2061917704</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00224-007-9046-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">000</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Blesa, Maria</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Adversarial Queueing Model for Continuous Network Dynamics</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media, LLC 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper we initiate the generalization of the Adversarial Queueing Theory (aqt) model to capture the dynamics of continuous scenarios in which the usually assumed synchronicity of the evolution is not required anymore. We propose an asynchronous model, named continuousaqt (caqt), in which packets can have arbitrary lengths, and the network links may have different speeds (or bandwidths) and propagation delays. With respect to the standard aqt model, these new features turn out to be significant for the stability of packet scheduling policies that take them into account, but not so much for the stability of networks. From the network point of view, we show that networks with directed acyclic topologies are universally stable, i.e., stable independently of the scheduling policies and traffic patterns used in it. Interestingly enough, this even holds for traffic patterns that make links to be fully loaded. Finally, it turns out that the set of universally stable networks remains the same as in the aqt model and, therefore, the property of universal stability of networks is decidable in polynomial time. Concerning packet scheduling policies, we show that the well-known lis, sis, ftgand nfsscheduling policies remain universally stable in the caqt model. We introduce other scheduling policies that, although being universally stable in the aqt model, they are unstable under the caqt model.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Adversarial queueing theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Packet-switched networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stability of networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stability of queueing policies</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Calzada, Daniel</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fernández, Antonio</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">López, Luis</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martínez, Andrés L.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Santos, Agustín</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Serna, Maria</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Thraves, Christopher</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Theory of computing systems</subfield><subfield code="d">Springer-Verlag, 1997</subfield><subfield code="g">44(2007), 3 vom: 28. Sept., Seite 304-331</subfield><subfield code="w">(DE-627)222610387</subfield><subfield code="w">(DE-600)1355722-1</subfield><subfield code="w">(DE-576)056755198</subfield><subfield code="x">1432-4350</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:3</subfield><subfield code="g">day:28</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:304-331</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00224-007-9046-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">2007</subfield><subfield code="e">3</subfield><subfield code="b">28</subfield><subfield code="c">09</subfield><subfield code="h">304-331</subfield></datafield></record></collection>
|
| score |
7.3980417 |