Show simple item record

dc.contributor.authorKarimi, Pantea
dc.contributor.authorPirelli, Solal
dc.contributor.authorKakarla, Siva Kesava Reddy
dc.contributor.authorBeckett, Ryan
dc.contributor.authorSegarra, Santiago
dc.contributor.authorLi, Beibin
dc.contributor.authorNamyar, Pooria
dc.contributor.authorArzani, Behnaz
dc.date.accessioned2024-12-19T17:02:40Z
dc.date.available2024-12-19T17:02:40Z
dc.date.issued2024-11-18
dc.identifier.isbn979-8-4007-1272-2
dc.identifier.urihttps://hdl.handle.net/1721.1/157896
dc.descriptionHOTNETS ’24, November 18–19, 2024, Irvine, CA, USAen_US
dc.description.abstractMany problems that cloud operators solve are computationally expensive, and operators often use heuristic algorithms (that are faster and scale better than optimal) to solve them more efficiently. Heuristic analyzers enable operators to find when and by how much their heuristics underperform. However, these tools do not provide enough detail for operators to mitigate the heuristic's impact in practice: they only discover a single input instance that causes the heuristic to underperform (and not the full set) and they do not explain why. We propose XPlain, a tool that extends these analyzers and helps operators understand when and why their heuristics underperform. We present promising initial results that show such an extension is viable.en_US
dc.publisherACM|The 23rd ACM Workshop on Hot Topics in Networksen_US
dc.relation.isversionofhttps://doi.org/10.1145/3696348.3696884en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceAssociation for Computing Machineryen_US
dc.titleTowards Safer Heuristics With Xplainen_US
dc.typeArticleen_US
dc.identifier.citationKarimi, Pantea, Pirelli, Solal, Kakarla, Siva Kesava Reddy, Beckett, Ryan, Segarra, Santiago et al. 2024. "Towards Safer Heuristics With Xplain."
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.identifier.mitlicensePUBLISHER_POLICY
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2024-12-01T08:54:07Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2024-12-01T08:54:07Z
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record