共查询到20条相似文献,搜索用时 46 毫秒
1.
Ad Hoc网络马氏模型路由维护的性能分析 总被引:1,自引:0,他引:1
Ad Hoc网络可以用许多数学模型来描述.本文以DSR协议为基础,把每条链边的长度看作是一个生灭过程,建立了马氏模型.在此模型中,我们考虑了空间可重用和请求分组带有跳限的情形.基于马氏模型,本文引入了链边Υ-时有效的概念,推导了链边有效的概率,得出了路由有效的条件概率和路由的平均恢复次数. 相似文献
2.
移动自组网络(简称MANET)因其移动性及无基础设施支持等特点已经成为无线通信网络中的热门问题.通过将一个MANET网络中每条链边的长度看作一个生灭过程,并且假设在泛洪过程中空间可以复用n次,建立了移动自组网络空间可复用的马氏模型,简记为n-SRBDM.在一个典型的随选型路由协议即动态源路由(DSR)协议的基础上,研究了网络的一些关键性能参数,给出了路由泛洪距离的概率分布和期望,限定泛洪步数时成功寻路的概率、发现τ-时有效路径及对称有效路径的概率,发现一条有效路径的平均时间等,对于路由维护过程,也引入并研究了一些网络性能参数,例如,路由恢复的平均频率,路由有效的平均时间.对于这些网络参数在空间可复用和空间不可复用两种情形下进行了比较.证明了空间可复用模型下的路由选择更为有效. 相似文献
3.
在混料试验中,响应变量存在着不确定性,提出了一类新的混料试验模型.基于模糊数的可能性方差理论,为该混料模型定义了D-最优和G-最优设计准则.同时,讨论了该模型最优设计的等价定理,并给出实例分析. 相似文献
4.
加氢站是氢能产业发展的重要基础设施,其布局选址对于氢能在交通领域的推广应用至关重要。为此,提出一种加氢站的选址优化方法。首先,分别以运营商追求捕获交通流量最大化、客户追求获得加氢服务可能性最大化为上、下层目标函数构建了双层规划模型,并引入机会约束规划理论处理了交通流量的不确定性。该模型考虑了客户路径选择的行为特性,能够为交通流量不确定性下的加氢站选址提供重要借鉴。其次,利用KKT条件和确定性等价将所提机会约束双层规划模型转化为了单层的混合整数二阶锥规划问题以实现高效求解。最后,为验证该模型的有效性,以长三角地区交通网络为案例进行了仿真分析。 相似文献
5.
6.
7.
DEA模型在资金分配和管理中的应用 总被引:1,自引:0,他引:1
资金的合理使用,是经济活动中的一个非常重要的问题.利用DEA的理论、方法模型,探讨资金的使用效率、分配的合理性,以及最佳资金预算的确定方法.涉及的DEA模型结构属于非参数的最优化DEA模型,以及DEA平行网络结构.模型中所使用的生产可能集是可以评价是否呈现"拥挤"迹象的. 相似文献
8.
本文在BHK模型的基础上,考虑短期利率波动杠杆效应和EPU对短期利率波动的影响,构建了一个包含杠杆效应和EPU的混频短期利率模型,即BHK-L-MIDAS模型对短期利率波动进行建模与预测。采用上海银行间同业拆借利率(SHIBOR)和中国EPU指数数据对构建的BHK-L-MIDAS模型进行实证分析,结果表明:短期利率波动存在“反向杠杆效应”;EPU对短期利率波动具有显著负向的影响;BHK-L-MIDAS模型相较于竞争模型(BHK和BHK-MIDAS模型)获得了更好的样本内数据拟合效果。基于三种损失函数以及模型置信集(MCS)检验对模型样本外短期利率波动预测能力的分析表明:BHK-L-MIDAS模型相比BHK模型和BHK-MIDAS模型具有更高的样本外预测精度,且BHK-L-MIDAS模型在不同预测窗口表现出的预测能力具有稳健性。最后,VaR分析表明BHK-L-MIDAS模型在短期利率市场风险度量方面的经济价值。 相似文献
9.
本文提出了两个统计量来检验半参数时变系数模型的序列相关:一个用于检验半变系数时序模型的有限阶序列相关,另一个用于检验半变系数平行数据模型的有限阶序列相关.在误差过程为鞅差的零假设下,所提出的两个检验统计量服从渐近正态或卡方分布.蒙特卡罗模拟研究表明所提出的检验统计量具有良好的有限样本性质. 相似文献
10.
基于证据理论的风险收益评价模型及其应用 总被引:1,自引:0,他引:1
针对影响风险及收益的因素,给出了一种基于D em pster-Shafer证据理论的风险收益综合评价模型.通过对影响风险收益的不确定性多属性进行融合,可以将风险收益评价问题转化为一般的确定性多属性风险评价问题.实例表明基于证据推理对风险收益进行综合评价是可行有效的. 相似文献
11.
Braess's Paradox is the counterintuitive fact that removing edges from a network with “selfish routing” can decreasethe latency incurred by traffic in an equilibrium flow. We prove that Braess's Paradox is likely to occur in a natural random network model: with high probability, there is a traffic rate and a set of edges whose removal improves the latency of traffic in an equilibrium flow by a constant factor. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010 相似文献
12.
The Differentiated Services architecture is a scalable solution to provide differentiated Quality of Service. In this paper, we address the network load balancing optimization of such networks based on bandwidth differentiation between two services. We define the optimization problem as an Integer Programming model and propose a heuristic algorithm based on GRASP with Path Relinking. We present computational results showing that (i) good quality solutions can be computed and (ii) proper load balancing can efficiently obtain service differentiation. 相似文献
13.
We use computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multicast‐based delay inference, that is, the problem of reconstructing delay characteristics of a network from end‐to‐end delay measurements on network paths. Our inference algorithm is based on additive metric techniques used in phylogenetics. It runs in polynomial time and requires a sample of size only poly(log n). We also show how to recover the topology of the routing tree. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010 相似文献
14.
Wei Yu 《Operations Research Letters》2009,37(2):85-88
This work considers the vehicle routing problem on a line with the constraint that each customer is visited after its release time. It is already known that the single-vehicle case is polynomially solvable. We present polynomial time algorithms for two variants of the multi-vehicle case. 相似文献
15.
Arie Hordijk Anneke Loeve Jeroen Tiggelman 《Mathematical Methods of Operations Research》1998,47(2):317-336
In this paper we analyse a closed queueing network in which customers have to be assigned to parallel queues. The routing decision may not depend on the numbers of customers in the queues. We present an algorithm and we show that it computes an average optimal policy in case of exponential service times. The algorithm also works for non-exponential service times, in which case periodic policies are found.The research of this author has been supported by the Netherlands Organization for Scientific Research (N.W.O.) and was carried out at the University of Leiden. 相似文献
16.
Assuming that the traffic matrix belongs to a polytope, we describe a new routing paradigm where each traffic matrix is routed a combination of a number of extreme routings. This combination depends on the current traffic matrix. Multipolar routing can be seen as a generalization of both routing and robust static routing. Moreover, the time complexity of multipolar routing is under control since it depends on the number of poles (i.e. the number of extreme routings) which can be defined by the network planner 相似文献
17.
An undirected routing problem is a pair (G,R) where G is an undirected graph and R is an undirected multigraph such that V(G)=V(R). A solution to an undirected routing problem (G,R) is a collection P of undirected paths of G (possibly containing multiple occurrences of the same path) such that edges of R are in one-to-one correspondence with the paths of P, with the path corresponding to edge {u,v} connecting u and v. We say that a collection of paths P is k-colorable if each path of P can be colored by one of the k colors so that the paths of the same color are edge-disjoint (each edge of G appears at most once in the paths of each single color). In the circuit-switched routing context, and in optical network applications in particular, it is desirable to find a solution to a routing problem that is colorable with as few colors as possible. Let Qn denote the n-dimensional hypercube, for arbitrary n1. We show that a routing problem (Qn,R) always admits a 4d-colorable solution where d is the maximum vertex degree of R. This improves over the 16d/2-color result which is implicit in the previous work of Aumann and Rabani [SODA95, pp. 567–576]. Since, for any positive d, there is a multigraph R of degree d such that any solution to (Qn,R) requires at least d colors, our result is tight up to a factor of four. In fact, when d=1, it is tight up to a factor of two, since there is a graph of degree one (the antipodal matching) that requires two colors. 相似文献
18.
We consider a network of N nodes with given distances in which customers arrive at one of the nodes and request transportation to one of the other nodes.
There is a finite number of servers (or transporters) with possibly different capacities and speed available. We show that
there exists a critical arrival rate κc, such that if the arrival rate is larger than κc then the number of customers in the system increases to ∞ with linear speed no matter which routing strategy for the transporters
is chosen (even if we allow the strategy to depend on the future arrival process). If, on the other hand, κ < c then there exists even a fixed periodic routing strategy which keeps the system stable (in a sense to be made precise). We
prefer to start with a deterministic set-up which allows very general arrival processes and look at the stochastic case only
in the final section where we get more refined results by assuming that the arrival process has integrable stationary ergodic
increments (which still allows batch arrivals and long-range dependence). Potential applications include the control of elevators
in highrise buildings.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
19.
Adrian Kosowski 《Discrete Applied Mathematics》2009,157(2):321-329
Motivated by wavelength-assignment problems for all-to-all traffic in optical networks, we study graph parameters related to sets of paths connecting all pairs of vertices. We consider sets of both undirected and directed paths, under minimisation criteria known as edge congestion and wavelength count; this gives rise to four parameters of a graph G: its edge forwarding index π(G), arc forwarding index , undirected optical index , and directed optical index .In the paper we address two long-standing open problems: whether the equality holds for all graphs, and whether indices π(G) and are hard to compute. For the first problem, we give an example of a family of planar graphs {Gk} such that . For the second problem, we show that determining either π(G) or is NP-hard. 相似文献
20.
Fair allocation of flows in multicommodity networks has been attracting a growing attention. In Max-Min Fair (MMF) flow allocation, not only the flow of the commodity with the smallest allocation is maximized but also, in turn, the second smallest, the third smallest, and so on. Since the MMF paradigm allows to approximate the TCP flow allocation when the routing paths are given and the flows are elastic, we address the network routing problem where, given a graph with arc capacities and a set of origin-destination pairs with unknown demands, we must route each commodity over a single path so as to maximize the throughput, subject to the constraint that the flows are allocated according to the MMF principle. After discussing two properties of the problem, we describe a column generation based heuristic and report some computational results. 相似文献