---
格式版本: 2
标题: "User Satisfaction-Aware Resource Allocation with Prospect-Theoretic Utility for Multimedia Streaming"
原文链接: "https://arxiv.org/abs/2608.10625"
发布日期: "2026-08-11"
发布时间校准状态: "found"
发布时间需复核: "否"
发布时间来源: "rule:local:strict_original_body"
发布时间证据: "**\\[v1\\]** Tue, 11 Aug 2026 08:13:24 UTC (270 KB)"
发布时间校准原因: "规则确认唯一严格发布时间，来源 local:strict_original_body"
发布时间校准置信度: "high"
发布时间候选数量: 18
发布时间严格候选数量: 6
发布时间原页读取状态: "source template page reused from URL open"
发布时间未找到原因: ""
发布时间校准时间: "2026-08-12T11:16:27+08:00"
发布时间仲裁状态: "skipped"
发布时间仲裁尝试次数: 0
发布时间仲裁耗时毫秒: 0
发现时间: "2026-08-12T11:13:54+08:00"
入库时间: "2026-08-12T03:16:27.750Z"
来源平台: "arXiv 学术论文搜索"
搜索渠道: "source_template"
搜索词: "https://arxiv.org/search/?query=deployment&searchtype=all"
匹配关键词:
  - "deployment"
  - "throughput"
相关厂家:
  []
相关专家:
  []
内容类型: "网页"
抓取工具: "Free Fetch + Defuddle"
清洗工具: "Defuddle Markdown + Defuddle/Readability 正文提取"
原始附件:
  []
AI优质: "否"
AI打分: 15
AI分档: "非优质"
AI质检状态: "不通过"
AI打分理由: "论文主题为多媒体流资源分配，与超节点、AI Rack、机柜级AI基础设施等完全无关，仅命中通用词deployment，无任何项目相关技术或商业信息。"
AI质检模型: "ali-deepseek-v4-flash"
AI质检时间: "2026-08-12T11:16:42+08:00"
AI主题相关性: 0
AI来源权威性: 5
AI新颖性: 5
AI技术细节: 0
AI商业部署信号: 0
AI完整性: 5
采集批次: "2026年8月12日2点04分20秒"
采集批次ID: "20260812-020420-289"
去重键: "https://arxiv.org/abs/2608.10625"
---

## Computer Science > Networking and Internet Architecture

## Title:User Satisfaction-Aware Resource Allocation with Prospect-Theoretic Utility for Multimedia Streaming

Authors:[Manoj Kumar S](https://arxiv.org/search/cs?searchtype=author&query=S,+M+K), [Pranjal Varshney](https://arxiv.org/search/cs?searchtype=author&query=Varshney,+P), [Avhishek Chatterjee](https://arxiv.org/search/cs?searchtype=author&query=Chatterjee,+A)

[View PDF](https://arxiv.org/pdf/2608.10625) [HTML (experimental)](https://arxiv.org/html/2608.10625v1)

> Abstract:Traditional resource allocation policies for multimedia streaming have primarily targeted metrics such as throughput, fairness and delay. However, user satisfaction is known to be strongly influenced by variations in throughput. Although some recent works have considered throughput variations, they overlooked a well-known aspect of human behavior that has reshaped behavioral economics over the past few decades: the same amount of decrease in throughput causes greater annoyance than the satisfaction caused by the increase. Motivated by this insight from the broad field of economics, popularly known as prospect theory, we propose a generic utility (metric) that captures both the average throughput and the asymmetric effect of throughput variations on user satisfaction. Next, we propose a resource allocation policy that reduces abrupt decreases in allocated resources when the system transitions from a resource-rich to resource-scarce state while respecting the priorities of different classes of users. Extensive simulations show that this policy outperforms the existing fair allocation policies. However, the choice of the optimal threshold depends on the network instance, which, in practice, may change frequently. Hence, building on the theoretical analysis of multi-queue systems, we propose fast numerical methods for determining the optimal threshold, which can be used in field deployments.

| Subjects: | Networking and Internet Architecture (cs.NI) |
| --- | --- |
| Cite as: | [arXiv:2608.10625](https://arxiv.org/abs/2608.10625) \[cs.NI\] |
|  | (or [arXiv:2608.10625v1](https://arxiv.org/abs/2608.10625v1) \[cs.NI\] for this version) |
|  | [https://doi.org/10.48550/arXiv.2608.10625](https://doi.org/10.48550/arXiv.2608.10625) |

## Submission history

From: Manoj Kumar S Mr. \[[view email](https://arxiv.org/show-email/b51a9088/2608.10625)\]  
**\[v1\]** Tue, 11 Aug 2026 08:13:24 UTC (270 KB)

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2608.10625) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))
