BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Information Systems Group
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221104T123000
DTEND;TZID=America/Los_Angeles:20221104T140000
DTSTAMP:20260419T123151
CREATED:20220926T231639Z
LAST-MODIFIED:20221028T174302Z
UID:1476-1667565000-1667570400@isg.ics.uci.edu
SUMMARY:Juncheng Fang: PeloPartition- Improving Blockchain Resilience to Partitioning by Sharding
DESCRIPTION:Abstract:\nBlockchain has gained considerable traction over the last few years and plays a critical role in realizing decentralized and cryptocurrency applications. A challenge that has been overlooked in prior blockchain algorithms is that they do not consider large-scale network outages and relied on the assumption of reliable global network connectivity. In the event of a large-scale network partition\, forks may occur between partitioned regions. After the partition ends they will be discarded\, leading to the loss of many blocks and a considerable amount of wasted work.\nThis paper presents PeloPartition\, which provides a sharding mechanism to improve blockchain’s resilience to the possibility of a global internet outage. In PeloPartition we form consensus groups dynamically and consider the partitioning of the group as a hint to split the blockchain into branches and guarantee that all of them will be merged after the network is recovered. We indicate different methodologies to ensure blockchain security while partitioning occurs. Our experiments use simulations to show how this approach can improve the performance of blockchain algorithms and prevent wasted computational power during partitioning.\n\nBio:\nJuncheng Fang is a 2nd-year Ph.D. student in the Computer Science Department at UC Irvine\, supervised by Prof. Faisal Nawab. His current research focuses on blockchain and distributed systems.
URL:https://isg.ics.uci.edu/event/juncheng-fang-pelopartition-improving-blockchain-resilience-to-partitioning-by-sharding/
LOCATION:DBH 4011
END:VEVENT
END:VCALENDAR