期刊文献+
共找到8篇文章
< 1 >
每页显示 20 50 100
城市交通拥堵及治堵政策刍议 被引量:7
1
作者 丘银英 唐立波 《城市交通》 2012年第2期40-45,91,共7页
交通拥堵已日渐成为中国各大城市的普遍问题,正确认识其发生和发展规律有利于提高治堵政策绩效。首先阐述了交通拥堵的定义、分类和发展特性。然后,将常用治堵政策分为减少交通生成总量、改变出行时空分布、影响出行方式选择、实施交通... 交通拥堵已日渐成为中国各大城市的普遍问题,正确认识其发生和发展规律有利于提高治堵政策绩效。首先阐述了交通拥堵的定义、分类和发展特性。然后,将常用治堵政策分为减少交通生成总量、改变出行时空分布、影响出行方式选择、实施交通设施科学扩容四大类、26小类,针对治堵政策制定过程中的关键问题展开分析研究。最后,提出采用政策分析方法对各项治堵政策的正、负效应进行预判,从社会、环境、经济影响和交通改善效果角度剖析治堵政策绩效,从而避免决策武断,实现整体交通改善和效益最大化。 展开更多
关键词 交通政策 交通拥堵 治堵政策 绩效评价
在线阅读 下载PDF
基于Fuzzy丢包区分的TCP拥塞控制算法
2
作者 李哲青 王伟 张潇 《计算机工程》 CAS CSCD 2013年第7期123-126,132,共5页
针对传统传输控制协议(TCP)应用于异构网络的局限性,在研究灰色关联度基础上,分析网络参数,提出一种基于往返延迟抖动积区分丢包的TCP-N算法。根据测得的往返延迟抖动积构建隶属函数,区分无线误码丢包和网络拥塞丢包,并依据隶属度进行... 针对传统传输控制协议(TCP)应用于异构网络的局限性,在研究灰色关联度基础上,分析网络参数,提出一种基于往返延迟抖动积区分丢包的TCP-N算法。根据测得的往返延迟抖动积构建隶属函数,区分无线误码丢包和网络拥塞丢包,并依据隶属度进行相应的拥塞控制。仿真实验结果表明,与传统TCP协议相比,TCP-N算法在异构网络中能够较准确地区分无线误码丢包和网络拥塞丢包,提高带宽利用率和吞吐量。 展开更多
关键词 异构网络 灰色关联度 往返延迟抖动积 Fuzzy丢包区分 拥塞控制 传输控制协议
在线阅读 下载PDF
Fair Data Collection Scheme in Wireless Sensor Networks
3
作者 庞辽军 李慧贤 +2 位作者 裴庆棋 刘能宾 王育民 《China Communications》 SCIE CSCD 2013年第2期112-120,共9页
To solve the slow congestion detection and rate convergence problems in the existing rate control based fair data collection schemes, a new fair data collection scheme is proposed, which is named the improved scheme w... To solve the slow congestion detection and rate convergence problems in the existing rate control based fair data collection schemes, a new fair data collection scheme is proposed, which is named the improved scheme with fairness or ISWF for short. In ISWF, a quick congestion detection method, which combines the queue length with traffic changes of a node, is used to solve the slow congestion detection problem, and a new solution, which adjusts the rate of sending data of a node by monitoring the channel utilization rate, is used to solve the slow convergence problem. At the same time, the probability selection method is used in ISWF to achieve the fairness of channel bandwidth utilization. Experiment and simulation results show that ISWF can effectively reduce the reaction time in detecting congestion and shorten the rate convergence process. Compared with the existing tree-based fair data collection schemes, ISWF can achieve better fairness in data collection and reduce the transmission delay effectively, and at the same time, it can increase the average network throughput by 9.1% or more. 展开更多
关键词 wireless sensor networks con-gestion detection rate control probabilityselection FAIRNESS
在线阅读 下载PDF
Analyzing Li-Fi Communication Benefits Compared to Wi-Fi
4
作者 Phillip Yarbrough Tyler Welker +3 位作者 Damian Silva Rafia Islam Vishnu Vardhan Patamsetti Olatunde Abiona 《International Journal of Communications, Network and System Sciences》 2022年第6期67-77,共11页
Li-Fi, or known as light fidelity, is a new technology that could alleviate some network congestion for the ever-increasing internet of things (IOT). The patent for Li-Fi was created by German physicist Harald Haas in... Li-Fi, or known as light fidelity, is a new technology that could alleviate some network congestion for the ever-increasing internet of things (IOT). The patent for Li-Fi was created by German physicist Harald Haas in 2011 around visible light communication. The purpose of the following research includes the capabilities of Li-Fi Technologies and how the implementation of a Li-Fi network can improve network infrastructure. A main point is to highlight the advantages that Li-Fi technology brings to the table in comparison to traditional Wi-Fi networks like the increased bandwidth frequency, faster transmission speeds, as well as not being affected by network latency due to high traffic. Benefits that Li-Fi technologies provide to network infrastructure include the use of less energy, the need for fewer components to operate, as well as the simplicity of only needing a light source to provide high-speed internet traffic. Some of our research shows the implementation of these systems and how they can provide different benefits to different types of needs of the consumer. The research gave a complete idea about hybrid indoor systems based on Li-Fi and Wi-Fi that indicates how Li-Fi technology raises the possibilities to fulfill the technological demand in the future. Also, the part explained the security concerns of Li-Fi technology and we can consider this technology secure by updating some system protocols. At present day, Li-Fi lacks the infrastructure that Wi-Fi has, which makes replacement unideal. Rather, Li-Fi can be seen as complementary to Wi-Fi and used to improve current technology. 展开更多
关键词 Next Generation Data Transmission Light Fidelity IEEE LED Network con-gestion
在线阅读 下载PDF
淤血预处理减轻兔肝门静脉阻断模型中肠道淤血-再灌注损伤 被引量:2
5
作者 赵霜艳 陈文栋 +1 位作者 成黎明 马莉 《临床麻醉学杂志》 CAS CSCD 北大核心 2020年第10期1018-1022,共5页
目的观察淤血预处理对兔肝门静脉阻断模型中肠道淤血-再灌注引起的肠道损伤和肝脏损伤的影响。方法选取雄性日本大耳兔75只,体重2.5~5.0 kg,随机分为五组:假手术组(S组)、淤血-再灌注组(OC组)、预处理A组(OC5组)、预处理B组(OC10组)、... 目的观察淤血预处理对兔肝门静脉阻断模型中肠道淤血-再灌注引起的肠道损伤和肝脏损伤的影响。方法选取雄性日本大耳兔75只,体重2.5~5.0 kg,随机分为五组:假手术组(S组)、淤血-再灌注组(OC组)、预处理A组(OC5组)、预处理B组(OC10组)、预处理C组(OC15组),每组15只。S组仅行剖腹手术暴露第一肝门30 min,OC组进行门静脉阻断30 min后开放门静脉。三个预处理组门静脉操作分别为OC5组夹闭5 min,开放5 min;OC10组夹闭10 min,开放10 min;OC15组夹闭15 min,开放15 min,随后阻断门静脉30 min后开放。术后2、8、24 h通过门静脉取血,检测血清中丙二醛(MDA)含量和内毒素、肿瘤坏死因子-α(TNF-α)、丙氨酸转氨酶(ALT)浓度。术后24 h血液样本采集完毕后,再次麻醉并处死以获取回肠末端肠黏膜及肝组织,显微镜下观察病理形态学结构改变。结果与S组比较,术后2、8、24 h OC组、OC5组、OC10组和OC15组血清MDA含量、内毒素、TNF-α、ALT浓度明显升高(P<0.05)。与OC组比较,术后2、8、24 h OC5组、OC10组和OC15组血清MDA含量、内毒素、TNF-α、ALT浓度明显降低(P<0.05)。与OC5组比较,术后2、8、24 h OC10组血清MDA含量、TNF-α、ALT浓度明显降低(P<0.05)。与OC5组比较,术后2、8 h OC10组血清内毒素浓度明显降低(P<0.05)。与OC10组比较,术后8 h OC15组血清MDA含量、ALT浓度明显升高(P<0.05)。与S组比较,OC组、OC5组、OC10组和OC15组肠黏膜损伤Chiu评分明显升高(P<0.05)。与OC组比较,OC5组、OC10组和OC15组黏膜损伤Chiu评分明显降低(P<0.05)。与OC5组比较,OC10组、OC15组的肠黏膜损伤Chiu评分明显降低(P<0.05)。结论淤血预处理可以减轻由于肝门静脉阻断导致的肠道淤血-再灌注损伤,减轻内毒素血症、过度炎性反应及氧自由基对肝脏的损伤。 展开更多
关键词 肝脏 门静脉阻断 肠道 淤血-再灌注损伤 淤血预处理
暂未订购
一种支持区分服务的主动队列管理算法
6
作者 曹振臻 肖扬 《铁道学报》 EI CAS CSCD 北大核心 2008年第4期32-38,共7页
为区分服务网络的核心路由器,提出一种主动队列管理算法,它基于一种名为预估计随机早期检测PERED(Pre-estimation RED)的自适应随机早期检测算法(RED),因此称这种支持区分服务的主动队列管理算法为区分服务预估计随机早期检DSPERED(Diff... 为区分服务网络的核心路由器,提出一种主动队列管理算法,它基于一种名为预估计随机早期检测PERED(Pre-estimation RED)的自适应随机早期检测算法(RED),因此称这种支持区分服务的主动队列管理算法为区分服务预估计随机早期检DSPERED(DiffServ PERED)。首先DSPERED利用PERED算法中的一个离散时间队列长度的Markov模型来估计短时期后路由器缓冲区的队列状态,然后根据估计结果和服务的优先级调节不同服务的数据包最大丢包概率以实现对服务的区分。本文提出一种拥塞控制的思路,即预估计以及一种区分服务的方法,其使用不同的函数调节不同优先级服务的数据包最大丢包概率。通过使用DSPERED算法的模拟路由器对两种不同优先级服务的数据包处理的比较,验证该算法的性能。 展开更多
关键词 服务质量 主动队列管理 MARKOV模型 区分服务 拥塞控制
在线阅读 下载PDF
XGRouter: high-quality global router in X-architecture with particle swarm optimization 被引量:2
7
作者 Genggeng LIU Wenzhong GUO +2 位作者 Rongrong LI Yuzhen NIU Guolong CHEN 《Frontiers of Computer Science》 SCIE EI CSCD 2015年第4期576-594,共19页
This paper presents a high-quality very large scale integration (VLSI) global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming (ILP) techniques, partition strategy and... This paper presents a high-quality very large scale integration (VLSI) global router in X-architecture, called XGRouter, that heavily relies on integer linear pro- gramming (ILP) techniques, partition strategy and particle swarm optimization (PSO). A new ILP formulation, which can achieve more uniform routing solution than other formu- lations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing re- gion is extended progressively from the most congested re- git)n. In the post-processing stage of XGRouter, maze rout- ing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global rout- ing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global touters, XGRouter has no overflow. 展开更多
关键词 global routing OVERFLOW total wire length con-gestion uniformity X-architecture particle swarm optimiza-tion integer linear programming
原文传递
TCP-ACC: performance and analysis of an active congestion control algorithm for heterogeneous networks 被引量:1
8
作者 Jun ZHANG Jiangtao WEN Yuxing HAN 《Frontiers of Computer Science》 SCIE EI CSCD 2017年第6期1061-1074,共14页
Transmission control protocol (TCP) is a reli- able transport layer protocol widely used in the Internet over decades. However, the performances of existing TCP conges- tion control algorithms degrade severely in mo... Transmission control protocol (TCP) is a reli- able transport layer protocol widely used in the Internet over decades. However, the performances of existing TCP conges- tion control algorithms degrade severely in modern heteroge- neous networks with random packet losses, packet reordering and congestion. In this paper, we propose a novel TCP algo- rithm named TCP-ACC to handle all three challenges men- tioned above. It integrates 1) a real-time reorder metric for calculating the probabilities of unnecessary Fast Retransmit (FRetran) and Timeouts (TO), 2) an improved RTT estima- tion algorithm giving more weights to packets that are sent (as opposed to received) more recently, and 3) an improved congestion control mechanism based on packet loss and re- order rate measurements. Theoretical analysis demonstrates the equilibrium throughput of TCP-ACC is much higher than traditional TCP, while maintaining good fairness with regard to other TCP algorithms in ideal network conditions. Ex- tensive experimental results using both network emulators and real network show that the algorithm achieves signifi- cant throughput improvement in heterogeneous networks as compared with other state-of-the-art algorithms. 展开更多
关键词 TCP packet reordering wireless networks con-gestion control
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部