Because WDM networks are circuit switched loss networks blocking may occur because of lack of resources. Also in circuit switched networks many paths use the same links. This toolbox answers the question how different paths with different loads influence on each other and what is the blocking on each of the defined path. Toolbox is capable of computing blocking for three different WDM network types: with no wavelength conversion, with full wavelength conversion and with limited range wavelength conversion. It is worth noting that case for full conversion can be usefull for any circuit switched network without additional constraints (i.e. wavelength continuity constraint in WDM), for example telephone network. Toolbox contains also scripts for defining network structures (random networks, user defined networks) and traffic matrixes. Three graph algorithms for Shortest path computation are also in this toolbox (they are used for traffic matrix creation).
標簽： networks blocking switched Because
上傳時間： 2017-07-28
上傳用戶：zhangzhenyu
Given a graph G = (V, E), where every edge e has a nonnegative weight w(e), and a source vertex s in V, find the Shortest path from s to every other vertex
標簽： nonnegative weight source vertex
上傳時間： 2014-01-10
上傳用戶：xuan‘nian
The task in this assignment is to implement an airline routing system. Your system should be able to read in a ight network as a graph from a le, where airports are represented as vertices and ights between airports are represented as edges, take as input two airports and calculate the Shortest route (ie path) between them.
標簽： system assignment implement airline
上傳時間： 2017-09-07
上傳用戶：kiklkook
這個說明倒不是說明函數的功能，只是聲明一下函數中出現的問題。 Shortest()函數沒有問題，在secShortest中我希望只得到一條次短路（或幾條roadcost()值相同的次短路），結果卻出來好幾條，我仔細檢查了一下程序，應該沒有什么問題。 因此在使用時，要得到次短路，只能用roadcost()函數分別求一下各條路的權重和，找到最小的。 有些奇怪
標簽： 函數
上傳時間： 2014-01-07
上傳用戶：lijianyu172
Program helping you to remember the route. It cab be route from conference room to coffee-room, it can be tourist trip, it can be pathway in labyrinth. during first traversal you make notes in you phone, specifying direction of movement and target of each step. Phone remembers how much time each steps takes. Then you can just inspect information about this trip and check duration of each stage and the whole trip. You can also replay it in forward and backward direction. So if somebody show you the Shortest way to coffee machine, you can easily find the way back and can repeat this trip in future.
標簽： route coffee-room conference remember
上傳時間： 2014-01-05
上傳用戶：1159797854
There are many algorithms that can be applied to graphs. Many of these are actually used in the real world, such as Dijkstra’s algorithm to find Shortest paths. We will discuss a few here.
標簽： algorithms are actually applied
上傳時間： 2014-01-03
上傳用戶：龍飛艇
matlab有限元網格劃分程序 DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below. One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the Shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods. For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes. Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles. To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
標簽： matlab有限元網格劃分程序
上傳時間： 2015-08-12
上傳用戶：凜風拂衣袖
