the emergence of multi-access edge computing (MEC) promised to facilitate convenient access to services for mobile users via edge networks. Frequently, these users are on the move, switching between operator network d...
详细信息
ISBN:
(纸本)9781665477062
the emergence of multi-access edge computing (MEC) promised to facilitate convenient access to services for mobile users via edge networks. Frequently, these users are on the move, switching between operator network domains. At the network level, this is addressed via the well-known "roaming" facility offered by operators. At the application level, i.e., in terms of providing application services to users, this is being addressed via the GSMA Alliances' Operator Platform Group (OPG) initiative. One of the key aims of this initiative is to facilitate interoperability between operator networks in order to enable MEC. In particular, seamless migration and placement of services across edge nodes situated within multiple operator network domains would be essential to facilitate multi-operator MEC. To that end, in this position paper, we define this crucial research issue, present its various dimensions, and propose an architecture and solution approach to solve this issue. We also show how our architecture and approach can be used to enhance the emerging GSMA OPG standards.
the growing usage of Internet of things (IoT) devices in smart city applications has resulted in a surge in data volume. However, a centralized cloud server for IoT applications is practically infeasible because of hi...
详细信息
Livestock farming is vital to the global economy, but faces challenges in traceability, sustainability, and productive efficiency due to a lack of standardization and difficulties in data sharing. Withthe increasing ...
详细信息
distributed teams have gained prominence in software companies. However, studies indicate that distributed Software Development (DSD) companies often face challenges related to high developer turnover. Conversely, oth...
详细信息
We consider locally checkable labeling (LCL) problems in the LOCAL model of distributedcomputing. Since 2016, there has been a substantial body of work examining the possible complexities of LCL problems. For example...
详细信息
ISBN:
(纸本)9783959773096
We consider locally checkable labeling (LCL) problems in the LOCAL model of distributedcomputing. Since 2016, there has been a substantial body of work examining the possible complexities of LCL problems. For example, it has been established that there are no LCL problems exhibiting deterministic complexities falling between omega(log* n) and o(log n). this line of inquiry has yielded a wealth of algorithmic techniques and insights that are useful for algorithm designers. While the complexity landscape of LCL problems on general graphs, trees, and paths is now well understood, graph classes beyond these three cases remain largely unexplored. Indeed, recent research trends have shifted towards a fine-grained study of special instances within the domains of paths and trees. In this paper, we generalize the line of research on characterizing the complexity landscape of LCL problems to a much broader range of graph classes. We propose a conjecture that characterizes the complexity landscape of LCL problems for an arbitrary class of graphs that is closed under minors, and we prove a part of the conjecture. Some highlights of our findings are as follows. We establish a simple characterization of the minor-closed graph classes sharing the same deterministic complexity landscape as paths, where O(1), theta(log* n), and theta(n) are the only possible complexity classes. It is natural to conjecture that any minor-closed graph class shares the same complexity landscape as trees if and only if the graph class has bounded treewidth and unbounded pathwidth. We prove the "only if" part of the conjecture. For the class of graphs with pathwidth at most k, we show the existence of LCL problems with randomized and deterministic complexities theta(n), theta(n(1/2)), theta(n(1/3)),..., theta(n(1/k)) and the non-existence of LCL problems whose deterministic complexity is between omega(log* n) and o(n(1/k)). Consequently, in addition to the well-known complexity landscapes for paths, tre
Toxic comments are pervasive on online platforms, which makes it difficult to maintain positive dialogue and create a secure online space. People’s emotions and overall state of mental health start to seriously decli...
详细信息
the use of several machine learning regression models for the prediction of power costs is explored in this work. the following models are taken into consideration: Gradient Boosting, Adaboosting, Lgbmregressor, Catab...
详细信息
State management has long been a challenge for serverless applications. Owing to their failure resilience and consistency guarantees, distributed shared logs have been recently proposed as a promising storage substrat...
详细信息
ISBN:
(纸本)9798400711817
State management has long been a challenge for serverless applications. Owing to their failure resilience and consistency guarantees, distributed shared logs have been recently proposed as a promising storage substrate enabling stateful serverless applications. We show that, unfortunately, state-of-the-art sacrifices compute tier scalability for log access performance, a particularly undesirable exchange for the dynamic serverless environment. the culprit is the log indexing architecture, namely relying on complete local indexes colocated with serverless functions. this design prevents efficient scaling and even risks out-of-memory errors. IndiLog is a novel distributed indexing architecture enabling stateful serverless applications to efficiently access a distributed shared log for state management without impeding compute tier scalability. IndiLog uses a combination of local, size-bounded indexes designed to capture the expected locality patterns alongside a sharded and balanced index tier which tackles the challenges of supporting log sub-streams and bounded reads. IndiLog bests or matches Boki, a state-of-the-art distributed shared log, over various index hit rates, workload concurrency and compute tier scaling sizes.
the SWMR atomic register is a fundamental building block in shared memory distributedsystems and implementing it from SWSR atomic registers is an important problem. While this problem has been solved in crash-prone s...
详细信息
this study presents a specialised Java-based network sniffer designed for department-level monitoring of commercial computer systems on university networks. the sniffer is a powerful, platform-independent tool for rea...
详细信息
暂无评论