期刊文献+
共找到10篇文章
< 1 >
每页显示 20 50 100
Cooperative Approach between ISP and P2P Users to Reduce Inter-AS Traffic
1
作者 Zhen Qin,Le-Min Li,the School of Communication and Information Engineering,University of Electronic Science and Technology of China,Chengdu 610054,China.Fan Zhou,the School of Computer Science and Engineering,University of Electronic Science and Technology of China,Chengdu610054,China 《Journal of Electronic Science and Technology》 CAS 2012年第1期47-50,共4页
A peer-to-peer (P2P) network is a distributed application architecture which provides many attractive features, such as availability, self-organization, load-balancing, and anonymity. However, P2P network has create... A peer-to-peer (P2P) network is a distributed application architecture which provides many attractive features, such as availability, self-organization, load-balancing, and anonymity. However, P2P network has created significant problems to network operators by generating large volumes of inter autonomous system (inter-AS) traffic. Focusing on the BitTorrent swarming protocol, this paper proposes an approach which aims to reduce P2P generated inter-AS traffic. In particular, the approach can reduce inter-AS traffic by 50% to 70%. Moreover, it can improve the downloading speed by 60% for the popular torrents. The evaluation shows that controlled regional-based contents replication can effectively achieve this goal. Furthermore, the approach is incrementally deployable. Network regions in which the system gets deployed can solve their P2P generated inter-AS traffic problems autonomously, i.e., without any Internet service providers-collaboration and any requirement, the system can be deployed in the entire Internet. 展开更多
关键词 BITTORRENT contents replication inter-AS traffic peer-to-peer.
下载PDF
基于累积前景理论的动态交通流演化博弈模型 被引量:12
2
作者 张波 隽志才 倪安宁 《管理工程学报》 CSSCI 北大核心 2014年第3期164-173,共10页
交通流演化的内在动力机制是出行者的适应性学习及其诱发的路径选择行为的持续改变,当选择行为趋于稳定时交通系统也将达到或接近均衡状态。首先基于累积前景理论建立了一个用户均衡模型及其等价的变分不等式,在一定约束条件下对模型解... 交通流演化的内在动力机制是出行者的适应性学习及其诱发的路径选择行为的持续改变,当选择行为趋于稳定时交通系统也将达到或接近均衡状态。首先基于累积前景理论建立了一个用户均衡模型及其等价的变分不等式,在一定约束条件下对模型解的性质进行了讨论;然后将累积前景理论与演化博弈论相结合,利用复制子动态来刻画出行者日常路径选择的博弈学习行为,建立了一个动态交通系统模型,结合稳定性分析证明了当满足一定条件时系统演化能够实现用户均衡;最后通过算例在不同初始状态和不同参照点更新规则下分别展示了交通流的动态演化与用户均衡的实现过程,对相关研究结论进行了验证。本文拓展了传统交通分配模型完全理性假设和均衡分析方法的局限,更加真实、全面的刻画了动态交通系统长期运行特征和规律。 展开更多
关键词 动态交通系统 累积前景理论 复制子动态 用户均衡
下载PDF
基于演化博弈的政府鼓励条件下共享停车行为分析 被引量:5
3
作者 贾富强 李引珍 +2 位作者 杨信丰 马昌喜 代存杰 《交通运输系统工程与信息》 EI CSCD 北大核心 2022年第1期163-170,共8页
为研究在政府鼓励措施下出行者和车位拥有者参与共享停车时的策略对共享停车匹配结果的影响,建立出行者和车位拥有者演化博弈模型并进行演化稳定状态分析,结合仿真说明不同收益和成本及策略选择对共享停车的影响。研究结果表明:在政府... 为研究在政府鼓励措施下出行者和车位拥有者参与共享停车时的策略对共享停车匹配结果的影响,建立出行者和车位拥有者演化博弈模型并进行演化稳定状态分析,结合仿真说明不同收益和成本及策略选择对共享停车的影响。研究结果表明:在政府鼓励措施下双方演化博弈中出行者和车位拥有者均能通过不断学习最终演化至稳定均衡状态,但演化速率和演化波动性受双方收益制约;通过分析发现,想要演化至(使用,共享)状态则需要较高初始比例,可以通过提高收益和减少成本等措施诱导出行者和车位拥有者使用共享停车,同时在初始比例较高时收益分配比例对演化过程也有较大影响。研究发现,当共享平台给出合理收益和支出费用时,政府鼓励政策对共享停车发展起促进作用。 展开更多
关键词 城市交通 共享停车 演化博弈 复制者动态 演化稳定性
下载PDF
基于演化博弈的港口竞合策略选择及仿真研究 被引量:9
4
作者 赖成寿 吕靖 +1 位作者 李慧 高天航 《重庆交通大学学报(自然科学版)》 CAS 北大核心 2018年第11期112-118,共7页
基于有限理性、不完全信息假设,运用竞合博弈和演化博弈理论探究港口竞合行为策略选择的内在机理和长期演变规律。构建了港口竞合博弈双层规划模型,运用shapely值对合作联盟的收益进行分配;引入"收益分配系数"、"合作成... 基于有限理性、不完全信息假设,运用竞合博弈和演化博弈理论探究港口竞合行为策略选择的内在机理和长期演变规律。构建了港口竞合博弈双层规划模型,运用shapely值对合作联盟的收益进行分配;引入"收益分配系数"、"合作成本"、"违约增量收益"、"违约补偿金"等参数构造港口博弈非对称得益矩阵,在此基础上建立演化博弈模型,对港口演化博弈均衡点的稳定性进行分析,并通过MATLAB R2010b对港口竞合演化路径的进行仿真。研究结论表明:演化稳定均衡点以及演化路径受初始状态选择、"合作收益增量"、"收益分配系数"、"合作成本"、"违约收益"、"违约补偿金"等参数影响。最后,针对演化影响参数提出使双方合作成为唯一进化稳定均衡的措施建议,确保港口协作发展。 展开更多
关键词 交通运输工程 竞合博弈 演化博弈 复制动态 演化稳定策略 仿真
下载PDF
演化博弈下单点信号灯配时优化研究 被引量:2
5
作者 李建明 余春艳 《交通运输系统工程与信息》 EI CSCD 北大核心 2012年第4期72-78,共7页
针对单路口交通流运行的高度复杂性和随机性,本文通过引入演化博弈理论和选择机制,以路口车辆平均延误时长最小为目标,提出了一种新的信号灯控制算法——基于演化博弈的单路口信号灯配时优化控制(EGSTOA).为了评估方法的有效性,在VISSI... 针对单路口交通流运行的高度复杂性和随机性,本文通过引入演化博弈理论和选择机制,以路口车辆平均延误时长最小为目标,提出了一种新的信号灯控制算法——基于演化博弈的单路口信号灯配时优化控制(EGSTOA).为了评估方法的有效性,在VISSIM仿真软件中进行实验,并将该方法的控制效果与优化定时控制和基于遗传算法的控制效果进行比较.对比结果表明,使用EGSTOA方法有效降低了路口车辆平均延迟时长,改善了路口的控制效果. 展开更多
关键词 城市交通 信号灯配时 演化博弈模型 复制者动态 车辆平均延误
下载PDF
Correction to: Replication of LZTFL1 Gene Region as a Susceptibility Locus for COVID-19 in Latvian Population
6
作者 Raimonds Rescenko Raitis Peculis +10 位作者 Monta Briviba Laura Ansone Anna Terentjeva Helena Daiga Litvina Liga Birzniece Kaspars Megnis Oksana Kolesova Baiba Rozentale Ludmila Viksna Vita Rovite Janis Klovins 《Virologica Sinica》 SCIE CAS CSCD 2021年第6期1692-1692,共1页
Correction to:Virologica Sinica https://doi.org/10.1007/s12250-021-00448-x Due to our oversight,the author list of reference“Promchan K.Natarajan V.Kanzaki M(2020)Leucine zipper transcription factor-like I binds adap... Correction to:Virologica Sinica https://doi.org/10.1007/s12250-021-00448-x Due to our oversight,the author list of reference“Promchan K.Natarajan V.Kanzaki M(2020)Leucine zipper transcription factor-like I binds adaptor protein complex-1 and 2 and participates in trafficking of transfcirin receptor 1.PLoS One 15:e0226298”was incorrectly displayed. 展开更多
关键词 replication LZTFL1 traffic
原文传递
RMCARTAM For DDoS Attack Mitigation in SDN Using Machine Learning
7
作者 M.Revathi V.V.Ramalingam B.Amutha 《Computer Systems Science & Engineering》 SCIE EI 2023年第6期3023-3036,共14页
The impact of a Distributed Denial of Service(DDoS)attack on Soft-ware Defined Networks(SDN)is briefly analyzed.Many approaches to detecting DDoS attacks exist,varying on the feature being considered and the method us... The impact of a Distributed Denial of Service(DDoS)attack on Soft-ware Defined Networks(SDN)is briefly analyzed.Many approaches to detecting DDoS attacks exist,varying on the feature being considered and the method used.Still,the methods have a deficiency in the performance of detecting DDoS attacks and mitigating them.To improve the performance of SDN,an efficient Real-time Multi-Constrained Adaptive Replication and Traffic Approximation Model(RMCARTAM)is sketched in this article.The RMCARTAM considers different parameters or constraints in running different controllers responsible for handling incoming packets.The model is designed with multiple controllers to handle net-work traffic but can turn the controllers according to requirements.The multi-con-straint adaptive replication model monitors different features of network traffic like rate of packet reception,class-based packet reception and target-specific reception.According to these features,the method estimates the Replication Turn-ing Weight(RTW)based on which triggering controllers are performed.Similarly,the method applies Traffic Approximation(TA)in the detection of DDoS attacks.The detection of a DDoS attack is performed by approximating the incoming traf-fic to any service and using various features like hop count,payload,service fre-quency,and malformed frequency to compute various support measures on bandwidth access,data support,frequency support,malformed support,route sup-port,and so on.Using all these support measures,the method computes the value of legitimate weight to conclude the behavior of any source in identifying the mal-icious node.Identified node details are used in the mitigation of DDoS attacks.The method stimulates the network performance by reducing the power factor by switching the controller according to different factors,which also reduces the cost.In the same way,the proposed model improves the accuracy of detecting DDoS attacks by estimating the features of incoming traffic in different corners. 展开更多
关键词 DDOS SDN traffic approximation adaptive replication MULTI-CONTROLLER support measures RTW
下载PDF
进程间一对多流量复制机制设计与实现 被引量:1
8
作者 储苏红 刘磊 《网络新媒体技术》 2022年第6期29-34,65,共7页
网络审计系统作为保障网络安全的重要工具,通过对网络流量进行采集分析,能够实时监测网络行为。为了便于集成多种网络流量在线分析工具,网络审计系统需将网络流量复制给多个流量分析进程。本文基于共享内存和无锁环形队列实现了一对多... 网络审计系统作为保障网络安全的重要工具,通过对网络流量进行采集分析,能够实时监测网络行为。为了便于集成多种网络流量在线分析工具,网络审计系统需将网络流量复制给多个流量分析进程。本文基于共享内存和无锁环形队列实现了一对多的进程间流量复制,多个进程共享DPDK内存池,采集进程为每个分析进程创建一个无锁环形队列用以流量复制。分别使用1024 B和64 B数据包进行吞吐和每秒包数测试,通过实验对比分析,此方法性能明显优于内存拷贝和有锁机制,在加载8个分析进程时,其吞吐性能相较于内存拷贝和有锁机制至少提高了26%,每秒包数性能至少提高了19%。 展开更多
关键词 网络审计系统 进程间流量复制 共享内存 无锁环形队列 DPDK技术
下载PDF
雷达终端自动化系统瞬断故障分析与排除
9
作者 王鸿燕 《科技广场》 2011年第3期49-51,共3页
本文针对洛克西德马丁雷达终端自动化处理系统在运行中出现的一例较为复杂的系统瞬断故障进行深入分析研究,并在分析研究的基础上改造了原系统的网络传输结构,成功地解决了此问题。
关键词 雷达终端自动化处理 ORACLE数据库 网络拓扑 网络流量分析 高级复制
下载PDF
A Cost-Efficient Approach to Storing Users'Data for Online Social Networks
10
作者 Jing-Ya Zhou Jian-Xi Fan +1 位作者 Cheng-Kuan Lin Bao-Lei Cheng 《Journal of Computer Science & Technology》 SCIE EI CSCD 2019年第1期234-252,共19页
As users increasingly befriend others and interact online via their social media accounts,online social networks (OSNs)are expanding rapidly.Confronted with the big data generated by users,it is imperative that data s... As users increasingly befriend others and interact online via their social media accounts,online social networks (OSNs)are expanding rapidly.Confronted with the big data generated by users,it is imperative that data storage be distributed,scalable,and cost-efficient.Yet one of the most significant challenges about this topic is determining how to minimize the cost without deteriorating system performance.Although many storage systems use the distributed key value store,it cannot be directly applied to OSN storage systems.And because users'data are highly correlated,hash storage leads to frequent inter-server communications,and the high inter-server traffic costs decrease the OSN storage system's scalability. Previous studies proposed conducting network partitioning and data replication based on social graphs.However,data replication increases storage costs and impacts traffic costs.Here,we consider how to minimize costs from the perspective of data storage,by combining partitioning and replication.Our cost-efficient data storage approach supports scalable OSN storage systems.The proposed approach co-locates frequently interactive users together by conducting partitioning and replication simultaneously while meeting load-balancing constraints.Extensive experiments are undertaken on two real- world traces,and the results show that our approach achieves lower cost compared with state-of-the-art approaches.Thus we conclude that our approach enables economic and scalable OSN data storage. 展开更多
关键词 online SOCIAL NETWORK inter-server traffic COST storage COST NETWORK partitioning DATA replication
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部