共查询到20条相似文献,搜索用时 15 毫秒
1.
Jianping Wang Zhijun Wu Junling Yuan Xiaosong Yu 《Photonic Network Communications》2010,20(3):209-215
When a connection request comes in a mesh optical network, the routers automatically choose the suitable routing paths and
wavelength to it according to the network topology and link-state information saved in its global link-state database. Because
some of these wavelengths may be released or occupied at any time, the global state database is always out of date and need
update by some update policy. A suitable link-state update policy is critical, since a high-frequency update policy imposes
heavy burden on the network, while a low-frequency update would increase the inaccurate of the global link-state database.
In this paper, we propose a link-state update policy, named the EA-HD policy, which considers two index of a link, one is
the Hamming distance between the local link-state database and the global link-state database, and the other is the used ratio
of its wavelengths. The proposed update policy gets a trade-off between the accurate of link-state information and its update
cost. Simulation results prove that our scheme achieves a good performance in traffic blocking probability while maintaining
moderate volume of update traffic. 相似文献
2.
Distributed, scalable routing based on vectors of link states 总被引:2,自引:0,他引:2
Garcia-Luna-Aceves J.J. Behrens J. 《Selected Areas in Communications, IEEE Journal on》1995,13(8):1383-1395
We have present a new method for distributed routing in computer networks and internets using link-state information. Link vector algorithms (LVA) are introduced for the distributed maintenance of routing information in large networks and internets. According to an LVA, each router maintains a subset of the topology that corresponds to adjacent links and those links used by its neighbor routers in their preferred paths to known destinations. Based on that subset of topology information, the router derives its own preferred paths and communicates the corresponding link-state information to its neighbors. An update message contains a vector of updates; each such update specifies a link and its parameters. The LVA can be used for different types of routing. The correctness of the LVA is verified for arbitrary types of routing when correct and deterministic algorithms are used to select preferred paths at each router and each router is able to differentiate old updates from new. The LVA are shown to have better performance than the ideal link-state algorithm based on flooding and the distributed Bellman-Ford algorithm 相似文献
3.
Mohammad Reza Abbasi Ajay Guleria Mandalika Syamala Devi 《International Journal of Communication Systems》2020,33(2)
Software‐defined networking (SDN) facilitates network programmability through a central controller. It dynamically modifies the network configuration to adapt to the changes in the network. In SDN, the controller updates the network configuration through flow updates, ie, installing the flow rules in network devices. However, during the network update, improper scheduling of flow updates can lead to a number of problems including overflowing of the switch flow table memory and the link bandwidth. Another challenge is minimizing the network update completion time during large‐network updates triggered by events such as traffic engineering path updates. The existing centralized approaches do not search the solution space for flow update schedules with optimal completion time. We proposed a hybrid genetic algorithm‐based flow update scheduling method (the GA‐Flow Scheduler). By searching the solution space, the GA‐Flow Scheduler attempts to minimize the completion time of the network update without overflowing the flow table memory of the switches and the link bandwidth. It can be used in combination with other existing flow scheduling methods to improve the network performance and reduce the flow update completion time. In this paper, the GA‐Flow Scheduler is combined with a stand‐alone method called the three‐step method. Through large‐scale experiments, we show that the proposed hybrid approach could reduce the network update time and packet loss. It is concluded that the proposed GA‐Flow Scheduler provides improved performance over the stand‐alone three‐step method. Also, it handles the above‐mentioned network update problems in SDN. 相似文献
4.
Stathis B. Mavridopoulos Georgia Beletsioti Petros Nicopolitidis Georgios I. Papadimitriou Emmanouel Varvarigos 《International Journal of Communication Systems》2020,33(8)
Elastic optical networks (EON) have emerged as a solution to the growing needs of the future internet, by allowing for greater flexibility, spectrum efficiency, and scalability, when compared to WDM solutions. EONs achieve those improvements through finer spectrum allocation granularity. However, due to the continuity and contiguity constrains, distant connections that are routed through multiple hops suffer from increased bandwidth blocking probability (BBP), while more direct connections are easier to form. This paper proposes HopWindows, a novel method that strategically allocates bandwidth to connections based on their hop distance. This new algorithm applies masks that control the range of frequency slots (FSs) allocated to each n‐hop connection. Furthermore, a new network metric is introduced, the normalized bandwidth blocking probability (normalized BBP). Utilization of this metric ensures increased fairness to distant connections. Extended simulation results are presented which indicate that the proposed HopWindows method achieves a superior performance over the well‐known FirstFit algorithm. The proposed algorithm may achieve a decrease in bandwidth blocking probability of up to 50%. 相似文献
5.
CEDAR: a core-extraction distributed ad hoc routing algorithm 总被引:9,自引:0,他引:9
Sivakumar R. Sinha P. Bharghavan V. 《Selected Areas in Communications, IEEE Journal on》1999,17(8):1454-1465
We present CEDAR, a core-extraction distributed ad hoc routing algorithm for quality-of-service (QoS) routing in ad hoc network environments, CEDAR has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations; (b) the propagation of the link-state of high bandwidth and stable links in the core through increase/decrease waves; and (c) a QoS-route computation algorithm that is executed at the core nodes using only locally available state. The performance evaluations show that CEDAR is a robust and adaptive QoS routing algorithm that reacts quickly and effectively to the dynamics of the network while still approximating the performance of link-state routing for stable networks 相似文献
6.
Yieh-Ran Haung 《Vehicular Technology, IEEE Transactions on》2002,51(6):1330-1337
The Universal Mobile Telecommunications System (UMTS) network consists of a core network (CN) and a UMTS terrestrial radio access network (UTRAN). The UTRAN offers radio access bearer (RAB) services between the user equipment (UE) and the CN to support mobile multimedia applications with different quality of service (QoS) requirements. Depending on the requested QoS, different types of RABs can be established at the request of the CN. The UTRAN then has to establish and maintain the RAB with the requested QoS. We study the queueing of RABs as a means for improving the bandwidth utilization while minimizing the RAB blocking probability. We develop an analytical model to study the performance for UTRAN with queued RABs in terms of RAB blocking probability and average queueing time of queued RABs. From an analytic point of view, the main contribution of this paper is the introduction of a novel recursion for the computation of the performance measures. 相似文献
7.
One of the important issues in providing efficient multimedia traffic on a mobile computing environment is to guarantee the mobile host (client) with consistent QoS (Quality of Service). However, the QoS negotiated between the client and the network in one cell may not be honored due to client mobility, causing hand-offs between cells. In this paper, a call admission control mechanism is proposed to provide a consistent QoS guarantee for multimedia traffic on a mobile computing environment. Each cell can reserve fractional bandwidth for hand-off calls to its adjacent cells. It is important to determine the right amount of bandwidth reserved for hand-off calls because the blocking probability of new calls may increase if the amount of reserved bandwidth is more than necessary. An adaptive bandwidth reservation based on a mobility graph and a 2-tier cell structure is proposed to determine the amount of bandwidth to be reserved in the cell and to control dynamically its amount according to network conditions. We also propose a call admission control based on this bandwidth reservation and ``next-cell prediction' scheme using a mobility graph. In order to evaluate the performance of our call admission control mechanism, we measure metrics such as blocking probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The simulation results show that the performance of our mechanism is superior to that of existing mechanisms such as NR-CAT2, FR-CAT2, and AR-CAT2. 相似文献
8.
In this work, a new methodology to compute the blocking probability in wavelength-routed optical networks is presented. The proposal is based on an interactive procedure, named Interactive Matrix Methodology (IMM), that executes actualization of the network traffic distribution in order to reach a precise blocking performance. The IMM updates an initial network link load continuously and computes the blocking probability for each output link considering that the traffic among the links is dependent and related with all links and nodes in the network, not only with all links in a given path or route. The simulation results obtained in the same conditions and in several optical network scenarios match very well with the theoretical approximation achieved with this methodology. The advantage of this theoretical methodology is to be fast, accurate and applicable in low load regions, where a discrete event simulation is not precise. Furthermore, this method can be used to compute the estimative of blocking probabilities per node and in the network, including the cases where the number of wavelengths is different on each node. 相似文献
9.
《Proceedings of the IEEE. Institute of Electrical and Electronics Engineers》1984,72(11):1611-1619
A Land-Mobile Satellite System (LMSS) is a satellite-based communications network which provides voice and data communications to mobile users in a vast geographical area. By placing a "relay tower" at a height of 22300 mi, an LMSS can provide ubiquitous radio communication to vehicles roaming in remote or thinly populated area. LMSS is capable of supporting a variety of services, such as two-way alphanumeric service, paging service, full-duplex voice service, and half-duplex dispatch service. A Network Management Center (NMC) will handle the channel requests, channel assignments, and in general the network control functions. A pool of channels is managed at the NMC to be shared by all mobile users. An integrated demand-assigned multiple-access protocol has been developed for the experimental LMSS. The pool of channels is divided into reservation channels and information channels. The information channels can be assigned by the NMC to be either voice channels or data channels. Each mobile user must send a request through one of the reservation channels to the NMC via the ALOHA random-access scheme. Once the request is received and processed, the NMC will examine the current traffic condition and assign an information channel to the user. NMC will periodically update the partitions between the reservation channels, voice channels, and data channels to optimize system performance. Data channel requests are queued at the NMC while voice channel requests are blocked calls cleared. Various operational scenarios have been investigated. Tradeoffs between the data and voice users for a given delay requirement and a given voice call blocking probability have been studied. In addition, performance impacts of such technological advancements as satellite on-board switching and variable bandwidth assignment are discussed. 相似文献
10.
Yanxia Jia Ioanis Nikolaidis Pawel Gburzynski 《International Journal of Communication Systems》2004,17(1):1-26
We propose a routing strategy in which connection requests with specific bandwidth demands can be assigned to one of several alternative paths connecting the source to the destination. The primary goal of this multiple‐path approach is to compensate for the inaccuracy of the knowledge available to routing nodes, caused by the limited frequency of link state (LS) information exchanges. We introduce a collection of K‐shortest path routing schemes and investigate their performance under a variety of traffic conditions and network configurations. We subsequently demonstrate that K‐shortest path routing offers a lower blocking probability in all scenarios and more balanced link utilization than other routing methods discussed in the literature. With our approach, it is possible to reduce the frequency of link state exchanges, and the incurred bandwidth overhead, without compromising the overall performance of the network. Based on the proposed routing scheme, we investigate different link state dissemination algorithms, which are aimed at reducing the communication overhead by prioritizing the scope and differentiating the qualitative content of LS update messages. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
11.
在软件定义网络中,为了实现各种网络性能优化目标,控制面需要频繁的对数据面进行更新。然而,由于数据面的异步性,不合理的更新将严重降低网络性能。针对此问题,该文提出一种快速和一致的流更新策略(FCFU)。该策略通过流分段减弱其原有的强依赖关系,使能并行更新,通过分析子流段与多个资源间的依赖关系得到总更新轮数较少的更新安排,最后基于延时队列完成一致性流更新。实验结果表明,与现有的流更新算法相比,该策略能够缩短流更新总时间达20.6%,同时保证了更新期间无拥塞和包乱序等问题的发生。 相似文献
12.
In WiMAX networks, contention based bandwidth requests are allowed in the uplink channel on the time division duplexing frame. The standard allows some types of traffic classes to use this period while preventing others like Unsolicited Grant Service. In this study, we provide a performance analysis of the three types of connections (ertPS, non-real time Polling Service and Best Effort) that are allowed to contend for bandwidth request opportunities. The choice of these traffic classes covers both real and non-real traffic types. Two quality of service parameters; contention probability and average connection delay are investigated in order to evaluate the network performances. Different levels of priority and blocking probability are assigned to each class of service. This performance analysis has been done using an analytical model for evaluating admission control for the previous mentioned classes in WiMAX network. 相似文献
13.
HUANG Fei ZHU Li-dong WU Shi-qi 《中国电子科技》2007,5(1):7-12
A novel bandwidth allocation strategy and a connection admission control technique arc proposed to improve the utilization of network resource and provide the network with better quality of service (QoS) guarantees in multimedia low earth orbit (LEO) satellite networks. Our connection admission control scheme, we call the probability based dynamic channel reservation strategy (PDR), dynamically reserves bandwidth for real-time services based on their handoff probability. And the reserved bandwidth for real-time handoff connection can also be used by new connections under a certain probability determined by the mobility characteristics and bandwidth usage of the system. Simulation results show that our scheme not only lowers the call dropping probability (CDP) for Class I real-time service but also maintains the call blocking probability (CBP) to certain degree. Consequently, the scheme can offer very low CDP for rcal-time connections while keeping resource utilization high. 相似文献
14.
Ziyu Shao Dongbin Yan Zhengbin Li Ziyu Wang Anshi Xu 《Photonic Network Communications》2004,7(3):301-312
Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength conversion technology and wavelength converters play an important role in enhancing fiber utilization and in reducing the overall call blocking probability of the network. In this paper, we develop a new analytical model to calculate the average blocking probability in multi-fiber link networks using limited range wavelength conversion. Based on the results obtained, we conclude that the proposed analytical model is simple and yet can effectively analyze the impact of wavelength conversion ranges and number of fibers on network performance. Also a new heuristic approach for placement of wavelength converters to reduce blocking probabilities is explored. Finally, we analyze network performance with the proposed scheme. It can be observed from numerical simulations that limited range converters placed at a few nodes can provide almost the same blocking probability as full range wavelength converters placed at all the nodes. We also show that being equipped with a multi-fiber per-link has the same effect as being equipped with the capability of limited range wavelength conversion. So a multi-fiber per-link network using limited range wavelength conversion has similar blocking performance as a full wavelength convertible network. Since a multi-fiber network using limited range wavelength conversion could use fewer converters than a single-fiber network using limited range wavelength conversion and because wavelength converters are today more expensive than fiber equipment, a multi-fiber network in condition with limited range wavelength conversion is less costly than a single fiber network using only limited range wavelength conversion. Thus, multi-fiber per-link network using limited range wavelength conversion is currently a more practical method for all optical WDM networks. Simulation studies carried out on a 14-node NSFNET, a 10-node CERNET (China Education and Research Network), and a 9-node regular mesh network validate the analysis. 相似文献
15.
In this letter, based on information theory, we present a theoretical framework for the optimal link-state update, upon which efficient link-state update policies may be developed. 相似文献
16.
Quality-of-service (QoS) routing satisfies application performance requirements and optimizes network resource usage by selecting paths based on connection traffic parameters and link load information. However, distributing link state imposes significant bandwidth and processing overhead on the network. This paper investigates the performance tradeoff between protocol overhead and the quality of the routing decisions in the context of the source-directed link state routing protocols proposed for IP and ATM networks. We construct a detailed model of QoS routing that parameterizes the path-selection algorithm, link-cost function, and link state update policy. Through extensive simulation experiments with several network topologies and traffic patterns, we uncover the effects of stale link state information and random fluctuations in traffic load on the routing and setup overheads. We then investigate how inaccuracy of link state information interacts with the size and connectivity of the underlying topology. Finally, we show that tuning the coarseness of the link-cost metric to the inaccuracy of underlying link state information reduces the computational complexity of the path-selection algorithm without significantly degrading performance. This work confirms and extends earlier studies, and offers new insights for designing efficient quality-of-service routing policies in large networks 相似文献
17.
Shao Ziyu Yan Dongbin Li Zhengbin Wang Ziyu Xu Anshi 《Photonic Network Communications》2007,13(2):195-205
Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the
optical fiber. Wavelength conversion technology and wavelength converters play an important role in enhancing fiber utilization
and in reducing the overall call blocking probability of the network. In this paper, we develop a new analytical model to
calculate the average blocking probability in multi-fiber link networks using limited-range wavelength conversion. Based on
the results obtained, we conclude that the proposed analytical model is simple and yet can effectively analyze the impact
of wavelength conversion ranges and number of fibers on network performance. Also a new heuristic approach for placement of
wavelength converters to reduce blocking probabilities is explored. Finally, we analyze network performance with the proposed
scheme. It can be observed from numerical simulations that limited-range converters placed at a few nodes can provide almost
the same blocking probability as full range wavelength converters placed at all the nodes. We also show that being equipped
with a multi-fiber per-link has the same effect as being equipped with the capability of limited-range wavelength conversion.
So a multi-fiber per-link network using limited-range wavelength conversion has similar blocking performance as a full wavelength
convertible network. Since a multi-fiber network using limited-range wavelength conversion could use fewer converters than
a single-fiber network using limited range wavelength conversion and because wavelength converters are today more expensive
than fiber equipment, a multi-fiber network in condition with limited-range wavelength conversion is less costly than a single-fiber
network using only limited-range wavelength conversion. Thus, multi-fiber per-link network using limited-range wavelength
conversion is currently a more practical method for all optical WDM networks. Simulation studies carried out on a 14-node
NSFNET, a 10-node CERNET (China Education and Research Network), and a 9-node regular mesh network validate the analysis. 相似文献
18.
19.
文章分析了偏射路由对网络性能的影响,在分析发送端控制偏射路由技术的基础上,提出了基于阈值检测和数据更新的改进方案.边缘节点快速更新状态信息,并通过特殊控制分组传递链路拥塞的分布特征等信息;交换节点进行阈值检测,动态决定竞争时突发的传送方式,减少偏射路由对网络负荷的影响,进一步降低网络阻塞率,改善网络性能。 相似文献
20.
The paper presents a centralized virtual path bandwidth (VPB) control scheme for ATM networks which satisfies mainly three specifications: a) optimality during a medium-term control interval, b) fast time response so as to absorb the medium-term traffic fluctuations, and c) easy implementation. The paper mainly points at the impact of direct, on-line traffic measurements on bandwidth control. The control objective is to rearrange the installed bandwidth of the virtual paths according to the offered traffic so as to minimize the maximum call blocking probability of the whole network. Network simulation shows that a sophisticated VPB controller which relies on simple measurements of the offered traffic can substantially improve the performance of an ATM network. The necessary bandwidth rearrangement time is also examined by simulation 相似文献