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

Content Storage Management and Precaching Scheme in Content-Centric-Network-Based Internet of Vehicles

IEEE INTERNET OF THINGS JOURNAL 2025年第9期12卷 12927-12947页

作者： Nam, Youngju Choi, Hyeonseok Lee, Euisin Kunsan Natl Univ Sch Software Gunsan 54150 South Korea Chungbuk Natl Univ Res Inst Comp & Informat Commun Cheongju 28644 South Korea Chungbuk Natl Univ Sch Informat & Commun Engn Cheongju 28644 South Korea

The emergence of smart cars has led to a significant increase in mobile data traffic on the backhaul links as a vast amount of contents is generated and consumed in the Internet of Vehicles (IoV). To cope with this situation, the precaching research of content-centric networks (CCNs) has been applied as a promising solution for reducing traffic consumption. However, most precaching schemes in CCN-IoV only focus on delay-sensitive content (DSC) and do not have proper content storage management (CSM), limiting their ability to minimize delays. To address these issues, we thus propose a novel CSM and precaching (CSMP) scheme consisting of three methods. To prevent the erases of precached or popular content, we have designed a CSM method based on our caching priority algorithm. Additionally, we have designed a DSC precaching method to improve mobility prediction and reduce delays using the recalculation time based on the Gaussian distribution with skewness. Finally, we have designed a delay-tolerant content (DTC) precaching method to minimize backhaul link traffic consumption by using an integer linear programming approach. The proposed CSMP scheme improved the evaluation value considering the success ratio and the backhaul link traffic by 23.21% compared with the existing schemes in our NS3-based simulations.

关键词： Caching storage (CS) management content-centric network (CCN) delay tolerant/sensitive content Internet of Vehicles (IoV) precaching priority algorithm Caching storage (CS) management content-centric network (CCN) delay tolerant/sensitive content Internet of Vehicles (IoV) precaching priority algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient traffic management with adaptive SDN in vehicular networks

引用

SCIENTIFIC REPORTS 2025年第1期15卷 1-12页

作者： Rajan, Sherine Jenny Narayanaswamy, Sugirtham Balashanmugam, Thiyaneswaran Sengottaiyan, Kumarganesh Selvaraj, Anthoniraj Majumder, Pratham Al-Rasheed, Amal Getahun, Masresha Soufiene, Ben Othman Dr Mahalingam Coll Engn & Technol Dept ECE Coimbatore Tamil Nadu India Sona Coll Technol Dept ECE Salem Tamil Nadu India Knowledge Inst Technol Dept ECE Salem Tamil Nadu India Jain Univ Sch Comp Sci & Engn Ramanagara India Jain Univ Dept Informat Sci & Engn Kanakapura India Princess Nourah Bint Abdulrahman Univ Coll Comp & Informat Sci Dept Informat Syst POB 84428 Riyadh Saudi Arabia Kebri Dehar Univ Coll Engn & Technol Dept Comp Sci & Informat Technol Kebri Dehar Ethiopia Univ Sousse PRINCE Lab Res ISITcom Hammam Sousse Tunisia

Improving road safety and easing congestion require effective real-time traffic data analysis and management. A crucial part of intelligent transportation systems, vehicular ad hoc networks (VANETs) deal with issues like inconsistent data from erratic vehicle movements and frequent topology changes. In order to develop a responsive and adaptable network management architecture for VANETs, this study makes use of Software-Defined Networking (SDN). SDN optimizes traffic flow, boosts routing efficiency, and improves Quality of Service (QoS) by separating the control and data planes. Traffic analysis and network performance are greatly improved when SDN is combined with priority algorithms and the Zigbee protocol. The effectiveness of this strategy in a controlled setting is shown by simulations conducted with COOJA software. Web digitization tools are also used to guarantee the accuracy of the data. Improved QoS, better traffic flow management, and scalable solutions for dynamic vehicular networks are some of the main results.

关键词： VANET Quality of service priority algorithm Network performance Traffic analysis

来源：评论

学校读者我要写书评

暂无评论

Heuristic method for detailed scheduling of branched multiproduct pipeline networks

引用

CHEMICAL ENGINEERING RESEARCH & DESIGN 2018年 140卷 82-101页

作者： Liao, Qi Zhang, Haoran Wang, Yufei Zhang, Wan Liang, Yongtu China Univ Petr Beijing Key Lab Urban Oil & Gas Distribut Technol Fuxue Rd 18 Beijing 102249 Peoples R China Univ Tokyo Ctr Spatial Informat Sci 5-1-5 Kashiwanoha Kashiwa Chiba 2778568 Japan China Univ Petr State Key Lab Heavy Oil Proc Fuxue Rd 18 Beijing 102249 Peoples R China

This paper aims at the detailed scheduling of branched multiproduct pipeline networks with multiple sources and an output terminal. Nevertheless, the complexity of the pipeline structure, coupling of hydraulic and scheduling factors, impacts of physical properties of products, and simultaneous injections at different sources make it challenging to draw out the injection operations at each source. Based on a continuous-volume and discrete-time representation, this paper develops a MINLP model to find the optimal injection operations of all sources at minimum total operational cost, rigorously tracking batch migration and power consumption at each pipeline segment. A priority algorithm is presented to obtain a high quality solution of this large-scale and nonlinear scheduling problem. Finally, experimental results on two virtual pipeline networks and a real-world pipeline network in China are given to validate the proposed approach. (C) 2018 Institution of Chemical Engineers. Published by Elsevier B.V. All rights reserved.

关键词： Branched multiproduct pipeline networks Detailed scheduling MINLP model priority algorithm Simultaneous injections

来源：评论

学校读者我要写书评

暂无评论

Simple Approximation algorithms for Balanced MAX 2SAT

引用

algorithmICA 2018年第3期80卷 995-1012页

作者： Paul, Alice Poloczek, Matthias Williamson, David P. Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14850 USA

We study simple algorithms for the balanced MAX 2SAT problem, where we are given weighted clauses of length one and two with the property that for each variable x the total weight of clauses that x appears in equals the total weight of clauses for . We show that such instances have a simple structural property in that any optimal solution can satisfy at most the total weight of the clauses minus half the total weight of the unit clauses. Using this property and a novel analysis of the computation tree, we are able to show that a large class of greedy algorithms, including Johnson's algorithm, gives a -approximation algorithm for balanced MAX 2SAT;a similar statement is false for general MAX 2SAT instances. We further give a spectral 0.81-approximation algorithm for balanced MAX E2SAT instances (in which each clause has exactly 2 literals) by a reduction to a spectral algorithm of Trevisan for the maximum colored cut problem. We provide experimental results showing that this spectral algorithm performs well and is slightly better than Johnson's algorithm and the Goemans-Williamson semidefinite programming algorithm on balanced MAX E2SAT instances.

关键词： Maximum satisfiability Approximation algorithm Greedy algorithm Spectral algorithm Balanced instances priority algorithm

来源：评论

学校读者我要写书评

暂无评论

Simple Approximation algorithms for Balanced MAX 2SAT 12th

引用

12th Latin American Symposium on Theoretical Informatics (LATIN)

作者： Paul, Alice Poloczek, Matthias Williamson, David P. Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14850 USA

ISBN: (纸本)9783662495285

关键词： Maximum satisfiability Approximation algorithm Greedy algorithm Spectral algorithm Balanced instances priority algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Scheduling Mechanism For Hybrid Cloud Systems 9

A Novel Scheduling Mechanism For Hybrid Cloud Systems

引用

9th IEEE International Conference on Cloud Computing (CLOUD)

作者： Wei, Haoran Meng, Fanchao Univ Delaware Dept Comp & Informat Sci Newark DE 19716 USA

ISBN: (纸本)9781509026197

Large scale and complexity in structure are two major trends in current cloud environments. Bringing cloud computing to its full potential requires a paradigm shift toward cloud resiliency. A major challenge in designing resilient clouds is to avoid single point of failures in cloud management systems. The state-of-the-art cloud management systems are mostly designed by relying on centralized managing systems with complicated master nodes, which are prone to single point of failures. In this paper, we propose a novel resilient hybrid cloud management system to ensure offering consistent cloud services to users, which consists of two tiers: a peer-to-peer (P2P) tier and a centralized tier. In the centralized tier, each local cloud has a centralized management system, while these local clouds form a P2P cloud in the P2P tier. Our hybrid cloud system benefits from auto scaling across the entire system while it easily manages each local cloud. We propose an innovative user request scheduling mechanism, dedicated to our system, considering multi-objectives: minimizing user requests average makespan, while ensuring load balancing. Finally, we conduct extensive experiments to evaluate the performance of our proposed hybrid cloud management system.

关键词： hybrid cloud management system peer-to-peer scheduling mechanism load balancing priority algorithm

来源：评论

学校读者我要写书评

暂无评论

Threatened plants of arid ecosystems in the Mediterranean Basin: a case study of the south-eastern Iberian Peninsula

引用

ORYX 2014年第4期48卷 548-554页

作者： Mendoza-Fernandez, Antonio Perez-Garcia, Francisco J. Martinez-Hernandez, Fabian Medina-Cazorla, Jose M. Garrido-Becerra, Juan A. Merlo Calvente, Maria E. Guirado Romero, Jose S. Mota, Juan F. Univ Almeria Dept Biol & Geol Almeria 04120 Spain

Networks of protected areas are one of the main strategies used to address the biodiversity crisis. These should encompass as many species and ecosystems as possible, particularly in territories with high biological diversity, such as the Spanish arid zones. We produce a priority ranking of the arid zones of south-east Spain according to the rarity and richness of their characteristic flora and the level of endangerment. The resulting hierarchy shows that optimal zones for the preservation of the flora are located outside the network of protected areas. In particular, it is important to extend the network and encourage the creation of microreserves in the depression of the River Guadiana Menor (Granada), where there is least protection. This river valley is a particularly important arid site because of its unique flora and fauna, and palaeontological and archaeological findings.

关键词： Arid ecosystems flora Mediterranean Basin preservation priority algorithm threatened plants

来源：评论

学校读者我要写书评

暂无评论

Access Control Engine with Dynamic priority Resource Allocation for Cognitive Radio Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2013年第2期68卷 473-487页

作者： Jiang, Ching-Huei Weng, Ro-Min Natl Dong Hwa Univ Dept Elect Engn Hualien 97401 Taiwan

An access control engine with dynamic priority resource allocation (ACE-DPRA) is proposed for unlicensed users to utilize free spectrum of wireless communication systems. A cognitive radio (CR) network with sensing and learning abilities is essential for unlicensed users to achieve ACE-DPRA. Three algorithms are included in ACE-DPRA to improve the spectral efficiency. While requesting to set up connection, unlicensed CR users generate excessive interferences to licensed users. The proposed ACE-DPRA with an admission control scheme allows the connection of unlicensed CR users without degrading the communication quality of licensed users. The priority algorithm for utilizing the unused spectrum is designed according to the location information of unlicensed users. A transmitted power control method is achieved by a fuzzy-learning mechanism. The spectral efficiency of wireless communication systems can be increased after adopting the proposed ACE-DPRA algorithm. Simulation results show that licensed users keep the advantages of high transmission data rate, low interference power, and low average outage probability after the connection of unlicensed CR users.

关键词： Cognitive radio Resource allocation Fuzzy-learning algorithm Access control priority algorithm

来源：评论

学校读者我要写书评

暂无评论

Gap Analysis and selection of reserves for the threatened flora of eastern Andalusia, a hot spot in the eastern Mediterranean region

引用

ACTA BOTANICA GALLICA 2010年第4期157卷 749-767页

作者： Mendoza-Fernandez, Antonio Javier Perez-Garcia, Francisco Miguel Medina-Cazorla, Jose Martinez-Hernandez, Fabian Antonio Garrido-Becerra, Juan Salmeron Sanchez, Esteban Francisco Mota, Juan Univ Almeria Dept Plant Biol & Ecol E-04120 Almeria Spain

The Betic ranges are recognised as one of the hot spots of biodiversity in the Mediterranean region. The greater part of this territory is in Andalusia and is very rich in vascular plants, some of them endemic. The territory exhibits enormous orographical and geological complexity. This is, in short, a mosaic, fragmented landscape with extremely high beta-diversity. This scenario is ideal for monitoring the efficiency of reserve areas. The main aim of this research is to see whether the Network of Natural Protected Areas of Andalusia, extended with the SCIs, is sufficient to safeguard the plant biodiversity, represented in this case by the threatened vascular flora. The analysis includes also the areas corresponding to the priority habitats as defined in the Directive 92/43/EEC. Considering that the presence of priority habitats was a guideline in the drafting of the SCIs, this last inclusion is logical. The results reveal that SCIs are the most efficient strategy for the preservation of the flora, although almost 30% of the flora occur outside these sites. By contrast, the areas with priority habitats failed to cover over 70% of the threatened flora.

关键词： priority algorithm preservation flora priority habitats

来源：评论

学校读者我要写书评

暂无评论

priority algorithms for the subset-sum problem

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2008年第3期16卷 198-228页

作者： Ye, Yuli Borodin, Allan Univ Toronto Dept Comp Sci Toronto ON M5S 3G4 Canada

Greedy algorithms are simple, but their relative power is not well understood. The priority framework (Borodin et al. in algorithmica 37:295-326, 2003) captures a key notion of "greediness" in the sense that it processes (in some locally optimal manner) one data item at a time, depending on and only on the current knowledge of the input. This algorithmic model provides a tool to assess the computational power and limitations of greedy algorithms, especially in terms of their approximability. In this paper, we study priority algorithm approximation ratios for the Subset-Sum Problem, focusing on the power of revocable decisions, for which the accepted data items can be later rejected to maintain the feasibility of the solution. We first provide a tight bound of alpha approximate to 0.657 for irrevocable priority algorithms. We then show that the approximation ratio of fixed order revocable priority algorithms is between beta approximate to 0.780 and gamma approximate to 0.852, and the ratio of adaptive order revocable priority algorithms is between 0.8 and delta approximate to 0.893.

关键词： greedy priority algorithm subset-sum approximation algorithm revocable acceptance

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：