A distributed dual ascent algorithm for Steiner problems in multicast routing

Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the latter case being particularly suitable to cases where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, because one cannot assume that a ce...

Full description

Saved in:
Bibliographic Details
Published inNetworks Vol. 53; no. 2; pp. 170 - 183
Main Authors Drummond, Lúcia M. A., Santos, Marcelo, Uchoa, Eduardo
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.03.2009
Subjects
distributed algorithms
multicast routing
Steiner problem in networks
Online AccessGet full text

Cover

Abstract Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the latter case being particularly suitable to cases where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, because one cannot assume that a central node has complete information about the topology and the state of a large wide area network. This article introduces a distributed version of a Dual Ascent primal‐dual heuristic, known for its remarkably good practical results, lower and upper bounds, in both undirected and directed Steiner problems. Complexity analysis and experimental results are also presented, showing the efficiency of the proposed algorithm when compared with the best distributed algorithms in the literature. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009
AbstractList Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the latter case being particularly suitable to cases where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, because one cannot assume that a central node has complete information about the topology and the state of a large wide area network. This article introduces a distributed version of a Dual Ascent primal‐dual heuristic, known for its remarkably good practical results, lower and upper bounds, in both undirected and directed Steiner problems. Complexity analysis and experimental results are also presented, showing the efficiency of the proposed algorithm when compared with the best distributed algorithms in the literature. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009
Abstract Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the latter case being particularly suitable to cases where most of the traffic has a single source. Sequential Steiner heuristics are not convenient in that context, because one cannot assume that a central node has complete information about the topology and the state of a large wide area network. This article introduces a distributed version of a Dual Ascent primal‐dual heuristic, known for its remarkably good practical results, lower and upper bounds, in both undirected and directed Steiner problems. Complexity analysis and experimental results are also presented, showing the efficiency of the proposed algorithm when compared with the best distributed algorithms in the literature. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009
Author Santos, Marcelo
Drummond, Lúcia M. A.
Uchoa, Eduardo
Author_xml – sequence: 1
  givenname: Lúcia M. A.
  surname: Drummond
  fullname: Drummond, Lúcia M. A.
  organization: Department of Computer Science, Fluminense Federal University, Brazil
– sequence: 2
  givenname: Marcelo
  surname: Santos
  fullname: Santos, Marcelo
  organization: Department of Computer Science, Fluminense Federal University, Brazil
– sequence: 3
  givenname: Eduardo
  surname: Uchoa
  fullname: Uchoa, Eduardo
  email: uchoa@producao.uff.br
  organization: Department of Production Engineering, Fluminense Federal University, Brazil
BookMark eNp1kDFPwzAQRi0EEm1h4B94ZUh7tuM4HauqtEilDBTKZjnJpRjSpLIdQf89gQIb0w333je8PjmtmxoJuWIwZAB8VGMYcuAqOSE9BmMVAQh1SnrdL40ExPKc9L1_BWBMsrRH7ia0sD44m7UBC1q0pqLG51gHaqpt42x42dGycfQhoK3R0b1rsgp3ntqa7toq2Nz4QF3TBltvL8hZaSqPlz93QB5vZuvpIlrez2-nk2WUC1BJJEGURW5MzrMSIc5UASlKiULxVAguZAIpEwhlnPE4GfMSBY-zsRQ8j9MUlBiQ6-Nu7hrvHZZ67-zOuINmoL866K6D_u7QsaMj-24rPPwP6tVs_WtER6MLgx9_hnFvOlFCSb1ZzTVPFuJps37WsfgEfWNv9A
CitedBy_id crossref_primary_10_1002_net_21713
crossref_primary_10_1142_S0129054121500362
crossref_primary_10_1007_s10878_016_0074_0
crossref_primary_10_1002_net_20277
crossref_primary_10_1007_s10766_013_0243_z
crossref_primary_10_1016_j_orl_2009_09_008
crossref_primary_10_1016_j_jpdc_2023_104717
crossref_primary_10_1002_net_22005
Cites_doi 10.1145/357195.357200
10.1016/S0166-218X(00)00319-X
10.1016/0166-218X(92)90021-2
10.1016/j.cor.2003.12.007
10.1109/49.564135
10.1007/3-540-45643-0_1
10.1109/TIT.1983.1056620
10.1016/S0305-0548(00)00029-0
10.1007/BF02612335
10.1109/90.490746
10.1016/S0305-0548(96)00074-3
10.1016/0020-0255(93)90128-9
10.1007/978-1-4613-0255-1_9
ContentType Journal Article
Copyright Copyright © 2008 Wiley Periodicals, Inc.
Copyright_xml – notice: Copyright © 2008 Wiley Periodicals, Inc.
DBID BSCLL
AAYXX
CITATION
DOI 10.1002/net.20276
DatabaseName Istex
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1097-0037
EndPage 183
ExternalDocumentID 10_1002_net_20276
NET20276
ark_67375_WNG_26H3VWTX_4
Genre article
GroupedDBID -~X
.3N
.DC
.GA
.Y3
05W
0R~
10A
123
1L6
1OB
1OC
1ZS
31~
33P
3SF
3WU
4.4
4ZD
50Y
50Z
51W
51X
52M
52N
52O
52P
52S
52T
52U
52W
52X
5VS
66C
6TJ
6TU
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
930
A03
AAESR
AAEVG
AAHHS
AANLZ
AAONW
AASGY
AAXRX
AAZKR
ABCQN
ABCUV
ABDPE
ABEFU
ABEML
ABIJN
ABTAH
ACAHQ
ACBWZ
ACCFJ
ACCZN
ACGFS
ACIWK
ACPOU
ACSCC
ACXBN
ACXQS
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADOZA
ADZMN
AEEZP
AEIGN
AEIMD
AENEX
AEQDE
AEUQT
AEUYR
AFBPY
AFFPM
AFGKR
AFPWT
AFZJQ
AHBTC
AITYG
AIURR
AIWBW
AJBDE
AJXKR
ALAGY
ALMA_UNASSIGNED_HOLDINGS
ALUQN
AMBMR
AMYDB
ARCSS
ASPBG
ATUGU
AUFTA
AVWKF
AZBYB
AZFZN
AZVAB
BAFTC
BDRZF
BFHJK
BHBCM
BMNLL
BNHUX
BROTX
BRXPI
BSCLL
BY8
CS3
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
DU5
EBS
EJD
F00
F01
F04
FEDTE
FSPIC
G-S
G.N
GODZA
H.T
H.X
HBH
HF~
HGLYW
HHY
HHZ
HVGLF
HZ~
H~9
IX1
J0M
JPC
KQQ
LATKE
LAW
LC2
LC3
LEEKS
LH4
LITHE
LOXES
LP6
LP7
LUTES
LW6
LYRES
M6L
MEWTI
MK4
MRFUL
MRSTM
MSFUL
MSSTM
MVM
MXFUL
MXSTM
N04
N05
N9A
NF~
NHB
NNB
O66
O9-
OIG
P2P
P2W
P2X
P4D
PALCI
PQQKQ
Q.N
Q11
QB0
QRW
R.K
RIWAO
RJQFR
ROL
RWI
RX1
RXW
SAMSI
SUPJJ
TAE
TN5
TUS
TWZ
UB1
V2E
W8V
W99
WBKPD
WH7
WIB
WIH
WIK
WJL
WOHZO
WQJ
WRC
WWM
WXSBR
WYISQ
XBAML
XG1
XPP
XV2
ZCA
ZY4
ZZTAW
~IA
~WT
G8K
AAYXX
CITATION
ID FETCH-LOGICAL-c3076-503fdcaac2bfe04b7d08e55e37283323560813e0f4b24692fe324b9532c488073
IEDL.DBID DR2
ISSN 0028-3045
IngestDate Fri Aug 23 01:35:06 EDT 2024
Sat Aug 24 00:47:06 EDT 2024
Wed Oct 30 10:04:07 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3076-503fdcaac2bfe04b7d08e55e37283323560813e0f4b24692fe324b9532c488073
Notes ark:/67375/WNG-26H3VWTX-4
ArticleID:NET20276
istex:9B8666AAA3E61E7F17C813A76F89DF17703C8093
PageCount 14
ParticipantIDs crossref_primary_10_1002_net_20276
wiley_primary_10_1002_net_20276_NET20276
istex_primary_ark_67375_WNG_26H3VWTX_4
PublicationCentury 2000
PublicationDate 2009-03
March 2009
2009-03-00
PublicationDateYYYYMMDD 2009-03-01
PublicationDate_xml – month: 03
  year: 2009
  text: 2009-03
PublicationDecade 2000
PublicationPlace Hoboken
PublicationPlace_xml – name: Hoboken
PublicationTitle Networks
PublicationTitleAlternate Networks
PublicationYear 2009
Publisher Wiley Subscription Services, Inc., A Wiley Company
Publisher_xml – name: Wiley Subscription Services, Inc., A Wiley Company
References V. Barbosa, An introduction to distributed algorithms, The MIT Press, Cambridge, MA, 1996.
M. Poggi de Aragão, E. Uchoa, andR. Werneck, Dual heuristics on the exact solution of Large Steiner Problems, Electron Notes Discrete Math 7 ( 2001), 46-51.
A. Shaick, andK. Shin, Destination-driven routing for low-cost multicast, IEEE J Selected Areas Commun 15 ( 1997), 373-381.
G. Chen, M. Houle, andM. Kuo, The Steiner problem in distributed computing systems, Info Sci 74 ( 1993), 73-96.
R. Novak, J. Rugelj, andG. Kundus, A note on distributed multicast routing in point-to-point networks, Comput Oper Res 26 ( 2001), 1149-1164.
C. Oliveira, andP. Pardalos, A Survey of combinatorial optimization problems in multicast routing, Comput Oper Res 32 ( 2005), 1953-1981.
S. Voss, Steiner's problem in graphs: heuristic methods, Discrete Appl Math 40 ( 1992), 45-72.
M. Poggi de Aragão, andR. Werneck, On the implementation of MST-based heuristics for the Steiner problem in graphs, Proc. of the fourth ALENEX, Lecture Notes Comput Sci 2409( 2002), 1-15.
R. Gallager, P. Humblet, andP. Spira, A distributed algorithm for minimum-weight spanning trees, ACM Trans Program Languages Systems 5 ( 1983), 66-77.
R. Novak, J. Rugelj, andG. Kundus, "Steiner tree based distributed multicast routing in networks," Steiner trees in industries, D.-Z. Du and X. Cheng (Editors), Kluwer, Dordrecht, The Netherlands, 2001, pp. 327-352.
R. Wong, A dual ascent approach for Steiner tree problems on a directed graph, Math Program 28 ( 1984), 271-287.
A. Segall, Distributed network protocols, IEEE Trans Info Theory 29 ( 1983), 23-35.
J. Rugelj, andS. Klavzar, Distributed multicast routing in point-to-point networks, Comput Oper Res 24 ( 1997), 521-527.
M. Goemans, andD. Williamson, The primal-dual method for approximation algorithms and its application to network design, Approximation algorithms for NP-hard problems, D. Hochbaum (Editor), PWS Publishing, Boston, MA, 1997, pp. 144-191.
T. Polzin, andS. Vahdati, Improved algorithms for the Steiner problem in networks, Discrete Appl Math 112 ( 2001), 263-300.
F. Bauer, andA. Varma, Distributed algorithms for multicast path setup in data networks, IEEE/ACM Trans Network 4 ( 1996), 181-191.
2001; 112
2001
2001; 7
2000
1984; 28
1997; 15
1997; 24
1993; 74
1983; 5
1998
1997
1996
2005; 32
2005
2001; 26
2002; 2409
1996; 4
1992; 53
1983; 29
1992; 40
Novak R. (e_1_2_1_10_2) 2001
Poggi de Aragão M. (e_1_2_1_13_2) 2001; 7
Barbosa V. (e_1_2_1_3_2) 1996
Goemans M. (e_1_2_1_7_2) 1997
e_1_2_1_6_2
e_1_2_1_4_2
e_1_2_1_5_2
e_1_2_1_2_2
e_1_2_1_11_2
e_1_2_1_22_2
e_1_2_1_12_2
e_1_2_1_20_2
e_1_2_1_21_2
e_1_2_1_15_2
e_1_2_1_16_2
e_1_2_1_14_2
e_1_2_1_19_2
e_1_2_1_17_2
Hwang F. (e_1_2_1_8_2) 1992
e_1_2_1_9_2
e_1_2_1_18_2
References_xml – start-page: 144
  year: 1997
  end-page: 191
– volume: 5
  start-page: 66
  year: 1983
  end-page: 77
  article-title: A distributed algorithm for minimum‐weight spanning trees
  publication-title: ACM Trans Program Languages Systems
– volume: 53
  year: 1992
– volume: 7
  start-page: 46
  year: 2001
  end-page: 51
  article-title: Dual heuristics on the exact solution of Large Steiner Problems
  publication-title: Electron Notes Discrete Math
– volume: 40
  start-page: 45
  year: 1992
  end-page: 72
  article-title: Steiner's problem in graphs: heuristic methods
  publication-title: Discrete Appl Math
– volume: 112
  start-page: 263
  year: 2001
  end-page: 300
  article-title: Improved algorithms for the Steiner problem in networks
  publication-title: Discrete Appl Math
– volume: 2409
  start-page: 1
  year: 2002
  end-page: 15
  article-title: On the implementation of MST‐based heuristics for the Steiner problem in graphs
  publication-title: Proc. of the fourth ALENEX, Lecture Notes Comput Sci
– year: 2001
– volume: 74
  start-page: 73
  year: 1993
  end-page: 96
  article-title: The Steiner problem in distributed computing systems
  publication-title: Info Sci
– volume: 24
  start-page: 521
  year: 1997
  end-page: 527
  article-title: Distributed multicast routing in point‐to‐point networks
  publication-title: Comput Oper Res
– volume: 29
  start-page: 23
  year: 1983
  end-page: 35
  article-title: Distributed network protocols
  publication-title: IEEE Trans Info Theory
– volume: 4
  start-page: 181
  year: 1996
  end-page: 191
  article-title: Distributed algorithms for multicast path setup in data networks
  publication-title: IEEE/ACM Trans Network
– year: 1996
– year: 2000
– start-page: 61
  year: 1998
  end-page: 76
– start-page: 327
  year: 2001
  end-page: 352
– volume: 28
  start-page: 271
  year: 1984
  end-page: 287
  article-title: A dual ascent approach for Steiner tree problems on a directed graph
  publication-title: Math Program
– volume: 26
  start-page: 1149
  year: 2001
  end-page: 1164
  article-title: A note on distributed multicast routing in point‐to‐point networks
  publication-title: Comput Oper Res
– start-page: 477
  year: 2005
  end-page: 484
– volume: 32
  start-page: 1953
  year: 2005
  end-page: 1981
  article-title: A Survey of combinatorial optimization problems in multicast routing
  publication-title: Comput Oper Res
– volume: 15
  start-page: 373
  year: 1997
  end-page: 381
  article-title: Destination‐driven routing for low‐cost multicast
  publication-title: IEEE J Selected Areas Commun
– ident: e_1_2_1_5_2
  doi: 10.1145/357195.357200
– start-page: 327
  volume-title: “Steiner tree based distributed multicast routing in networks,” Steiner trees in industries
  year: 2001
  ident: e_1_2_1_10_2
  contributor:
    fullname: Novak R.
– ident: e_1_2_1_21_2
– year: 1992
  ident: e_1_2_1_8_2
  contributor:
    fullname: Hwang F.
– volume: 7
  start-page: 46
  year: 2001
  ident: e_1_2_1_13_2
  article-title: Dual heuristics on the exact solution of Large Steiner Problems
  publication-title: Electron Notes Discrete Math
  contributor:
    fullname: Poggi de Aragão M.
– ident: e_1_2_1_15_2
  doi: 10.1016/S0166-218X(00)00319-X
– ident: e_1_2_1_20_2
  doi: 10.1016/0166-218X(92)90021-2
– ident: e_1_2_1_12_2
  doi: 10.1016/j.cor.2003.12.007
– volume-title: An introduction to distributed algorithms
  year: 1996
  ident: e_1_2_1_3_2
  contributor:
    fullname: Barbosa V.
– ident: e_1_2_1_18_2
  doi: 10.1109/49.564135
– ident: e_1_2_1_19_2
– ident: e_1_2_1_14_2
  doi: 10.1007/3-540-45643-0_1
– ident: e_1_2_1_17_2
  doi: 10.1109/TIT.1983.1056620
– start-page: 144
  volume-title: The primal‐dual method for approximation algorithms and its application to network design, Approximation algorithms for NP‐hard problems
  year: 1997
  ident: e_1_2_1_7_2
  contributor:
    fullname: Goemans M.
– ident: e_1_2_1_11_2
  doi: 10.1016/S0305-0548(00)00029-0
– ident: e_1_2_1_22_2
  doi: 10.1007/BF02612335
– ident: e_1_2_1_6_2
– ident: e_1_2_1_2_2
  doi: 10.1109/90.490746
– ident: e_1_2_1_16_2
  doi: 10.1016/S0305-0548(96)00074-3
– ident: e_1_2_1_4_2
  doi: 10.1016/0020-0255(93)90128-9
– ident: e_1_2_1_9_2
  doi: 10.1007/978-1-4613-0255-1_9
SSID ssj0011518
Score 1.9429923
Snippet Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the latter case being particularly suitable to cases where...
Abstract Multicast routing problems are often modeled as Steiner Problems in undirected or directed graphs, the latter case being particularly suitable to...
SourceID crossref
wiley
istex
SourceType Aggregation Database
Publisher
StartPage 170
SubjectTerms distributed algorithms
multicast routing
Steiner problem in networks
Title A distributed dual ascent algorithm for Steiner problems in multicast routing
URI https://api.istex.fr/ark:/67375/WNG-26H3VWTX-4/fulltext.pdf
https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fnet.20276
Volume 53
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ3PS8MwFMfDmBc9-Fucvwgi4qVbmzRth6ehm0PYDrq5HYSStImOaSddB-Jfb166jk0QxFsPSQmveck3zXufh9CF63l1fXAglhKSWHq_DiBZ2bGUw4Ri0mPCZHh3ul67794P2bCErotcmJwPsfjhBp5h1mtwcC6mtSVoqIRQSOIDbtuhPoRz3T4s0FFa6DhBQWCG28CCKmST2qLnyl60Bmb9XNWoZpNpbaHnYnh5bMm4OstENfr6QW785_i30eZcfOJGPlt2UEkmu2hjCUm4hzoNHANLF8pgyRhDphbmhviE-dvLJB1lr-9YC138CGUyZYrnFWmmeJRgE50Y8WmG08kM4qn3Ub_V7N20rXnJBSvSzu5ZzKYqjjiPiFDSdoUf24FkTFJfyxBKqNZHgUOlrVxB9MGaKKkFmagzSiJYCXx6gMrJJJGHCDteXXdnQJiL3Qhq_5HYp4zHiktCVFBB54Xxw4-crBHmDGUSatuExjYVdGk-y6IFT8cQiuazcNC9C4nXpk-D3jB0K-jKGPv3V4XdZs88HP296TFaz2-PIObsBJWzdCZPtQjJxJmZbd90atYV
link.rule.ids 315,783,787,1378,27936,27937,46306,46730
linkProvider Wiley-Blackwell
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB50PagH3-L6DCLipdomTdsFL-JrfewedNW9SGjaRGV1V2oXxF9vJt0uKgjirYektJNM5ksy830AW34Q1MzGgTpaKuqYeB1hsbLnaI9LzVXApa3wbjSD-o1_3ubtEdgva2EKfojhgRt6hl2v0cHxQHrvC2uowlxIGgajMGbcnaFww9HVkDzKQB0vKjmY8T6w5BVy6d6w67doNIaGff-OUm2YOZmG-_IDi-ySzm4_l7vJxw_uxv_-wQxMDfAnOSgmzCyMqO4cTH5hJZyHxgFJkU4XlbBUSrBYi8SW9InEzw-97Cl_fCEG65JrVMpUGRmI0ryRpy6xCYpJ_JaTrNfHlOoFuDk5bh3WnYHqgpMYfw8c7jKdJnGcUKmV68swdSPFuWKhQSKMMgORIo8pV_uSmr011cpgMlnjjCa4GIRsESrdXlctAfGCmunOkWQu9ROU_6NpyHic6lhRqqMqbJbWF68FuYYoaJSpMLYR1jZV2LbjMmwRZx3MRgu5uGueChrU2e1dqy38KuxYa__-KtE8btmH5b833YDxeqtxKS7PmhcrMFFcJmEK2ipU8qyv1gwmyeW6nXqf23TaLQ
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ3fT9swEMdPrEjTeGCwDdGxgYWmaS9pEzt2UvGEBqX8aDVt7doHJCtObECwtAqphPbXz-c0FUyaNPGWBztKLj776_jucwCfQiE6duNAPaM09ex6HWOycuCZgCvDteDKZXj3B6I3Cs8mfLICB3UuTMWHWP5wQ89w8zU6-Cwz7UfQUI2hkDQSL2A1FFb5oiL6vmRHWaUTxDWCGY8Da6yQT9vLrk8Wo1W068NTkepWme5ruKyfrwouuW3NS9VKf_-FbnzmC2zA-kJ9ksNquGzCis7fwNojJuFb6B-SDGG6WAdLZwRTtUjikE8kubuaFjfl9S9ilS75gXUydUEWJWnuyU1OXHhimtyXpJjOMaD6HYy6x8OvPW9Rc8FLrbcLj_vMZGmSpFQZ7YcqyvxYc65ZZHUIo8wKpDhg2jehonZnTY22ikx1OKMpTgUR24JGPs31NpBAdGx3joi5LEyx-B_NIsaTzCSaUhM3Yb82vpxVaA1ZQZSptLaRzjZN-Ow-y7JFUtxiLFrE5XhwIqnosZ_j4USGTfjijP3vW8nB8dBdvP__pnvw8ttRV16cDs534FV1koTxZx-gURZz_dEKklLtuoH3B24r2Nw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+distributed+dual+ascent+algorithm+for+Steiner+problems+in+multicast+routing&rft.jtitle=Networks&rft.au=Drummond%2C+L%C3%BAcia+M.+A.&rft.au=Santos%2C+Marcelo&rft.au=Uchoa%2C+Eduardo&rft.date=2009-03-01&rft.pub=Wiley+Subscription+Services%2C+Inc.%2C+A+Wiley+Company&rft.issn=0028-3045&rft.eissn=1097-0037&rft.volume=53&rft.issue=2&rft.spage=170&rft.epage=183&rft_id=info:doi/10.1002%2Fnet.20276&rft.externalDBID=10.1002%252Fnet.20276&rft.externalDocID=NET20276
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0028-3045&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0028-3045&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0028-3045&client=summon