﻿<?xml version="1.0" encoding="utf-8"?>
<ArticleSet>
  <ARTICLE>
    <Journal>
      <PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName>
      <JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle>
      <ISSN>2322-1437</ISSN>
      <Volume>14</Volume>
      <Issue>55</Issue>
      <PubDate PubStatus="epublish">
        <Year>2026</Year>
        <Month>11</Month>
        <Day>9</Day>
      </PubDate>
    </Journal>
    <ArticleTitle>Soft and Safe Network Slicing with Hierarchical Multi-Agent Reinforcement Learning</ArticleTitle>
    <VernacularTitle>Soft and Safe Network Slicing with Hierarchical Multi-Agent Reinforcement Learning</VernacularTitle>
    <FirstPage>225</FirstPage>
    <LastPage>237</LastPage>
    <ELocationID EIdType="doi">10.66224/jist.51727.14.55.225</ELocationID>
    <Language>en</Language>
    <AuthorList>
      <Author>
        <FirstName>Zeinab</FirstName>
        <LastName>Sasan</LastName>
        <Affiliation>Amirkabir University of Technology Department of Computer Engineering</Affiliation>
      </Author>
      <Author>
        <FirstName>Siavash</FirstName>
        <LastName>Khorsandi</LastName>
        <Affiliation>دانشگاه صنعتی امیرکبیر</Affiliation>
      </Author>
    </AuthorList>
    <History PubStatus="received">
      <Year>2025</Year>
      <Month>10</Month>
      <Day>6</Day>
    </History>
    <Abstract>&lt;p&gt;Network slicing has emerged as a key enabler for next-generation mobile networks, allowing multiple virtual network slices to coexist over shared physical infrastructure. Soft network slicing can improve resource utilization by enabling controlled inter-slice resource sharing; however, increased resource sharing may impose a higher burden on donor slices and consequently increase slice dissatisfaction. Achieving efficient resource utilization while controlling slice dissatisfaction and maintaining feasible resource allocation remains challenging under dynamic and heterogeneous traffic demands. In this paper, we propose a Hierarchical Multi-Agent Reinforcement Learning (HMARL) framework for online soft and safe network slicing. The proposed architecture operates at two decision levels: slice-level agents make local admission decisions, while a higher-level meta-controller coordinates inter-slice resource sharing through adaptive borrowing limits. A deterministic safety layer validates the proposed actions before resource allocation and ensures compliance with resource, continuity, and borrowing constraints. The proposed framework is evaluated against learning-based, non-sharing, random, greedy, and heuristic resource-allocation approaches. The training results show that HMARL reaches a stable operating regime with high normalized resource utilization and a low request rejection ratio. Across different scenario classes, HMARL achieves a favorable trade-off between resource utilization and slice dissatisfaction, resulting in competitive overall objective values relative to the considered alternatives. These results indicate that hierarchical coordination combined with deterministic feasibility enforcement provides an effective approach for adaptive resource management in soft network slicing environments.&lt;/p&gt;</Abstract>
    <ObjectList>
      <Object Type="Keyword">
        <Param Name="Value">Hierarchical Multi-Agent Reinforcement Learning (HMARL)</Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value">Soft Network Slicing</Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value">Safe Network Slicing</Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value">Resource Allocation</Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value">Multi-Agent Systems</Param>
      </Object>
      <Object Type="Keyword">
        <Param Name="Value">Safe Reinforment Learning</Param>
      </Object>
    </ObjectList>
    <ArchiveCopySource DocType="Pdf">http://jist.ir/ar/Article/Download/51727</ArchiveCopySource>
  </ARTICLE>
</ArticleSet>