[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"doc-detail-83349-en":3,"doc-seo-83349-105":29,"detail-sidebar-cat-0-en-105":91},{"code":4,"msg":5,"data":6},0,"success",{"doc_id":7,"user_id":8,"nickname":9,"user_avatar":10,"doc_module":4,"category_id":11,"category_name":12,"doc_title":13,"doc_description":14,"doc_content":15,"file_id":16,"file_url":17,"file_type":18,"file_size":19,"view_count":20,"is_deleted":4,"is_public":20,"is_downloadable":20,"audit_status":20,"page_count":21,"language":22,"language_code":23,"site_id":24,"html_lang":23,"table_of_contents":25,"faqs":26,"seo_title":13,"seo_description":14,"update_tm":27,"read_time":28},83349,687197207919,"Theodora","https://ap-avatar.wpscdn.com/avatar/a000253d6f5f7c60be?x-image-process=image/resize,m_fixed,w_180,h_180&k=1779446848396160552",8,"Research & Report","Self-Stabilizing Algorithms in the Uniform Port Model","The paper presents the uniform port model, a distributed computational framework where every port (half-edge) of every input graph hosts the same constant-size finite automaton. The model is uniform not only in its obliviousness to graph size and parameters, but also in its explicit support for assigning input and output labels to half-edges, enabling natural formulations of half-edge-labeling tasks. It introduces efficient self-stabilizing uniform port algorithms with poly-logarithmic runtime for fundamental local symmetry breaking problems, including maximal independent set, maximal matching, sinkless orientation, and maximal node/edge k-coloring, establishing the first existence of such algorithms in a truly uniform setting.","arXiv :2607 .08244v 1 [ cs .DC] 9 Jul 2026  \nSelf-Stabilizing Algorithms in the Uniform Port Model  \nLiam Brinker \\#  \nTechnion-Israel Institute of Technology, Israel Yuval Emek \\#  \nTechnion-Israel Institute of Technology, Israel Oren Louidor \\#  \nTechnion-Israel Institute of Technology, Israel  \n~~ Abstract ~~  \nWe introduce a distributed computational model referred to as the uniform port model. An algorithm operating in this model is defined by means of local automata associated with the ports (a.k.a. half-edges) of the input graph. The crux of the uniform port model is that a single constant-size finite automaton is hosted by every port of every graph, making the model truly uniform. Moreover, since the new model explicitly supports the assignment of (input and) output labels to the graph’s (half-)edges, it facilitates natural formulations of (half-)edge-labeling problems such as maximal matching and sinkless orientation, which are outside the expressivity scope of prior node-centric truly uniform distributed computational models.  \nThe main technical contribution of this paper is the design of efficient (i.e., with poly-logarithmic runtime) self-stabilizing uniform port algorithms, operating on general graphs, for various fundamental local symmetry breaking problems, including maximal independent set, maximal matching, sinkless orientation, and maximal node/edge k-coloring. While efficient self-stabilizing algorithms for local symmetry breaking problems have been extensively studied in stronger computational models, our work is the first to demonstrate the existence of such algorithms in a truly uniform model.  \n2012 ACM Subject Classification Theory of computation → Distributed algorithms  \nKeywords and phrases truly uniform algorithms, uniform port model, self-stabilization, local symmetry breaking  \n0 Self-Stabilizing Algorithms in the Uniform Port Model  \nContents  \n1 Introduction 1  \n2 Preliminaries 3  \n3 Maximal Independent Set 6  \n3.1 The MIS Algorithm ................................ 6  \n3.2 Analysis ....................................... 8  \n4 Maximal Matching 12  \n4.1 The MM Algorithm ................................ 12  \n4.2 Analysis ....................................... 15  \n4.2.1 Stochastic Analysis of the Tournaments ................. 20  \n5 Sinkless Orientation 23  \n5.1 The SO Algorithm ................................. 23  \n5.2 Analysis ....................................... 24  \n6 Maximal Node and Edge k-Coloring 27  \n7 The 2-State Process may be Slow 28  \n8 Additional Related Work 30  \nA Proving Lemma 2.2 34  \nL. Brinker, Y. Emek, and O. Louidor 1  \n 1  Introduction  \nThe notion of uniformity in computational models refers to settings in which the algorithm designer is oblivious to the size (and often other parameters) of the problem instances on which the algorithm is executed. The main advantage of uniform algorithms is that they enable a one-size-fits-all approach: the same computational device can be used for all problem instances. In distributed computing, this advantage is amplified as a single execution often involves a multitude of such devices. Traditionally, uniform distributed algorithms were studied without accounting for the memory size of the computational devices, effectively allowing infinite memory.  \nThe turning point in this regard came when the research community realized that distributed computing is not limited to computer networks; rather, interesting distributed processes also arise in networks composed of devices that are much weaker than silicon-based computers. A pioneering work in this direction is the paper of Afek et al. [1] who discovered that a biological process occurring during the development of the nervous system of the Drosophila melanogaster is equivalent to solving an instance of the maximal independent set (MIS) problem—a classic local symmetry breaking problem that is among the most extensively studied problems in distributed computing.  \nMotivated by this di","cbCaiqMbnTPf77kv","https://ap.wps.com/l/cbCaiqMbnTPf77kv","pdf",729159,1,36,"English","en",105,"# Introduction\n# Preliminaries\n# Maximal Independent Set\n## The MIS Algorithm\n## Analysis\n# Maximal Matching\n## The MM Algorithm\n## Analysis\n## Stochastic Analysis of the Tournaments\n# Sinkless Orientation\n## The SO Algorithm\n## Analysis\n# Maximal Node and Edge k-Coloring\n# The 2-State Process may be Slow\n# Additional Related Work\n# Proving Lemma 2.2","[{\"question\":\"What is the uniform port model and how is it different from node-centric uniform models?\",\"answer\":\"In the uniform port model, every port (half-edge) of every graph runs the same constant-size finite automaton. It also allows explicit assignment of input and output labels to half-edges, which supports half-edge-labeling problems beyond the expressivity of earlier node-centric uniform models.\"},{\"question\":\"Which self-stabilizing local symmetry breaking problems does the paper address?\",\"answer\":\"The paper designs efficient self-stabilizing uniform port algorithms for maximal independent set, maximal matching, sinkless orientation, and maximal node/edge k-coloring.\"},{\"question\":\"Why is self-stabilization important in truly uniform distributed algorithms?\",\"answer\":\"Self-stabilizing algorithms must recover from arbitrary initial configurations, without relying on graceful, synchronized initialization. This makes them robust to transient disturbances that would otherwise derail algorithms that assume coordinated startup.\"}]",1784186938,91,{"code":4,"msg":30,"data":31},"ok",{"site_id":24,"language":23,"slug":32,"title":13,"keywords":33,"description":14,"schema_data":34,"social_meta":86,"head_meta":88,"extra_data":90,"updated_unix":27},"self-stabilizing-algorithms-in-the-uniform-port-model","",{"@graph":35,"@context":85},[36,53,68],{"@type":37,"itemListElement":38},"BreadcrumbList",[39,43,47,50],{"item":40,"name":41,"@type":42,"position":20},"https://docshare.wps.com","Home","ListItem",{"item":44,"name":45,"@type":42,"position":46},"https://docshare.wps.com/document/","Document",2,{"item":48,"name":12,"@type":42,"position":49},"https://docshare.wps.com/document/research-report/",3,{"item":51,"name":13,"@type":42,"position":52},"https://docshare.wps.com/document/self-stabilizing-algorithms-in-the-uniform-port-model/83349/",4,{"url":51,"name":13,"@type":54,"author":55,"headline":13,"publisher":57,"fileFormat":60,"inLanguage":23,"description":14,"dateModified":61,"datePublished":62,"encodingFormat":60,"isAccessibleForFree":63,"interactionStatistic":64},"DigitalDocument",{"name":9,"@type":56},"Person",{"url":40,"name":58,"@type":59},"DocShare","Organization","application/pdf","2026-07-17","2026-07-16",true,{"@type":65,"interactionType":66,"userInteractionCount":20},"InteractionCounter",{"@type":67},"ViewAction",{"@type":69,"mainEntity":70},"FAQPage",[71,77,81],{"name":72,"@type":73,"acceptedAnswer":74},"What is the uniform port model and how is it different from node-centric uniform models?","Question",{"text":75,"@type":76},"In the uniform port model, every port (half-edge) of every graph runs the same constant-size finite automaton. It also allows explicit assignment of input and output labels to half-edges, which supports half-edge-labeling problems beyond the expressivity of earlier node-centric uniform models.","Answer",{"name":78,"@type":73,"acceptedAnswer":79},"Which self-stabilizing local symmetry breaking problems does the paper address?",{"text":80,"@type":76},"The paper designs efficient self-stabilizing uniform port algorithms for maximal independent set, maximal matching, sinkless orientation, and maximal node/edge k-coloring.",{"name":82,"@type":73,"acceptedAnswer":83},"Why is self-stabilization important in truly uniform distributed algorithms?",{"text":84,"@type":76},"Self-stabilizing algorithms must recover from arbitrary initial configurations, without relying on graceful, synchronized initialization. This makes them robust to transient disturbances that would otherwise derail algorithms that assume coordinated startup.","https://schema.org",{"og:url":51,"og:type":87,"og:title":13,"og:site_name":58,"og:description":14},"article",{"robots":89,"canonical":51},"index,follow",{"doc_id":7,"site_id":24},{"code":4,"msg":5,"data":92},[93,97,101,105,110,115,120,123,128,131,135],{"id":20,"doc_module":4,"doc_module_name":45,"category_name":94,"show_sort_weight":95,"slug":96},"Story & Novel",90,"story-novel",{"id":46,"doc_module":4,"doc_module_name":45,"category_name":98,"show_sort_weight":99,"slug":100},"Literature",80,"literature",{"id":52,"doc_module":4,"doc_module_name":45,"category_name":102,"show_sort_weight":103,"slug":104},"Exam",70,"exam",{"id":106,"doc_module":4,"doc_module_name":45,"category_name":107,"show_sort_weight":108,"slug":109},5,"Comic",60,"comic",{"id":111,"doc_module":4,"doc_module_name":45,"category_name":112,"show_sort_weight":113,"slug":114},6,"Technology",50,"technology",{"id":116,"doc_module":4,"doc_module_name":45,"category_name":117,"show_sort_weight":118,"slug":119},7,"Healthcare",40,"healthcare",{"id":11,"doc_module":4,"doc_module_name":45,"category_name":12,"show_sort_weight":121,"slug":122},30,"research-report",{"id":124,"doc_module":4,"doc_module_name":45,"category_name":125,"show_sort_weight":126,"slug":127},9,"Religion & Spirituality",20,"religion-spirituality",{"id":126,"doc_module":4,"doc_module_name":45,"category_name":129,"show_sort_weight":126,"slug":130},"World Cup","world-cup",{"id":132,"doc_module":4,"doc_module_name":45,"category_name":133,"show_sort_weight":132,"slug":134},10,"Lifestyle","lifestyle",{"id":136,"doc_module":4,"doc_module_name":45,"category_name":137,"show_sort_weight":106,"slug":138},19,"General","general"]