Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
We consider the problem of distributed scheduling in wireless networks subject to simple collision constraints. We define the efficiency of a distributed scheduling algorithm to be the largest number (fraction) such that the throughput under the distributed scheduling policy is at least equal to the...
Uloženo v:
| Vydáno v: | IEEE transactions on mobile computing Ročník 6; číslo 6; s. 595 - 605 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Magazine Article Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
New York, NY
IEEE
01.06.2007
IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1536-1233, 1558-0660 |
| 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 | We consider the problem of distributed scheduling in wireless networks subject to simple collision constraints. We define the efficiency of a distributed scheduling algorithm to be the largest number (fraction) such that the throughput under the distributed scheduling policy is at least equal to the efficiency multiplied by the maximum throughput achievable under a centralized policy. For a general interference model, we prove a lower bound on the efficiency of a distributed scheduling algorithm by first assuming that all of the traffic only uses one hop of the network. We also prove that the lower bound is tight in the sense that, for any fraction larger than the lower bound, we can find a topology and an arrival rate vector within the fraction of the capacity region such that the network is unstable under a greedy scheduling policy. We then extend our results to a more general multihop traffic scenario and show that similar scheduling efficiency results can be established by introducing prioritization or regulators to the basic greedy scheduling algorithm |
|---|---|
| AbstractList | We consider the problem of distributed scheduling in wireless networks subject to simple collision constraints. We define the efficiency of a distributed scheduling algorithm to be the largest number (fraction) such that the throughput under the distributed scheduling policy is at least equal to the efficiency multiplied by the maximum throughput achievable under a centralized policy. For a general interference model, we prove a lower bound on the efficiency of a distributed scheduling algorithm by first assuming that all of the traffic only uses one hop of the network. We also prove that the lower bound is tight in the sense that, for any fraction larger than the lower bound, we can find a topology and an arrival rate vector within the fraction of the capacity region such that the network is unstable under a greedy scheduling policy. We then extend our results to a more general multihop traffic scenario and show that similar scheduling efficiency results can be established by introducing prioritization or regulators to the basic greedy scheduling algorithm We consider the problem of distributed scheduling in wireless networks subject to simple collision constraints. We define the efficiency of a distributed scheduling algorithm to be the largest number (fraction) such that the throughput [abstract truncated by publisher]. For a general interference model, we prove a lower bound on the efficiency of a distributed scheduling algorithm by first assuming that all of the traffic only uses one hop of the network. |
| Author | Srikant, R. Perkins, J.R. Xinzhou Wu |
| Author_xml | – sequence: 1 surname: Xinzhou Wu fullname: Xinzhou Wu organization: QUALCOMM Flarion Technol., Bedminster, NJ – sequence: 2 givenname: R. surname: Srikant fullname: Srikant, R. – sequence: 3 givenname: J.R. surname: Perkins fullname: Perkins, J.R. |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18732432$$DView record in Pascal Francis |
| BookMark | eNqF0stPFTEUBvCJwURAl67cTEx8bObSM30vyRXQBGUh6rJpO2egOHcK7UzM_e_pzSXEkACrdvE7X_r49qqdMY5YVW-BLACIPjj_vly0hMgFEAEvql3gXDVECLKz2VPRQEvpq2ov5ytCQGktd6vfP_0ldvMQxov6qO-DDzj6dR37-kvIUwpunrCrTxJit67_s4fDRUxhulzlOoz1n5BwwJzrHzj9i-lvfl297O2Q8c3dul_9Oj46X35tTs9Ovi0PTxvPWDs1noLkFlshHRLuqLLOqx60Z9o5RMc4dr224AA9EVIR2XHogCjpmXc90P3q0zb3OsWbGfNkViF7HAY7Ypyz0YQKRlpJnpVKaSplOUmRH5-UlDHOtRAFfn4SlrtR3pYP4IW-f0Cv4pzG8jRGiRJHBbCCPtwhm70d-mRHH7K5TmFl09qAkrRltC2Obp1PMeeEvfFhslOI45RsGAwQs-mDKX0wmz6YTR_KVPNg6j74Ef9u6wMi3lsGAjRQegvfGsAw |
| CODEN | ITMCCJ |
| CitedBy_id | crossref_primary_10_1109_TIT_2011_2133130 crossref_primary_10_1109_TNET_2012_2205017 crossref_primary_10_1109_TVT_2012_2227069 crossref_primary_10_1016_j_automatica_2019_108759 crossref_primary_10_1109_TIT_2023_3324180 crossref_primary_10_1109_TWC_2009_080155 crossref_primary_10_1145_2522968_2522982 crossref_primary_10_1109_TVT_2011_2176520 crossref_primary_10_1109_TNET_2017_2706366 crossref_primary_10_1016_j_adhoc_2011_03_013 crossref_primary_10_1016_j_comnet_2011_03_021 crossref_primary_10_1109_TNET_2014_2365440 crossref_primary_10_1016_j_comcom_2012_11_001 crossref_primary_10_1109_TAC_2009_2026943 crossref_primary_10_1002_ett_4419 crossref_primary_10_1109_TNET_2014_2303093 crossref_primary_10_1016_j_comnet_2020_107380 crossref_primary_10_1109_TWC_2014_022714_130351 crossref_primary_10_1109_TWC_2010_01_090638 crossref_primary_10_1145_1870085_1870090 crossref_primary_10_1155_2019_6171625 crossref_primary_10_1109_TNET_2012_2230404 crossref_primary_10_1109_TPDS_2013_202 crossref_primary_10_4304_jnw_6_6_850_857 crossref_primary_10_1007_s11276_020_02502_0 crossref_primary_10_1109_TPDS_2014_2315202 crossref_primary_10_1109_TNET_2012_2227790 crossref_primary_10_1109_TNET_2014_2324976 crossref_primary_10_1109_TNET_2022_3179451 crossref_primary_10_3390_e25081197 crossref_primary_10_1364_OE_558603 crossref_primary_10_1109_TNET_2011_2157356 crossref_primary_10_1016_j_peva_2010_08_001 crossref_primary_10_1109_TNET_2011_2177101 crossref_primary_10_1109_TWC_2010_080903 crossref_primary_10_1109_TVT_2014_2303089 crossref_primary_10_1109_TCNS_2017_2673539 crossref_primary_10_1109_TAC_2009_2031719 crossref_primary_10_1109_TPDS_2011_201 crossref_primary_10_1109_JSAC_2013_130318 crossref_primary_10_1016_j_comnet_2017_04_011 crossref_primary_10_1109_TII_2018_2852491 crossref_primary_10_3390_s18124205 crossref_primary_10_1016_j_jnca_2011_07_014 crossref_primary_10_1109_LCOMM_2013_052013_130405 crossref_primary_10_1007_s11276_018_1800_6 crossref_primary_10_1145_1870085_1870089 crossref_primary_10_1186_s13638_015_0289_2 crossref_primary_10_1287_moor_2013_0588 crossref_primary_10_3390_e24091246 crossref_primary_10_1109_TNET_2013_2273100 crossref_primary_10_1109_TVT_2012_2204411 crossref_primary_10_1109_TWC_2017_2764081 crossref_primary_10_1109_JIOT_2024_3523024 crossref_primary_10_1109_TMC_2011_99 crossref_primary_10_1109_TMC_2017_2777828 crossref_primary_10_1109_TWC_2011_083111_110194 crossref_primary_10_1016_j_adhoc_2022_102908 crossref_primary_10_1109_TMC_2025_3546276 crossref_primary_10_1109_TWC_2012_083112_112147 crossref_primary_10_1007_s11276_009_0208_8 crossref_primary_10_1109_TNET_2009_2021609 crossref_primary_10_1109_TNET_2014_2338277 crossref_primary_10_1016_j_comcom_2018_07_029 crossref_primary_10_1109_TNET_2019_2891018 crossref_primary_10_1007_s11276_012_0462_z crossref_primary_10_1109_TVT_2015_2474695 crossref_primary_10_1109_MWC_2012_6189415 crossref_primary_10_1109_TMC_2012_26 crossref_primary_10_1109_TNET_2008_2008232 crossref_primary_10_1109_JIOT_2021_3068182 crossref_primary_10_1109_TNET_2009_2032419 crossref_primary_10_1109_ACCESS_2022_3144072 |
| Cites_doi | 10.1109/CDC.2005.1583011 10.1109/9.341782 10.1109/18.21215 10.1109/WIOPT.2006.1666477 10.1109/INFCOM.2004.1354675 10.1109/INFCOM.2000.832229 10.1109/18.825799 10.1057/palgrave.jors.2600523 10.1109/90.879352 10.1109/9.106156 10.1109/9.273366 10.1109/INFOCOM.2006.176 10.1007/978-0-8176-8216-3 10.1109/90.811451 10.1109/90.650141 10.1109/9.182479 10.1109/CDC.2003.1272623 10.1109/9.50339 |
| ContentType | Magazine Article Conference Proceeding |
| Copyright | 2007 INIST-CNRS Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007 |
| Copyright_xml | – notice: 2007 INIST-CNRS – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TMC.2007.1061 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications 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 ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database Technology Research Database Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1558-0660 |
| EndPage | 605 |
| ExternalDocumentID | 2335999051 18732432 10_1109_TMC_2007_1061 4161913 |
| Genre | orig-research |
| GroupedDBID | -~X .DC 0R~ 1OL 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IEDLZ IFIPE IPLJI JAVBF LAI M43 O9- OCL P2P PQQKQ RIA RIE RNI RNS RZB AAYXX CITATION AAYOK IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c442t-c3175ae267be05b38abc8f19c49bbeeb45edf9a1b1ec067807d51d1087c4cbf13 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 106 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000245757500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1536-1233 |
| IngestDate | Sun Nov 09 11:50:34 EST 2025 Sun Nov 09 11:37:29 EST 2025 Sun Sep 28 07:34:26 EDT 2025 Thu Oct 02 03:11:52 EDT 2025 Sun Nov 30 05:28:38 EST 2025 Wed Apr 02 07:18:55 EDT 2025 Sat Nov 29 08:12:12 EST 2025 Tue Nov 18 22:11:19 EST 2025 Wed Aug 27 02:52:46 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Performance evaluation Lower bound Packet switching greedy algorithms Multihop wireless networks Wireless telecommunication Resource allocation Information rate Teletraffic Scheduling Information transmission Multihop network Queueing system Traffic management Distributed algorithm Greedy algorithm Traffic control Resource management |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c442t-c3175ae267be05b38abc8f19c49bbeeb45edf9a1b1ec067807d51d1087c4cbf13 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 864553614 |
| PQPubID | 23500 |
| PageCount | 11 |
| ParticipantIDs | proquest_miscellaneous_903640270 proquest_journals_864553614 crossref_citationtrail_10_1109_TMC_2007_1061 proquest_miscellaneous_34455966 ieee_primary_4161913 pascalfrancis_primary_18732432 proquest_miscellaneous_889377267 proquest_miscellaneous_1753520665 crossref_primary_10_1109_TMC_2007_1061 |
| PublicationCentury | 2000 |
| PublicationDate | 2007-06-01 |
| PublicationDateYYYYMMDD | 2007-06-01 |
| PublicationDate_xml | – month: 06 year: 2007 text: 2007-06-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: Los Alamitos |
| PublicationTitle | IEEE transactions on mobile computing |
| PublicationTitleAbbrev | TMC |
| PublicationYear | 2007 |
| Publisher | IEEE IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: IEEE Computer Society – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref14 ref11 ref10 Chaporkar (ref4) ref17 Rybko (ref16); 28 ref18 Miller (ref15) 2000 Wu (ref24) ref26 ref25 ref20 Asmussen (ref1) 2003 ref22 ref21 Chaporkar (ref3) ref8 ref7 ref9 ref6 ref5 Srikant (ref19) 2004 Wu (ref23) Bui (ref2) Lin (ref12) |
| References_xml | – ident: ref22 doi: 10.1109/CDC.2005.1583011 – ident: ref10 doi: 10.1109/9.341782 – volume-title: Proc. INFOCOM ident: ref12 article-title: The Impact of Imperfect Scheduling on Cross-Layer Control in Multihop Wireless Networks – ident: ref7 doi: 10.1109/18.21215 – ident: ref18 doi: 10.1109/WIOPT.2006.1666477 – ident: ref25 doi: 10.1109/INFCOM.2004.1354675 – ident: ref5 doi: 10.1109/INFCOM.2000.832229 – ident: ref6 doi: 10.1109/18.825799 – ident: ref9 doi: 10.1057/palgrave.jors.2600523 – volume-title: Bluetooth Revealed: The Insider’s Guide to an Open Specification for Global Wireless Communication year: 2000 ident: ref15 – ident: ref26 doi: 10.1109/90.879352 – ident: ref13 doi: 10.1109/9.106156 – ident: ref8 doi: 10.1109/9.273366 – volume-title: Proc. INFOCOM ident: ref23 article-title: Scheduling Efficiency of Greedy Distributed Algorithms in Wireless Networks doi: 10.1109/INFOCOM.2006.176 – volume-title: Proc. 43rd Ann. Allerton Conf. Comm., Control, and Computing ident: ref3 article-title: Throughput Guarantees in Maximal Scheduling in Allerton Networks – volume-title: The Mathematics of Internet Congestion Control year: 2004 ident: ref19 doi: 10.1007/978-0-8176-8216-3 – ident: ref14 doi: 10.1109/90.811451 – ident: ref21 doi: 10.1109/90.650141 – ident: ref20 doi: 10.1109/9.182479 – volume-title: Proc. Information Theory and Applications Inaugural Workshop ident: ref24 article-title: Queue-Length Stability of Maximal Greedy Schedules in Wireless Networks – ident: ref17 doi: 10.1109/CDC.2003.1272623 – volume-title: Proc. INFOCOM ident: ref2 article-title: Joint Congestion Control and Distributed Scheduling in Multihop Wireless Networks with a Node-Exclusive Interference Model – volume-title: Proc. Information Theory and Applications Inaugural Workshop ident: ref4 article-title: Achieving Queue Length Stability through Maximal Scheduling in Wireless Networks – volume-title: Applied Probability and Queues year: 2003 ident: ref1 – ident: ref11 doi: 10.1109/9.50339 – volume: 28 volume-title: Problems of Information Transmission ident: ref16 article-title: Ergodicity of Stochastic Processes Describing the Operation of Open Queueing Networks |
| SSID | ssj0018997 |
| Score | 1.2832687 |
| Snippet | We consider the problem of distributed scheduling in wireless networks subject to simple collision constraints. We define the efficiency of a distributed... For a general interference model, we prove a lower bound on the efficiency of a distributed scheduling algorithm by first assuming that all of the traffic only... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 595 |
| SubjectTerms | Algorithms Applied sciences Efficiency Exact sciences and technology Greedy algorithms Interference constraints Lower bounds Multihop wireless networks Networks Policies Regulators resource allocation Resource management Scheduling Scheduling algorithm Spread spectrum communication Stability Studies Switches Switching and signalling Systems, networks and services of telecommunications Telecommunication traffic Telecommunications Telecommunications and information theory Teletraffic Throughput Traffic control Traffic engineering Traffic flow Transmission and modulation (techniques and equipments) Wireless networks |
| Title | Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks |
| URI | https://ieeexplore.ieee.org/document/4161913 https://www.proquest.com/docview/864553614 https://www.proquest.com/docview/1753520665 https://www.proquest.com/docview/34455966 https://www.proquest.com/docview/889377267 https://www.proquest.com/docview/903640270 |
| Volume | 6 |
| WOSCitedRecordID | wos000245757500003&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB6VigOnLRREKBQjIU4NjWMndo5VadVDWSFRqt4iPyZlpSWpNrtI_Hs8eZUK9sDNUkZWMuOxx5mZ7wN4j0Ykzps0zlGJmNDvYu1SHZvCZc44kbuufez6Us3n-uam-LIDR1MvDCJ2xWf4kYZdLt83bkO_yo4pGC-IovaRUnnfqzVlDMK9QfXYqMQrI8Q9nubx1efTHquQrj8Pzp-OUIXKIU0bNFL1VBZ_7crdUXM--7-X3IPZCBHNTvpF8BR2sH4Gs5GvgQ3uuw_XX4OFPJWe37KzDjqC-i5ZU7FPBJ9LzFfoGVXi-F_sD9mT5W2zWqy__2jZomZUL7sM-yOb9xXk7XP4dn52dXoRD7wKsZMyXceOYgaDaa4sJpkV2linK144WViLaGWGvioMtxwdHWaJ8hn3PNHKSWcrLl7Abt3U-BJYor1VVuRKmkpa4bTFlIdBhdxlXlcRHI3aLt0AOk7cF8uyu3wkRRmMQ1SYqiTjRPBhEr_r0Ta2Ce6T5iehQekRHD4w5f0kWoXIUaQRHIy2LQdnbUudyywsGy4jeDc9DV5GqRNTY7NpS8IzzQj5Povg7RYZIcM04fYYAdsioSk4VEHv20UKygsnqUpe_fsLD-DJWLGY8Newu15t8A08dj_Xi3Z12LnEb1NKDHE |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB5VBQlOCxREKLRGQpwaasdO7Byr0qqI7QqJpeot8ivtSkuCNrtI_Hs8eZUK9sDNUkZWMuOxx5mZ7wN45zWn1ukkzrzkMaLfxcomKta5Ta22PLNt-9jVVM5m6vo6_7IDR2MvjPe-LT7zH3DY5vJdbTf4q-wYg_EcKWofIHNW36015gzCzUF26KjILMP5HaLm8fzytEMrxAvQvROopVTBgkjdBJ2UHZnFX_tye9icT_7vNZ_AZACJJifdMngKO756BpOBsYH0DrwHV1-DjRwWn9-QsxY8AjsvSV2Sjwigi9xX3hGsxXG_yB-yJ8uberVY335vyKIiWDG7DDskmXU15M1z-HZ-Nj-9iHtmhdgKkaxji1GD9kkmjaep4Uobq0qWW5Eb470RqXdlrplh3uJxRqVLmWNUSSusKRl_AbtVXfmXQKhyRhqeSaFLYbhVxicsDErPbOpUGcHRoO3C9rDjyH6xLNrrB82LYBwkw5QFGieC96P4jw5vY5vgHmp-FOqVHsHBPVPeTaJkiB15EsH-YNuid9emUJlIw7JhIoK349PgZ5g80ZWvN02BiKYpYt-nERxukeEiTBPujxGQLRIKw0MZ9L5dJMfMME0kffXvLzyERxfzy2kx_TT7vA-Ph_pFyl7D7nq18W_gof25XjSrg9Y9fgNnTA-6 |
| 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=proceeding&rft.title=IEEE+transactions+on+mobile+computing&rft.atitle=Scheduling+efficiency+of+distributed+greedy+scheduling+algorithms+in+wireless+networks&rft.au=XINZHOU+WU&rft.au=SRIKANT%2C+R&rft.au=PERKINS%2C+James+R&rft.date=2007-06-01&rft.pub=IEEE+Computer+Society&rft.issn=1536-1233&rft.volume=6&rft.issue=6&rft.spage=595&rft.epage=605&rft_id=info:doi/10.1109%2FTMC.2007.1061&rft.externalDBID=n%2Fa&rft.externalDocID=18732432 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1536-1233&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1536-1233&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1536-1233&client=summon |