|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | ANovelSharedSegmentProtectionAlgorithm for MulticastSessionsinMesh WDM Networks 显示文摘 | LuCai ShengWang LiLemin | 2006 | ETRIJournal2006，28，3： | 1 |
| 2 | DWF^2Q+: A Novel and Efficient Packet Fair Queuing Algorithm显示文摘A novel packet fair queuing algorithm,Deficit WF^2Q+ (DWF^2Q+) is proposed in this paper,which combines the characteristics of deficit round robin(DRR) and WF^2Q+. DWF^2Q+ achieves better delay properties than DRR and lower implementing complex-ity than WF^2Q+. DWF^2Q+can be implemented by a simple grouping architecture, called grouping per service frequency (GPSF), which can support a large number of sessions. Simulations show that DWF^2Q+ has desirable low delay and fairness properties, which make it applica-ble to support both real time and best effort services in the Internet. | TUXiaodong LILemin WANGGuoxing | 2003 | Chinese Journal of Electronics2003，12，2： | 0 |
| 3 | Multiple Constraints Based Lightpath Provisioning in Optical Networks显示文摘In Wavelength-routed optical Networks, a lightpath can be provisioned only if a path can be found which satisfies multiple constraints while simultaneously achieving optimal primary cost. Where the primary cost can be any metric set by network administrators, and the constraints concerned in optical networks include wavelength continuity constraint and some other impairments in optical domain. In this paper~ the impact of these constraints on the optimal path calculation algorithms is studied, then a unique solving framework is proposed, which treated the whole problem as a Multiple constraint optimal path (MCOP) problem. A novel heuristic for solving MCOP problem is proposed, and its performance is evaluated through extensive simulations. | WANGSheng LILemin | 2005 | Chinese Journal of Electronics2005，14，2： | 0 |
| 4 | Dynamic Protection-at-Lightpath Algorithms in Traffic-Grooming WDM Mesh Networks显示文摘Under the constraints of the number of transceivers per node and wavelength continuity, we investigate the problem of provisioning Protection-at-lightpath (PAL) level for connections with different bandwidth granularities in traffic-grooming WDM mesh networks. We first develop a new Protection graph model (PGM) to represent current state of the network, i.e., the information about transceivers, wavelengths, protected lightpath, bandwidth, etc. We then present two grooming policies for PAL, which are called Minimal wavelength-link policy (MWP) and Minimal transceiver policy (MTP). Based on the PGM, we propose two dynamic PAL algorithms with MWP and MTP respectively, which are called Minimal wavelength-link method (MWM) and Minimal transceiver method (MTM). At last we compare the performance of MWM and MTM with other methods utilizing different grooming policies presented in previous literatures via simulations. Our results show that MWM and MTM outperform other methods significantly and MWM has a better performance than MTM. | HERongxi WENHaibo LILemin | 2005 | Chinese Journal of Electronics2005，14，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员