首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   445篇
  国内免费   17篇
  完全免费   184篇
工业技术   646篇
  2018年   3篇
  2017年   8篇
  2016年   18篇
  2015年   20篇
  2014年   49篇
  2013年   40篇
  2012年   77篇
  2011年   64篇
  2010年   46篇
  2009年   59篇
  2008年   51篇
  2007年   51篇
  2006年   40篇
  2005年   30篇
  2004年   30篇
  2003年   20篇
  2002年   11篇
  2001年   7篇
  2000年   8篇
  1999年   3篇
  1998年   5篇
  1997年   2篇
  1996年   2篇
  1995年   1篇
  1988年   1篇
排序方式: 共有646条查询结果,搜索用时 46 毫秒
1.
自相似网络通信量模型研究综述   总被引:6,自引:0,他引:6       下载免费PDF全文
越来越多的研究表明网络通信量不是Markov过程,而是在任意时间尺度上都具有突发特性,即自相似特性。描述网络通信量的数学模型主要有自相似和长相关结构。网络的某些参数服从重尾分布,从而导致网络通信量时间尺度上的突发特性。该文分析了传统网络通信量模型和性能分析的弊端,描述了新型网络通信量模型应该具有的基本特征。本文重点研究了网络自相似通信量相关的ON/OFF模型、用户访问概率模型和网络流量闭环模型,讨论了相关的研究方向,并总结了在研究网络通信量模型的过程中应该注意的原则和问题。  相似文献   
2.
树型网络中IPTV系统的流量均衡策略   总被引:2,自引:0,他引:2  
曾杰  陈芳炯  韦岗 《电讯技术》2007,47(2):161-165
提出一种在树型网络中的网络电视(IPTV)系统负载均衡算法,该算法通过服务器放置点的选择和服务器内容分配实现负载均衡.首先把大的树型网络分解成多个小的树型网络,对每个小的树型网络应用一种改进的搜索算法,最后把在多个子树的解组合成原问题的解,较好地将流量均匀分配到整个网络中.  相似文献   
3.
近年来许多研究表明,网络业务本质是多分形的,呈现出自相似性与突发性,传统的基于泊松分布的模型不再适用。本文从理论分析和实际网络业务数据仿真验证两方面严格论证了网络业务流量能用α稳定分布准确建模,并与其它流量模型对比指出其优越性。  相似文献   
4.
Due to interference, path loss, multipath fading, background noise, and many other factors, wireless communication normally cannot provide a wireless link with both a high data rate and a long transmission range. To address this problem, striping network traffic in parallel over multiple lower-data-rate but longer-transmission-range wireless channels may be used. In this paper, we propose a new striping method and evaluate its performances over multiple IEEE 802.11(b) channels under various conditions. Our extensive simulation results show that this method is quite effective for such an application. S.Y. Wang is an Associate Professor of the Department of Computer Science and Information Engineering at National Chiao Tung University, Taiwan. He received his Master and Ph.D. degree in computer science from Harvard University in 1997 and 1999, respectively. His research interests include wireless networks, Internet technologies, network simulations, and operating systems. He is the author of the NCTUns 2.0 network simulator and emulator, which is being widely used by network and communication researchers. More information about the tool is available at http://NSL.csie.nctu.edu.tw/nctuns.html. C.H. Hwang received his master degree in computer science from NCTU in 2002 and currently is working for a network company. C.L. Chou currently is a third-year Ph.D. student at the Department of Computer Science and Information Engineering, National Chiao TungUniversity (NCTU), Taiwan. He received his master degree in computer science from NCTU in 2002.  相似文献   
5.
Comparison of failure dependent protection strategies in optical networks   总被引:2,自引:0,他引:2  
The criticality of survivable network design and operation increases with increasing transmission speed. Path protection strategies achieve better network utilization compared to link protection strategies; however, the recovery time of connections in path protection strategies are higher than that in link protection strategies. This paper evaluates and compares the performance of three failure dependent strategies: (1) failure dependent path protection; (2) link protection; and (3) Diversion—a variant of the segmented path protection approach. In addition, a framework for evaluating the connection recovery time is also developed. The protection strategies are compared for their recovery time and blocking performance using extensive simluations.  相似文献   
6.
This paper develops a connection establishment framework for protecting connections against single-link failures using link protection at the granularity of a connection, referred to as Connection Switched Link Protection (CSLP). As a connection is routed only around a failed link, the channel assignment for the connection on the backup path of the failed link must be consistent with that of the primary path. Such a consistency is guaranteed at the time of call admission. The advantages of employing link protection at the connection level is established by comparing its performance through extensive simulations against link protection at the granularity of a fiber, referred to as Fiber Switched Link Protection (FSLP). Link protection at the connection level is shown to significantly outperform that at the granularity of a fiber, specifically when some traffic requires protection while others do not.  相似文献   
7.
8.
In this paper, we investigate the problem of dynamically establishing dependable connections in wavelength division multiplexing (WDM) mesh networks with traffic-grooming capabilities. We first develop a new wavelength-plane graph (WPG) to represent the current state of the network. We then propose a dynamic shared sub-path protection (SSPP) scheme based on this WPG. To establish a dependable connection, SSPP first searches a primary path for each connection request, and then it segments the found path into several equal-length sub-paths, and computes their corresponding backup paths, respectively. If two sub-paths in SSPP are fiber-disjoint then their backup paths can share backup resources to obtain optimal spare capacity. Based on dynamic traffic with different load, the performance of SSPP has been investigated via simulations. The results show that SSPP can make the tradeoffs between resource utilization and restoration time.  相似文献   
9.
The optical layer of the transport network is expected in the (near) future to make the transition from a statically configured layer to a fully flexible, automatic and intelligent layer. Such an intelligent optical network (ION) allows to set up (or tear down) bandwidth between two nodes on demand, following a simple request of the client network layer: the so-called switched connections. For successful deployment of these switched connections it is of utmost importance to have a well-educated idea about the granularities of the traffic flows in the optical transport network. Deploying switched connections with a capacity of 10 Gbps to transport a traffic demand with a granularity of a few hundred Mbps does not exactly make efficient use of the network resources. In this paper, the granularity of the traffic demand between US metro areas is investigated for two future points in time, namely 2006 and 2010. For this study we focus on the traffic flows between two metro area entities: the points of presence (PoPs) or the main aggregation points of the customer traffic in a metro area, and the collector central offices (COs) or the nodes a bit further in the metro area, closer to the end-customers. We have found that a significant portion of the total traffic volume at these moments in time will qualify for transport using switched connections with a capacity of 10 Gbps. According to our study, in 2006 around one third of the traffic will qualify for transportation in such 10 Gbps connections between PoPs in different metro areas, while by 2010 this amount will have increased to more than 99%. The traffic granularity between the collector COs, however, will in 2006 still be too small to justify the use of direct 10 Gbps connections, but in 2010 almost three quarter of the traffic could make use of 10 Gbps direct connections from collector CO to collector CO. These results enable us to sketch the expected network evolution scenario and determine the type and size of equipment needed in the different steps of the network evolution. The optical edge aggregation switches will have to be moved deeper into the metro area with time: in 2006 they will be needed at the PoPs, while by 2010 they could be placed at the collector COs.  相似文献   
10.
In this paper, we address the traffic grooming problem in WDM mesh networks when the offered traffic is characterized by a set of traffic matrices—a variant of dynamically changing traffic. We justify the need to address this problem in mesh networks and also argue for the validity of our approach to solve this problem. Our primary objective is to design the network in terms of the number of wavelengths and transceivers required to support any offered traffic matrix. We provide a simple and generic framework to minimize the number of transceivers needed in the network. Simulation results have been presented in contrast with a possible approach, to enable comparison with our solution strategy. An ILP formulation of our approach is also presented.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号