A cooperative partial snapshot algorithm for checkpoint‐rollback recovery of large‐scale and dynamic distributed systems and experimental evaluations

Summary A distributed system consisting of a huge number of computational entities is prone to faults because faults in a few nodes cause the entire system to fail. Consequently, fault tolerance of distributed systems is a critical issue. Checkpoint‐rollback recovery is a universal and representativ...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Concurrency and computation Ročník 33; číslo 12
Hlavní autoři:	Nakamura, Junya, Kim, Yonghwan, Katayama, Yoshiaki, Masuzawa, Toshimitsu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken Wiley Subscription Services, Inc 25.06.2021
Témata:	Algorithms checkpoint‐rollback Computer networks Configurations Coordination distributed algorithm Fault tolerance Nodes Recovery snapshot Systems analysis
ISSN:	1532-0626, 1532-0634
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Summary A distributed system consisting of a huge number of computational entities is prone to faults because faults in a few nodes cause the entire system to fail. Consequently, fault tolerance of distributed systems is a critical issue. Checkpoint‐rollback recovery is a universal and representative technique for fault tolerance; it periodically records the entire system state (configuration) to non‐volatile storage, and the system restores itself using the recorded configuration when the system fails. To record a configuration of a distributed system, a specific algorithm known as a snapshot algorithm is required. However, many snapshot algorithms require coordination among all nodes in the system; thus, frequent executions of snapshot algorithms require unacceptable communication cost, especially if the systems are large. As a sophisticated snapshot algorithm, a partial snapshot algorithm has been introduced that takes a partial snapshot (instead of a global snapshot). However, if two or more partial snapshot algorithms are concurrently executed, and their snapshot domains overlap, they should coordinate, so that the partial snapshots (taken by the algorithms) are consistent. In this paper, we propose a new efficient partial snapshot algorithm with the aim of reducing communication for the coordination. In a simulation, we show that the proposed algorithm drastically outperforms the existing partial snapshot algorithm, in terms of message and time complexity.
AbstractList	A distributed system consisting of a huge number of computational entities is prone to faults because faults in a few nodes cause the entire system to fail. Consequently, fault tolerance of distributed systems is a critical issue. Checkpoint‐rollback recovery is a universal and representative technique for fault tolerance; it periodically records the entire system state (configuration) to non‐volatile storage, and the system restores itself using the recorded configuration when the system fails. To record a configuration of a distributed system, a specific algorithm known as a snapshot algorithm is required. However, many snapshot algorithms require coordination among all nodes in the system; thus, frequent executions of snapshot algorithms require unacceptable communication cost, especially if the systems are large. As a sophisticated snapshot algorithm, a partial snapshot algorithm has been introduced that takes a partial snapshot (instead of a global snapshot). However, if two or more partial snapshot algorithms are concurrently executed, and their snapshot domains overlap, they should coordinate, so that the partial snapshots (taken by the algorithms) are consistent. In this paper, we propose a new efficient partial snapshot algorithm with the aim of reducing communication for the coordination. In a simulation, we show that the proposed algorithm drastically outperforms the existing partial snapshot algorithm, in terms of message and time complexity. Summary A distributed system consisting of a huge number of computational entities is prone to faults because faults in a few nodes cause the entire system to fail. Consequently, fault tolerance of distributed systems is a critical issue. Checkpoint‐rollback recovery is a universal and representative technique for fault tolerance; it periodically records the entire system state (configuration) to non‐volatile storage, and the system restores itself using the recorded configuration when the system fails. To record a configuration of a distributed system, a specific algorithm known as a snapshot algorithm is required. However, many snapshot algorithms require coordination among all nodes in the system; thus, frequent executions of snapshot algorithms require unacceptable communication cost, especially if the systems are large. As a sophisticated snapshot algorithm, a partial snapshot algorithm has been introduced that takes a partial snapshot (instead of a global snapshot). However, if two or more partial snapshot algorithms are concurrently executed, and their snapshot domains overlap, they should coordinate, so that the partial snapshots (taken by the algorithms) are consistent. In this paper, we propose a new efficient partial snapshot algorithm with the aim of reducing communication for the coordination. In a simulation, we show that the proposed algorithm drastically outperforms the existing partial snapshot algorithm, in terms of message and time complexity.
Author	Katayama, Yoshiaki Masuzawa, Toshimitsu Kim, Yonghwan Nakamura, Junya
Author_xml	– sequence: 1 givenname: Junya orcidid: 0000-0002-1363-4358 surname: Nakamura fullname: Nakamura, Junya email: junya@imc.tut.ac.jp organization: Toyohashi University of Technology – sequence: 2 givenname: Yonghwan orcidid: 0000-0002-5437-7626 surname: Kim fullname: Kim, Yonghwan organization: Nagoya Institute of Technology – sequence: 3 givenname: Yoshiaki surname: Katayama fullname: Katayama, Yoshiaki organization: Nagoya Institute of Technology – sequence: 4 givenname: Toshimitsu surname: Masuzawa fullname: Masuzawa, Toshimitsu organization: Osaka University
BookMark	eNp1UMuO1DAQtNAisTsg8QmWuHDJ4MRxQo6r0fKQVoIDnKNOu73jXY8dbM-wufEJXPk9vgTvDOKA4NQtVXVVdV2wMx88Mfa8FutaiOYVzrRWXds_Yue1kk0lOtme_dmb7gm7SOlWiLoWsj5nPy45hjBThGwPxGeI2YLjycOctiFzcDch2rzdcRMixy3h3Ryszz-_fY_BuQnwjkfCcKC48GC4g3hDBUwIjjh4zfXiYWeRa5tytNM-k-ZpSZl26YjTfXG3O_K5-NIB3L5ECT49ZY8NuETPfs8V-_zm6tPmXXX94e37zeV1hc0g-6obJkJA1csOUUHXy9d6UqgGIxqpDWoNrTHTNAEpJWnogAatqG81UCsmI1fsxUl3juHLnlIeb8M--mI5NkrWbSOaMlfs5YmFMaQUyYxzCQ1xGWsxPhQ_luLHh-ILdf0XFW0-_pQjWPevg-p08NU6Wv4rPG4-Xh35vwDJGJ4e
CitedBy_id	crossref_primary_10_1051_e3sconf_202235101012 crossref_primary_10_1002_cpe_8081 crossref_primary_10_1007_s00607_022_01110_4 crossref_primary_10_1007_s10115_025_02509_z crossref_primary_10_3390_electronics10121428 crossref_primary_10_4018_IJCAC_305214 crossref_primary_10_1049_2024_6582682
Cites_doi	10.1145/568522.568525 10.1109/TPDS.2009.108 10.1002/ecjc.20208 10.1016/0020-0190(87)90125-6 10.1109/71.342127 10.1109/TSE.1982.235418 10.1145/1183401.1183439 10.1109/TPDS.2010.24 10.1109/71.798312 10.1007/978-3-642-24550-3_39 10.1145/214451.214456 10.1109/CANDARW.2018.00060 10.1109/TSE.1987.232562 10.1587/transinf.E97.D.65
ContentType	Journal Article
Copyright	2020 John Wiley & Sons, Ltd. 2021 John Wiley & Sons, Ltd.
Copyright_xml	– notice: 2020 John Wiley & Sons, Ltd. – notice: 2021 John Wiley & Sons, Ltd.
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1002/cpe.5647
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts CrossRef
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1532-0634
EndPage	n/a
ExternalDocumentID	10_1002_cpe_5647 CPE5647
Genre	article
GrantInformation_xml	– fundername: Japan Society for the Promotion of Science funderid: JP16K16035; JP18K18029; JP19H04085
GroupedDBID	.3N .DC .GA 05W 0R~ 10A 1L6 1OC 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHHS AAHQN AAMNL AANLZ AAONW AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACCFJ ACCZN ACPOU ACSCC ACXBN ACXQS ADBBV ADEOM ADIZJ ADKYN ADMGS ADOZA ADXAS ADZMN ADZOD AEEZP AEIGN AEIMD AEQDE AEUQT AEUYR AFBPY AFFPM AFGKR AFPWT AFWVQ AHBTC AITYG AIURR AIWBW AJBDE AJXKR ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ATUGU AUFTA AZBYB BAFTC BDRZF BFHJK BHBCM BMNLL BROTX BRXPI BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBS F00 F01 F04 F5P G-S G.N GNP GODZA HGLYW HHY HZ~ IX1 JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A O66 O9- OIG P2W P2X P4D PQQKQ Q.N Q11 QB0 QRW R.K ROL RWI RX1 SUPJJ TN5 UB1 V2E W8V W99 WBKPD WIH WIK WOHZO WQJ WRC WXSBR WYISQ WZISG XG1 XV2 ~IA ~WT AAYXX ADMLS AEYWJ AGHNM AGYGG CITATION O8X 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c2937-69becac5736cc5a6738db5c59f023dfcdda4ffbbbae553e96ae9d5e74dae40bf3
IEDL.DBID	DRFUL
ISICitedReferencesCount	6
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000653494600014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1532-0626
IngestDate	Fri Jul 25 05:49:53 EDT 2025 Sat Nov 29 01:41:23 EST 2025 Tue Nov 18 22:42:34 EST 2025 Wed Jan 22 16:29:13 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	12
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c2937-69becac5736cc5a6738db5c59f023dfcdda4ffbbbae553e96ae9d5e74dae40bf3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-5437-7626 0000-0002-1363-4358
PQID	2531420225
PQPubID	2045170
PageCount	19
ParticipantIDs	proquest_journals_2531420225 crossref_primary_10_1002_cpe_5647 crossref_citationtrail_10_1002_cpe_5647 wiley_primary_10_1002_cpe_5647_CPE5647
PublicationCentury	2000
PublicationDate	25 June 2021
PublicationDateYYYYMMDD	2021-06-25
PublicationDate_xml	– month: 06 year: 2021 text: 25 June 2021 day: 25
PublicationDecade	2020
PublicationPlace	Hoboken
PublicationPlace_xml	– name: Hoboken
PublicationTitle	Concurrency and computation
PublicationYear	2021
Publisher	Wiley Subscription Services, Inc
Publisher_xml	– name: Wiley Subscription Services, Inc
References	1982; SE‐8 1987; 25 2010; 21 2001 2011 1985; 3 2002; 34 2014; E97‐D 1998 1986 1997 2018 1984 2006 1999; 10 1994 1987; SE‐13 1995; 6 2005; 88 Tange O (e_1_2_9_22_1) 2018 e_1_2_9_20_1 e_1_2_9_11_1 e_1_2_9_10_1 e_1_2_9_21_1 e_1_2_9_13_1 e_1_2_9_12_1 e_1_2_9_8_1 e_1_2_9_7_1 e_1_2_9_6_1 e_1_2_9_5_1 e_1_2_9_4_1 e_1_2_9_3_1 e_1_2_9_2_1 e_1_2_9_9_1 e_1_2_9_15_1 e_1_2_9_14_1 e_1_2_9_17_1 e_1_2_9_16_1 e_1_2_9_19_1 e_1_2_9_18_1
References_xml	– volume: 88 start-page: 43 issue: 12 year: 2005 end-page: 57 article-title: Dynamic snapshot algorithm and partial rollback algorithm for Internet agents publication-title: Electron Commun Jpn – year: 2011 – volume: 25 start-page: 153 issue: 3 year: 1987 end-page: 158 article-title: On distributed snapshots publication-title: Inf Process Lett – year: 1986 – year: 1984 – volume: SE‐13 start-page: 23 issue: 1 year: 1987 end-page: 31 article-title: Checkpointing and rollback‐recovery for distributed systems publication-title: IEEE Trans Softw Eng – year: 2001 – year: 2006 – year: 1997 – volume: 6 start-page: 165 year: 1995 end-page: 169 article-title: Necessary and sufficient conditions for consistent global snapshots publication-title: IEEE Trans Parallel Distrib Syst – volume: 3 start-page: 63 issue: 1 year: 1985 end-page: 75 article-title: Distributed snapshots: determining global states of distributed systems publication-title: ACM Trans Comput Syst – volume: 21 start-page: 620 issue: 5 year: 2010 end-page: 630 article-title: Efficient algorithms for global snapshots in large distributed systems publication-title: IEEE Trans Parallel Distrib Syst – volume: E97‐D start-page: 65 issue: 1 year: 2014 end-page: 76 article-title: A concurrent partial snapshot algorithm for large‐scale and dynamic distributed systems publication-title: IEICE Trans Inf Syst – volume: 34 start-page: 375 issue: 3 year: 2002 end-page: 408 article-title: A survey of rollback‐recovery protocols in message‐passing systems publication-title: ACM Comput Surv – year: 2018 – year: 1994 – volume: 21 start-page: 1281 issue: 9 year: 2010 end-page: 1289 article-title: Fast and message‐efficient global snapshot algorithms for large‐scale distributed systems publication-title: IEEE Trans Parallel Distrib Syst – volume: SE‐8 start-page: 198 issue: 3 year: 1982 end-page: 202 article-title: Global states of a distributed system publication-title: IEEE Trans Softw Eng – year: 1998 – volume: 10 start-page: 865 issue: 9 year: 1999 end-page: 877 article-title: Communication‐induced determination of consistent snapshots publication-title: IEEE Trans Parallel Distrib Syst – ident: e_1_2_9_9_1 doi: 10.1145/568522.568525 – ident: e_1_2_9_16_1 doi: 10.1109/TPDS.2009.108 – ident: e_1_2_9_10_1 doi: 10.1002/ecjc.20208 – ident: e_1_2_9_13_1 doi: 10.1016/0020-0190(87)90125-6 – volume-title: GNU Parallel 2018 year: 2018 ident: e_1_2_9_22_1 – ident: e_1_2_9_6_1 – ident: e_1_2_9_4_1 doi: 10.1109/71.342127 – ident: e_1_2_9_8_1 – ident: e_1_2_9_20_1 – ident: e_1_2_9_5_1 doi: 10.1109/TSE.1982.235418 – ident: e_1_2_9_7_1 – ident: e_1_2_9_15_1 doi: 10.1145/1183401.1183439 – ident: e_1_2_9_14_1 doi: 10.1109/TPDS.2010.24 – ident: e_1_2_9_18_1 – ident: e_1_2_9_17_1 doi: 10.1109/71.798312 – ident: e_1_2_9_19_1 – ident: e_1_2_9_11_1 doi: 10.1007/978-3-642-24550-3_39 – ident: e_1_2_9_12_1 doi: 10.1145/214451.214456 – ident: e_1_2_9_2_1 doi: 10.1109/CANDARW.2018.00060 – ident: e_1_2_9_3_1 doi: 10.1109/TSE.1987.232562 – ident: e_1_2_9_21_1 doi: 10.1587/transinf.E97.D.65
SSID	ssj0011031
Score	2.3271155
Snippet	Summary A distributed system consisting of a huge number of computational entities is prone to faults because faults in a few nodes cause the entire system to... A distributed system consisting of a huge number of computational entities is prone to faults because faults in a few nodes cause the entire system to fail....
SourceID	proquest crossref wiley
SourceType	Aggregation Database Enrichment Source Index Database Publisher
SubjectTerms	Algorithms checkpoint‐rollback Computer networks Configurations Coordination distributed algorithm Fault tolerance Nodes Recovery snapshot Systems analysis
Title	A cooperative partial snapshot algorithm for checkpoint‐rollback recovery of large‐scale and dynamic distributed systems and experimental evaluations
URI	https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.5647 https://www.proquest.com/docview/2531420225
Volume	33
WOSCitedRecordID	wos000653494600014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1532-0634 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011031 issn: 1532-0626 databaseCode: DRFUL dateStart: 20010101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB509eDFt7i-iCB6qnazTdscRV08iIioeCtpHrq4tmVbBW_-BK_-PX-Jkz52FRQETz0k04bMTPI1nX4fwA7jIRdBqVIXKsejyjicSuEoTpUnqSu8kkzn5iw4Pw9vb_lFXVVp_4Wp-CFGB242M8r12ia4iPODMWmozPQ-871gEqYoPoy1YOr4snd9NvqGYAUMKrZUiiOhfkM969KDxvb7ZjRGmF9xarnR9Ob-M8R5mK3hJTms4mEBJnSyCHONdAOpM3kJ3g-JTNNMV7zfJLMBhHZ5IrL8Pi2IGNylw35x_0gQ1BJ0rHzI0n5SfLy-DTFyYiEfiH2XxkR4IakhA1tQjo05ulwTkSiiKql7oiwzrxXV0opUtNF52f5VWoCMOcfzZbjunVwdnTq1SoMjESoEjs8xDIRkQdeXkgmrIqpiJhk3CAeUkUoJz5g4joVmrKu5LzRXTAeeEtpzY9NdgVaSJnoViFYqlKEr3NAgsDCMS8ttE8Y87HTwNp027DXuimRNYW6VNAZRRb5MI5zxyM54G7ZHPbOKtuOHPhuNx6M6cfOI4prkUQQ2rA27pW9_tY-OLk7sde2vHddhhtqKGNd3KNuAVjF80pswLZ-Lfj7cqsP3E_qh-90
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LTtwwFL2iUAk2hRYQA7Q1EmpXgYzHTmJ1hSgjENMRqqBiFzl-wIghiSZppe74BLb8Xr-k13nMgEQlpK6ysB1ZvufaJ7ZzDsAuF5GQYeVSF2mPUW09QZX0tKCaKepLVonp_BiEw2F0eSnO5uBL-y9MrQ8x3XBzmVHN1y7B3Yb0_kw1VOVmjwcsfAULDFGE8F74-r1_MZgeIjgHg1oulWJXaNBqz_p0v237dDWaUczHRLVaafrL_9XHFXjTEExyUCPiLcyZ9B0st-YNpMnlVXg4ICrLclMrf5PcQQjbFanMi-usJHJ8lU1G5fUtQVpLMLTqJs9Gafnn7n6C2EmkuiHuaxpT4TfJLBm7K-VYWGDQDZGpJro2uyfaafM6Wy2jSS0cXVTlj80FyEx1vFiDi_7R-eGx1_g0eArJQugFAoEgFQ97gVJcOh9RnXDFhUVCoK3SWjJrkySRhvOeEYE0QnMTMi0N8xPbW4f5NEvNBhCjdaQiX_qRRWphuVBO3SZKRNTt4mu6HfjcxitWjYi589IYx7X8Mo1xxGM34h3YmdbMa-GOZ-pstyGPm9QtYoqzEqNIbXgHPlXB_Wf7-PDsyD03X1rxIywen38bxIOT4ekWLFF3P8YPPMq3Yb6c_DTv4bX6VY6KyYcGy38B8U__zQ
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpZ3PT9swFMefWEFoF9hg08pgeBJip0Dq2kksTgiohlZV1QSIW-T42aOiJFETJu22P2HX_Xv8Jdj50TJpk5B2ysF2FOW9Z3-TOJ8vwB4XkZBh5VIXoccoGk9QJT0UFJmivmQVTOdqGI5G0fW1GC_BUfsvTM2HmL9wc5VRzdeuwHWO5nBBDVW5PuABC1_AMnMeMh1YPv06uBzOPyI4B4Mal0rtpdCgZc_69LAd--dqtJCYT4VqtdIM1v_rGl_BWiMwyXGdEa9hSacbsN6aN5Cmljfh9zFRWZbrmvxNcpdCdlyRyry4yUoip9-y2aS8uSNW1hIbWnWbZ5O0fPj5a2ZzJ5HqlrinaVsKP0hmyNRtKbeNhQ26JjJFgrXZPUHH5nW2WhpJDY4uqvan5gJkQR0v3sDl4Ozi5LPX-DR4yoqF0AuETQSpeNgPlOLS-YhiwhUXxgoCNApRMmOSJJGa874WgdQCuQ4ZSs38xPTfQifNUv0OiEaMVORLPzJWWhgulKPbRImIej17ml4XPrXxilUDMXdeGtO4xi_T2N7x2N3xLnyc98xrcMdf-my3IY-b0i1iamclRq204V3Yr4L7z_HxyfjMHbee23EXVseng3h4PvryHl5Stz3GDzzKt6FTzu71Dqyo7-WkmH1oUvkRgKX_SA
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+cooperative+partial+snapshot+algorithm+for+checkpoint%E2%80%90rollback+recovery+of+large%E2%80%90scale+and+dynamic+distributed+systems+and+experimental+evaluations&rft.jtitle=Concurrency+and+computation&rft.au=Nakamura%2C+Junya&rft.au=Kim%2C+Yonghwan&rft.au=Katayama%2C+Yoshiaki&rft.au=Masuzawa%2C+Toshimitsu&rft.date=2021-06-25&rft.issn=1532-0626&rft.eissn=1532-0634&rft.volume=33&rft.issue=12&rft.epage=n%2Fa&rft_id=info:doi/10.1002%2Fcpe.5647&rft.externalDBID=10.1002%252Fcpe.5647&rft.externalDocID=CPE5647
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon