BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150116Z
LOCATION:C140/142
DTSTART;TZID=America/Chicago:20181113T110000
DTEND;TZID=America/Chicago:20181113T113000
UID:submissions.supercomputing.org_SC18_sess194_pap163@linklings.com
SUMMARY:Fine-Grained, Multi-Domain Network Resource Abstraction as a Funda
 mental Primitive to Enable High-Performance, Collaborative Data Sciences
DESCRIPTION:Qiao Xiang (Yale University); J. Jensen Zhang, X. Tony Wang, a
 nd Y. Jace Liu (Tongji University); Chin Guok (Lawrence Berkeley National 
 Laboratory); Franck Le (IBM); John MacAuley (Lawrence Berkeley National La
 boratory); Harvey Newman (California Institute of Technology); and Y. Rich
 ard Yang (Yale University)\n\nMulti-domain network resource reservation sy
 stems are being deployed, driven by the demand and substantial benefits of
  providing predictable network resources. However, a major lack of existin
 g systems is their coarse granularity, due to the participating networks’ 
 concern of revealing sensitive information, which can result in substantia
 l inefficiencies. This paper presents Mercator, a novel multi-domain netwo
 rk resource discovery system to provide fine-grained, global network resou
 rce information, for collaborative sciences. The foundation of Mercator is
  a resource abstraction through algebraic-expression enumeration (i.e., li
 near inequalities/equations), as a compact representation of the available
  bandwidth in multi-domain networks. In addition, we develop an obfuscatin
 g protocol, to address the privacy concerns by ensuring that no participan
 t can associate the algebraic expressions with the corresponding member ne
 tworks. We also introduce a superset projection technique to increase Merc
 ator’s scalability. Finally, we implement Mercator and demonstrate both it
 s efficiency and efficacy through extensive experiments using real topolog
 ies and traces.\n\nTag: Architectures, Data Analytics, Networks\n\nRegistr
 ation Category: Tech Program Reg Pass\n\nFinalist: BP Finalist\n\nSession 
 Chair: Madeleine Glick (Columbia University)\n\n
END:VEVENT
END:VCALENDAR
