Low-stretch greedy embedding heuristics

Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings also yield low hop stretch of the greedy over the shortest paths. In this paper we study how topological and geometric prope...

Full description

Saved in:
Bibliographic Details
Published in2012 Proceedings IEEE INFOCOM Workshops pp. 232 - 237
Main Authors Cvetkovski, A., Crovella, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2012
Subjects
Communication networks
Computer science
Correlation
Extraterrestrial measurements
Routing
Topology
Wireless communication
Online AccessGet full text

Cover

Abstract Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings also yield low hop stretch of the greedy over the shortest paths. In this paper we study how topological and geometric properties of embedded graphs influence the hop stretch. Based on the obtained insights, we construct embedding heuristics that yield minimal hop stretch greedy embeddings.
AbstractList Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings also yield low hop stretch of the greedy over the shortest paths. In this paper we study how topological and geometric properties of embedded graphs influence the hop stretch. Based on the obtained insights, we construct embedding heuristics that yield minimal hop stretch greedy embeddings.
Author Crovella, M.
Cvetkovski, A.
Author_xml – sequence: 1
  givenname: A.
  surname: Cvetkovski
  fullname: Cvetkovski, A.
  email: andrej@cs.bu.edu
  organization: Dept. of Comput. Sci., Boston Univ., Boston, MA, USA
– sequence: 2
  givenname: M.
  surname: Crovella
  fullname: Crovella, M.
  email: crovella@cs.bu.edu
  organization: Dept. of Comput. Sci., Boston Univ., Boston, MA, USA
BookMark eNpFj8FOwzAQRI0ACVr6BXDIjVNSr71Zx0cUUagU2guIY-Xam9aIpigOQv17KlGJuYzeZZ5mJC66fcdC3IEsAKSdzhezevnyXigJqiCwGq05EyNAMhokGDz_B6IrMUnpQx5jpKq0vhb3zf4nT0PPg99mm545HDLerTmE2G2yLX_3MQ3Rpxtx2brPxJNTj8Xb7PG1fs6b5dO8fmjyqBQMeQilDRYMGaSjlVpntcbKogns0OsSlQmew9pb9qZyJBVhC1hKJHKAeixu_3YjM6---rhz_WF1OqZ_AYy1QqQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/INFCOMW.2012.6193497
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEL
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 1467310174
9781467310154
1467310158
9781467310178
EndPage 237
ExternalDocumentID 6193497
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i221t-dd59d91767464676fa93348947dea4c35427dcedbc9ec78a60264f1450466a143
IEDL.DBID RIE
ISBN 1467310166
9781467310161
IngestDate Wed Jun 26 19:23:56 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i221t-dd59d91767464676fa93348947dea4c35427dcedbc9ec78a60264f1450466a143
OpenAccessLink http://www.cs.bu.edu/faculty/crovella/paper-archive/netsc12-greedy.pdf
PageCount 6
ParticipantIDs ieee_primary_6193497
PublicationCentury 2000
PublicationDate 2012-March
PublicationDateYYYYMMDD 2012-03-01
PublicationDate_xml – month: 03
  year: 2012
  text: 2012-March
PublicationDecade 2010
PublicationTitle 2012 Proceedings IEEE INFOCOM Workshops
PublicationTitleAbbrev INFCOMW
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000702833
Score 1.8794314
Snippet Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that...
SourceID ieee
SourceType Publisher
StartPage 232
SubjectTerms Communication networks
Computer science
Correlation
Extraterrestrial measurements
Routing
Topology
Wireless communication
Title Low-stretch greedy embedding heuristics
URI https://ieeexplore.ieee.org/document/6193497
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NS8NAEB1qT56qtuI3OQheTNpkN7vZc7FUsdWDxd7KZmcXRWxFEgR_vbNJWlE8eAlJIGE_ksx7m3lvAM45ZjwzhNw0ca-Qc6fDnAmkjUoco3itK7umyVSMZ_xmns5bcLnRwlhrq-QzG_nd6l8-rkzpl8r6BPYZV3ILtrJBUmu1Nusp9OhSpGSVdktI5kmpWFs6NcdxI52LB6p_PR0N7yaPPrcriZr7_iiwUsWXUQcm65bVaSUvUVnkkfn8Zdr436bvQO9byRfcb2LULrTscg8661IOQfNmd-HidvURet0ITWJAFJy-vYF9zS36y4InWzaGzj2Yja4ehuOwqaEQPidJXISIqUKiZEJyQeMgnFZee6u4RKu5YSlPJBqLuVHWyEz7ilTcxTwl3iw0gal9aC9XS3sAAeLAKmIYyIzjhLtyZ3gqUTIj0BEyPISu7_firbbJWDRdPvr79DFs-7Gv07lOoF28l_aU4nuRn1UT-wUqTZ8s
link.rule.ids 310,311,786,790,795,796,802,27956,55107
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT4MwFH6Z86CnqZvxtxxMvAgbtLTreXHZdEwPW9xtgb4SF-NmDMTEv95XYDMaD14INIG0fcD3vvZ97wFccezyribPLSbu5XKexm7CBNJBBSkjvI6LdE3RWAym_G4Wzmpws9HCGGOK4DPj2dNiLx9XOrdLZW1y9hlXcgu2Cec7slRrbVZU6OUlrGSFektIZmmpWCd1qq79Sjznd1R7OO73HqInG90VeNWTf5RYKRCm34Bo3bcysOTFy7PE05-_0jb-t_N70PrW8jmPG5Tah5pZHkBjXczBqb7tJlyPVh-uVY6QGR0i4fT3dcxrYtDe5jybvErp3IJp_3bSG7hVFQV3EQR-5iKGComUCckFzYNIY2XVt4pLNDHXLOSBRG0w0cpo2Y1tTSqe-jwk5ixicqcOob5cLc0ROIgdo4hjINMpJ88rSTUPJUqmBabkGx5D0457_lYmyphXQz75u_kSdgaTaDQfDcf3p7Br7VAGd51BPXvPzTmhfZZcFEb-AsZcooA
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%3Abook&rft.genre=proceeding&rft.title=2012+Proceedings+IEEE+INFOCOM+Workshops&rft.atitle=Low-stretch+greedy+embedding+heuristics&rft.au=Cvetkovski%2C+A.&rft.au=Crovella%2C+M.&rft.date=2012-03-01&rft.pub=IEEE&rft.isbn=9781467310161&rft.spage=232&rft.epage=237&rft_id=info:doi/10.1109%2FINFCOMW.2012.6193497&rft.externalDocID=6193497
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467310161/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467310161/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781467310161/sc.gif&client=summon&freeimage=true