首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   471篇
  免费   101篇
  国内免费   10篇
化学   6篇
力学   2篇
综合类   5篇
数学   57篇
物理学   39篇
无线电   473篇
  2024年   1篇
  2023年   3篇
  2022年   3篇
  2021年   5篇
  2020年   11篇
  2019年   15篇
  2018年   8篇
  2017年   6篇
  2016年   21篇
  2015年   15篇
  2014年   54篇
  2013年   35篇
  2012年   27篇
  2011年   44篇
  2010年   19篇
  2009年   37篇
  2008年   20篇
  2007年   27篇
  2006年   28篇
  2005年   29篇
  2004年   32篇
  2003年   37篇
  2002年   28篇
  2001年   18篇
  2000年   8篇
  1999年   5篇
  1998年   11篇
  1997年   10篇
  1996年   4篇
  1995年   10篇
  1994年   3篇
  1993年   1篇
  1991年   1篇
  1989年   2篇
  1987年   1篇
  1985年   2篇
  1984年   1篇
排序方式: 共有582条查询结果,搜索用时 15 毫秒
91.
ABSTRACT

This article describes an experimental investigation on the behavior of transmission control protocol in throughput measurements to be used in the verification of the service-level agreement between the Internet service provider and user in terms of line capacity for ultra-broadband access networks typical of fiber-to-the-x architectures. It is experimentally shown different conditions in high bandwidth-delay product links where the estimation of the line capacity based on a single transmission control protocol session results are unreliable. Simple equations reported in this work, and experimentally verified, point out the conditions in terms of packet loss, time delay, and line capacity, that allow consideration of the reliability of the measurement carried out with a single transmission control protocol session test by adopting a suitable measurement time duration.  相似文献   
92.
文章针对一种简单的拥塞控制模型,分析了拥塞控制的缓存性能,得到了精确的缓存空间B和阈值θ。指出拥塞控制运行机制缓存过大的原因,给出了合理的拥塞控制运行机制的缓存性能的分析。仿真结果验证了分析的正确性。  相似文献   
93.
可编程网络体系   总被引:1,自引:0,他引:1  
可编程网络通过将程序嵌入数据包,对网络节点编程,使网络体系适应用户的需求。可编程网络拓广了端到端原则的含义,形成新的网络概念,本文提出了可编程网络的体系结构,设计原则及应用方法,使网络在保持安全,高效的前提下具备更高的质量。  相似文献   
94.
TCP over ATM的拥塞控制研究进展   总被引:3,自引:0,他引:3  
指出了TCP/IP在ATM网络中运用遇到的困难,综述了TCP拥塞控制方案与ATM层拥塞控制策略的进展,概述了TCPoverATM研究的现状,指出了为的工作方向。  相似文献   
95.
Asychronous transfer mode (ATM) networks are high‐speed networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of physical bandwidth. Unlike constant bit‐rate (CBR) traffic, the bandwidth reserved by variable bit‐rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit‐rate (ABR) traffic. As the bandwidth used by VBR traffic changes, available bandwidth for ABR traffic varies; i.e., available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate‐based congestion control algorithm, Explicit Allowed Rate Algorithm (EARA), is presented in this paper. EARA is compared with Proportional Rate Control Algorithm (PRCA) and Explicit Rate Indication Congestion Avoidance Algorithm (ERICA), in both LAN and WAN environments. Simulations of all three algorithms are conducted under both congestion and fairness configurations with simultaneous generation of CBR, rt‐VBR, nrt‐VBR and ABR traffic. The results show that, with very small over‐head on the switch, EARA significantly decreases the required buffer space and improves the network throughput. Copyright © 1999 John Wiley & Sons, Ltd.  相似文献   
96.
复杂网络的一种加权路由策略研究   总被引:2,自引:0,他引:2       下载免费PDF全文
复杂网络的传输能力是其功能正常运转的重要保障,提高网络的吞吐量有着重要意义.提出一种新的高效路由策略,以提高复杂网络的传输能力,称之为加权路由策略.即对网络的每一条边加权,权值与该边的两端节点的度相关,然后数据包按照这个加权网络的最短路径路由.这样的路径可以更均匀地经过各个节点,发挥它们的传输能力,极大地提高网络的吞吐量.可以避免数据包集中地通过个别度大的节点,在这些节点发生拥塞.仿真显示,该策略比传统的最短路径策略优越,对很多结构的网络,可以提高几十倍的吞吐量. 关键词: 复杂网络 路由策略 吞吐量 拥塞  相似文献   
97.
An event‐to‐sink reliable transport (ESRT) control scheme was recently proposed to address the event‐to‐sink reliability issues in wireless sensor network (WSN). In this paper, we study the performance of ESRT in the presence of ‘over‐demanding’ event reliability, using both the analytical and simulation approaches. We show that the ESRT protocol does not achieve optimum reliability and begins to fluctuate between two inefficient network states. With insights from update mechanism in ESRT, we propose a new algorithm, called enhanced ESRT (E2SRT), to solve the ‘over‐demanding’ event reliability problem and to stabilize the network. Simulation results show that E2SRT outperforms ESRT in terms of both reliability and energy consumption in the presence of ‘over‐demanding’ event reliability. Besides, it ensures robust convergence in the presence of dynamic network environments. Copyright © 2008 John Wiley & Sons, Ltd.  相似文献   
98.
In ad hoc networks, the spatial reuse property limits the number of packets which can be spatially transmitted over a path. In standard Transmission Control Protocol (TCP), however, a TCP sender keeps transmitting packets without taking into account this property. This causes heavy contention for the wireless channel, resulting in the performance degradation of TCP flows. Hence, two techniques have been proposed independently in order to reduce the contention. First, a TCP sender utilizes a congestion window limit (CWL), by considering the spatial reuse property. This prevents the TCP sender from transmitting more than CWL number of packets at one time. Second, a delayed ack (DA) strategy is exploited in order to mitigate the contention between the TCP ACK and DATA packets. Recently, although TCP‐DAA (Dynamic Adaptive Acknowledgment) attempts to utilize a CWL‐based DA strategy, TCP‐DAA overlooks a dynamic correlation between these two techniques. This paper, therefore, reveals the dynamic correlation and also proposes a protocol which not only reduces the frequency of the TCP ACK transmissions but also determines a CWL value dynamically, according to network conditions. Simulation studies show that our protocol performs the best in various scenarios, as compared to TCP‐DAA and standard TCP (such as TCP‐NewReno). Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   
99.
Time delay is an important parameter in the problem of internet congestion control. According to some researches, time delay is not always constant and can be viewed as a periodic function of time for some cases. In this work, an internet congestion control model is considered to study the time-varying delay induced bursting-like motion, which consists of a rapid oscillation burst and quiescent steady state. Then, for the system with periodic delay of small amplitude and low frequency, the method of multiple scales is employed to obtain the amplitude of the oscillation. Based on the expression of the asymptotic solution, it can be found that the relative length of the steady state increases with amplitude of the variation of time delay and decreases with frequency of the variation of time delay. Finally, an effective method to control the bursting-like motion is proposed by introducing a periodic gain parameter with appropriate amplitude. Theoretical results are in agreement with that from numerical method.  相似文献   
100.
This paper studies how to generate the reasonable information of travelers' decision in real network. This problem is very complex because the travelers' decision is constrained by different human behavior. The network conditions can be predicted by using the advanced dynamic OD(Origin-Destination, OD) estimation techniques. Based on the improved mesoscopic traffic model, the predictable dynamic traffic guidance information can be obtained accurately.A consistency algorithm is designed to investigate the travelers' decision by simulating the dynamic response to guidance information. The simulation results show that the proposed method can provide the best guidance information. Further,a case study is conducted to verify the theoretical results and to draw managerial insights into the potential of dynamic guidance strategy in improving traffic performance.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号