检索结果-内蒙古大学图书馆

Annual Conference on Wireless On Demand Network Systems and Services (WONS)

作者： Anatolij Zubow Sascha Rösler Juan Cabrera Frank H. P. Fitzek Falko Dressler School of Electrical Engineering and Computer Science TU Berlin Germany Deutsche Telekom Chair of Communication Networks TU Dresden Germany

ISBN: (数字)9783903176713

ISBN: (纸本)9798331522025

The usage of network devices equipped with multiple radio access technologies is a promising way to achieve high throughput, low latency, and resilient wireless communication. However, classical scheduling approaches cannot realize the full potential because packet loss on one radio interface can result in resources on the other interfaces to remain unused. This is particularly a problem in situations with asymmetric link data and loss rates. We show that the performance of a multi-RAT system can be significantly improved by the application of intra-flow network coding where the loss of a single or multiple coded packets on one interface does not result in blockage and hence unused radio resources on some other interface. Moreover, it is less sensitive to transmission failures on the backward direction used by automatic repeat request (ARQ). Results from simulations reveal that our approach is able to outperform a classical approach in terms of throughput by factor of up-to 4.4× in certain scenarios.

关键词： Wireless communication Wireless sensor networks Prototypes Packet loss Network coding Throughput Scheduling Radio access technologies Automatic repeat request Resilience

来源：评论

学校读者我要写书评

暂无评论

Resilience analysis of quantum network against targeted attacks: Recovery via rerouting and purification

引用

Optical Switching and Networking 2025年 57卷

作者： Tunc, Hilal Sultan Duranoglu Bayleyegn, Abebu Ademe Notcker, Joachim Bassoli, Riccardo Fitzek, Frank H.P. Deutsche Telekom Chair of Communication Networks Institute of Communication Technology Faculty of Electrical and Computer Engineering Technische Universität Dresden Dresden Germany Cluster of Excellence Dresden Germany research group Institute of Communication Technology Faculty of Electrical and Computer Engineering Technische Universität Dresden Dresden Germany

Quantum networks are essential for secure quantum communication and distributed quantum computing. However, their performance is highly vulnerable to targeted attacks that disrupt entanglement distribution, leading to significant network degradation. To address this challenge, we propose two heuristic routing algorithms Quantum Entanglement Distribution Algorithm 1 (QEDA1) and Quantum Entanglement Distribution Algorithm 2 (QEDA2) that minimize loss of fidelity by reducing the number of intermediate nodes while optimizing entanglement swapping and purification strategies. In QEDA1 we only applied purification as a recovery mechanism, while in QEDA2 we utilized a purification-rerouting approach. Furthermore, unlike previous studies, which relied primarily on idealized or small-scale topologies, we evaluated our approach on a real-world network topology (Surfnet), analyzing throughput variations under both normal conditions and targeted attacks. Furthermore, we compare the performance of the algorithm in memory-assisted and memoryless quantum networks, demonstrating the impact of quantum memory on network resilience. In addition, we introduce an attack model based on centrality-driven node failures and propose a recovery mechanism that integrates rerouting and entanglement purification to mitigate the effects of targeted attacks. Our results indicate that QEDA2 is more effective in mitigating the effect of attacks on throughput. Moreover, our findings highlight the trade-offs between network robustness, resource allocation, and fidelity constraints, providing valuable insights for the design of resilient large-scale quantum networks. © 2025 The Authors

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

A Survey on Privacy and Security in Distributed Cloud Computing: Exploring Federated Learning and Beyond

IEEE Open Journal of the Communications Society

引用

IEEE Open Journal of the communications Society 2025年 6卷 3710-3744页

作者： Rahdari, Ahmad Keshavarz, Elham Nowroozi, Ehsan Taheri, Rahim Hajizadeh, Mehrdad Mohammadi, Mohammadreza Sinaei, Sima Bauschert, Thomas Shiraz University School of Electrical and Computer Engineering Shiraz71946-84636 Iran Pishtazan Institute of Higher Education Department of Computer Engineering Shiraz71957-93436 Iran University of Greenwich Centre for Sustainable Cyber Security LondonSE10 9LS United Kingdom University of Portsmouth PAIDS Reserach Centre School of Computing PortsmouthPO1 2UP United Kingdom Technische Universität Chemnitz Chair of Communication Networks Chemnitz09111 Germany Department Digital Systems Gothenburg412 58 Sweden

The increasing need to process large, high-dimensional datasets and the substantial computational power required have made the use of distributed cloud servers essential. These servers provide cost-effective solutions that make storage and computing accessible to ordinary users. However, they might face significant vulnerabilities, including data leakage, metadata spoofing, insecure programming interfaces, malicious insiders, and denial of service. To gain public trust in distributed computing, addressing concerns related to privacy and security while ensuring high performance and efficiency is crucial. Multiparty computation, differential privacy, trusted execution environments, and federated learning are the four major approaches developed to address these issues. This survey paper reviews and compares these four approaches based on a structured framework, by highlighting recent top-tier research papers published in prestigious journals and conferences. Particular attention is given to progress in federated learning, which trains a model across multiple devices without sharing the actual data, keeping data private and secure. The survey also highlights federated learning techniques, including secure federated learning, by detecting malicious updates and privacy-preserving federated learning via data encryption, data perturbation, and anonymization, as new paradigms for building responsible computing systems. Finally, the survey discusses future research directions for connecting academic innovations with real-world industrial applications. © 2020 IEEE.

关键词： Distributed cloud

来源：评论

学校读者我要写书评

暂无评论

Evaluating Transport Layer Congestion Control Algorithms: A Comprehensive Survey

引用

IEEE communications Surveys and Tutorials 2025年

作者： Vielhaus, Christian L. Von Lengerke, Caspar Latzko, Vincent Rischke, Justus Reisslein, Martin Fitzek, Frank H. P. Technische Universität Dresden Dresden01062 Germany The Deutsche Telekom Chair of Communication Networks 5G Lab Germany Technical University of Dresden Dresden01069 Germany Electrical Computer and Energy Eng. Arizona State University TempeAZ85287-5706 United States

Congestion Control (CC) limits the transmission rate of data packets in the transport layer protocol, e.g., in TCP and QUIC, of a sending endpoint so as to mitigate the congestion in packet-switched communication networks. Numerous studies have developed and evaluated Congestion Control Algorithms (CCAs) for a wide range of network types. Prior surveys have covered the functioning of the existing CCAs and their performance characteristics. In contrast, this survey focuses on the quantitative evaluation of CCAs;specifically, we comprehensively survey the CCA evaluation methodologies, i.e., the why and how of CCA evaluations. We define a CCA evaluation as a combination of a prescribed evaluation scenario with prescribed evaluation metrics. In turn, we define an evaluation scenario as a combination of a prescribed network (e.g., path) model and a particular traffic model. We present comprehensive sets of network and traffic model characteristics (i.e., network scenario characteristics) that can influence the performance of CCAs, as well as a comprehensive set of evaluation metrics for measuring the performance of CCAs. We taxonomize CCA evaluations into the main categories: Steady-state, transient-state, network variation, dynamic (e.g., wireless) network, and competition evaluations. We place and survey the existing CCA evaluation studies in this taxonomy to uncover the main trends and shortcomings of the CCA evaluation field to date. To facilitate the comprehensive rigorous evaluation of CCAs, we have developed the publicly available CCA evaluation framework ccperf, which incorporates the insights from our survey. We also outline future research directions to further advance the comprehensive rigorous evaluation of CCAs. © 1998-2012 IEEE.

关键词： Congestion control (communication)

来源：评论

学校读者我要写书评

暂无评论

Quantum qubit-optical cavity node: Effects of the temperature and coupling strengths on the cavity Fock-state distribution occupation probability and entropy of the subsystems using Dicke model

引用

Results in Physics 2025年 72卷

作者： Barhoumi, Mohamed Bassoli, Riccardo Fitzek, Frank H.P. Laboratory of Condensed Matter and Nanosciences (LMCN) Department of Physics Faculty of Sciences of Monastir University of Monastir Environment Street Monastir 5019 Tunisia Institut Supérieur d'Informatique et de Mathématiques de Monastir (ISIMM) University of Monastir Avenue de la Corniche Monastir 5000 Tunisia Deutsche Telekom Chair of Communication Networks Institute of Communication Technology Faculty of Electrical and Computer Engineering Technische Universität Dresden Dresden Germany Centre for Tactile Internet with Human-in-the-Loop (CeTI) Cluster of Excellence Dresden Germany Quantum Communication Networks (QCNets) research group Institute of Communication Technology Faculty of Electrical and Computer Engineering Technische Universität Dresden Dresden Germany

One of the most attractive systems for scalable quantum processing is the trapped atom in the optical cavity, which is easily manipulable with lasers. The qubit cavity system represents an attractive structure for quantum optics, with possibilities for applications in quantum detecting, quantum computation, and quantum communication. In addition, the investigation of the cavity-atom system under temperature is a fundamental concept in quantum optics and quantum information science. Here we continue in this quantum way, investigating different qubit(s)-cavity systems (where we increase the numbers of the qubit inside the optical cavity from one to four). Using the Dicke model, we calculate the probability of occupation of the ground state of the cavity 〈aˆ^†aˆ〉 and the expectation values 〈J_z〉 for each system. We find that these probabilities increase as the coupling strength C_s increases. This leads to reaching the ultra-strong coupling regime, which depends on the number of qubits. To describe the quantum state, we examine the cavity Wigner function WF as a function of the coupling strength C_s. Under the same parameters (e.g. C_s and the dissipation rates), we find that the separation of the quantum state in the WFs representation is different from one system to another. Furthermore, since understanding these kinds of systems is very important in order to improve the quantum network system, we study the entropy S of the subsystems (such as S of qubit) in each system. Also, we move beyond by studying the effect of the temperature on the Fock-state distribution occupation probability and entropy of the subsystems. Our results present another step to understanding the qubit(s)-cavity interaction to improve the performance of future quantum networks based on this system. Where the interplay between temperature, coupling strengths, and the Fock-state occupation probabilities contributes significantly to the understandi

关键词： Cavity Dicke model Quantum communication networks Quantum nodes Quantum state Qubit Qubit–cavity system Temperature

来源：评论

学校读者我要写书评

暂无评论

A Tutorial on Resilience in Smart Grids 12

A Tutorial on Resilience in Smart Grids

引用

12th International Workshop on Resilient networks Design and Modeling, RNDM 2022

作者： Stocker, Armin De Meer, Hermann University of Passau Chair of Computer Networks and Computer Communication Passau94032 Germany

ISBN: (数字)9781665486774

ISBN: (纸本)9781665486774

A key quality of any kind of system is its ability to deliver its respective service correctly. Often the unavailability of commercial systems may lead to lost revenue, which are minor compared to what may be at stake when critical infrastructures fail. A failure to deliver critical services, such as clean water or electricity may have dire consequences that endanger human lives and may even halt or break other infrastructures. The services provided by critical infrastructures need to be supplied continuously even when faced with re-configurations, outside disturbances and systemic changes. A system is called resilient if it fulfils this property. From the many critical infrastructures that exist, power systems may be the most important ones, because they are supplying the required electricity for other critical infrastructures. At the same time, a power system itself may be exposed to several disturbances from internal sources, e.g., fluctuations in the energy demand, and external sources, e.g., heavy storms. Especially, fast dynamic effects caused by these disturbances may lead to deviations of grid frequency, short-circuits, or, in severe cases, a total power system failure. As future scenarios will include more distributed renewable sources and less centralized generation from fossil fuels, ICT-based communication and coordination will play an increasing role. This paper examines the notion of resilience, how it has been traditionally ensured for the power system, and novel approaches to maintain the frequency, protect people and devices against short circuits and recover from a blackout. A special focus is on communication and the role that distributed renewable generation plays for these processes. © 2022 IEEE.

关键词： Critical infrastructures

来源：评论

学校读者我要写书评

暂无评论

Multi-stage switching networks with overflow links for a single call class 5

Multi-stage switching networks with overflow links for a sin...

引用

5th International Conference in Image Processing and communications, IP&C 2013

作者： Gląbowski, Mariusz Stasiak, Michal Dominik Chair of Communication and Computer Networks Poznan University of Technology Poznań Poland

ISBN: (纸本)9783319016214

This article proposes a new analytical model of a multi-stage switching network with a system of overflow links in the first stage of the network. The initial assumption in the study was that the system of overflow links would be used by one class of calls. The article presents the dependencies between the internal blocking probability and the capacity of the overflow link. The results of the analytical calculations are then compared with the results of the simulations of multi-stage switching networks. The present study has confirmed fair accuracy of the proposed method and proved the validity of the implementation of overflow links in switching networks. © Springer International Publishing Switzerland 2014.

关键词： Switching networks

来源：评论

学校读者我要写书评

暂无评论

The New Model of Limited Availability Group

The New Model of Limited Availability Group

引用

6th International Image Processing and communications Conference, IPandC 2014

作者： Hanczewski, Slawomir Slowik, Wojciech Chair of Communication and Computer Networks Poznan University of Technology Poznan Poland

ISBN: (纸本)9783319106618

The paper presents a new model of a limited availability group (LAG). The model is based on the Erlang's Ideal Grading (EIG) model. The proposed model is an effect of works on the application of the EIG model in modeling other telecommunication systems. The results obtained with the aid of the new model have been compared with the results of simulations and an earlier model of a limited availability group described in the literature. They confirmed a satisfactory accuracy of the proposed model. © Springer International Publishing Switzerland 2015.

关键词： Grading

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Lightpath Deployment Strategies in Flexible-Grid Optical networks 25

Evaluation of Lightpath Deployment Strategies in Flexible-Gr...

引用

25th International Conference on Optical Network Design and Modelling, ONDM 2021

作者： Varasteh, Amir Patri, Sai Kireet Autenrieth, Achim Mas-Machuca, Carmen Chair of Communication Networks Department of Electrical and Computer Engineering Germany Adva Germany

ISBN: (纸本)9783903176331

With the recent advances in elastic optical networks, a significant increase in throughput is promised with the use of bandwidth variable transponders. These transponders support different lightpath configurations, in terms of data rate, modulation format, and bandwidth. Considering the ever-increasing traffic in the core optical networks, routing, configuration, and spectrum assignment (RCSA) algorithms are crucial to increase the network throughput over the planning periods. To do this, lightpaths should be configured with enough data rate, while guaranteeing the signal quality at the *** this work, we present a detailed evaluation of different lightpath deployment strategies in the context of multi-period elastic optical network planning. We show that in our RCSA algorithm, a multi-objective optimization can cope with the increasing traffic by deploying up to 31% fewer lightpaths while reducing the over-provisioning by 9% compared with the greedy approaches. Further, our simulation results indicate that our proposed approach can lead up to 16% higher power-efficiency. © 2021 IFIP TC6 WG6.10.

关键词： Electric power utilization

来源：评论

学校读者我要写书评

暂无评论

Efficient and perfectly unlinkable sanitizable signatures without group signatures 10

Efficient and perfectly unlinkable sanitizable signatures wi...

引用

10th European Workshop on Public Key Infrastructures, Services and Applications, EuroPKI 2013

作者： Brzuska, Christina Pöhls, Henrich C Samelin, Kai Samelin, Kai Tel Aviv University Israel Chair of IT-Security Germany Chair of Computer Networks and Computer Communication Germany University of Passau Germany

ISBN: (纸本)9783642539961

Sanitizable signatures allow for controlled modification of signed data. The essential security requirements are accountability, privacy and unlinkability. Unlinkability is a strong notion of privacy. Namely, it makes it hard to link two sanitized messages that were derived from the same message-signature pair. In this work, we strengthen the standard unlinkability definition by Brzuska et al. at PKC’10, making it robust against malicious or buggy signers. While state-of-the art schemes deploy costly group signatures to achieve unlinkability, our construction uses standard digital signatures, which makes them compatible with existing infrastructure. We construct a sanitizable signature scheme that satisfies the strong notion of perfect unlinkability and, simultaneously, achieves the strongest notion of accountability, i.e., non-interactive public accountability. Our construction is not only legally compliant, but also highly efficient, as the measurements of our reference implementation show. Finally, we revisit the security model by Canard et al. and correct a small flaw in their security definition given at AfricaCrypt’12. © Springer-Verlag Berlin Heidelberg 2014

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：