Wyszukiwarka
Filtry
wszystkich: 21
Wyniki wyszukiwania dla: DISJOINT
-
The hat problem on a union of disjoint graphs
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
An approach to improve the time efficiency of disjoint paths calculation
PublikacjaFailures of network elements can be appropriately dealt with by utilization of alternate disjoint paths to provide redirection of flows affected by failures of the respective working paths. Known approaches can be broadly divided by decision on backup paths installation into proactive and reactive mechanisms, as well as based on the scope of recovery actions into local and global rerouting. There are several important scenarios...
-
Evaluation of time-efficiency of disjoint paths calculation schemes
PublikacjaThe concept of alternate paths has been shown in the literature to provide fast response of a network to failures of its elements (nodes/links) affecting flows along the primary communication paths. Various approaches have been proposed to reduce the time necessary to redirect the respective flows onto the alternate paths. In this paper, we focus on another important objective, that so far has not received much attention, i.e.,...
-
The maximum edge-disjoint paths problem in complete graphs
PublikacjaRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Non-disjoint functional decomposition of index generation functions
Publikacja -
Fundamental Schemes to Determine Disjoint Paths for Multiple Failure Scenarios
PublikacjaDisjoint path routing approaches can be used to cope with multiple failure scenarios. This can be achieved using a set of k (k> 2) link- (or node-) disjoint path pairs (in single-cost and multi-cost networks). Alternatively, if Shared Risk Link Groups (SRLGs) information is available, the calculation of an SRLG-disjoint path pair (or of a set of such paths) can protect a connection against the joint failure of the set of links...
-
Approximation strategies for routing edge disjoint paths in complete graphs
PublikacjaPraca dotyczy problemu ścieżek krawędziowo rozłącznych w nieskierowanych grafach pełnych, dla którego podano nowe algorytmy przybliżone: 3.75-przybliżony (model off-line) i 6.47-przybliżony (model on-line). Stosując podobną metodologię, uzyskano algorytm 4.5-przybliżony (off-line) i 6-przybliżony (on-line) dla problemu routingu i kolorowania ścieżek w grafach pełnych.
-
FDTD Simulations on Disjoint Domains with the Use of Discrete Green's Function Diakoptics
PublikacjaA discrete Green's function (DGF) approach to couple disjoint domains in the finite-difference time-domain (FDTD) grid is developed. In this method, total-field/scattered-field (TFSF) FDTD domains are associated with simulated objects whereas the interaction between them is modeled with the use of the DGF propagator. Hence, source and scatterer are simulated in separate domains and updating of vacuum cells, being of little interest,...
-
On Optimal Backbone Coloring of Split and Threshold Graphs with Pairwise Disjoint Stars
Publikacja -
Discrete Green's function approach to disjoint domain simulations in 3D FDTD method
PublikacjaA discrete Green’s function (DGF) approach to couple 3D FDTD subdomains is developed. The total-field/scattered-field subdomains are simulated using the explicit FDTD method whilst interaction between them is computed as a convolution of the DGF with equivalent current sources measured over Huygens surfaces. In the developed method, the DGF waveforms are truncated using the Hann’s window. The error varies in the range -65 to -40...
-
k-Penalty: A Novel Approach to Find k-Disjoint Paths with Differentiated Path Costs
PublikacjaW artykule rozpatrywany jest problem ochrony dedykowanej na wypadek awarii wielokrotnej elementów sieci teleinformatycznej. Wspomniana ochrona jest możliwa do zapewnienia poprzez wyznaczenie i zainstalowanie zbioru k rozłącznych ścieżek dla każdego żądania. W szczególności rozpatrywany jest problem wyznaczenia k rozłącznych ścieżek w sieciach typu ''multi-cost'', w przypadku których koszt dowolnego łącza może być różny dla każdej...
-
Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Specific Boolean Functions
Publikacja -
Non-disjoint Decomposition Using r-admissibility and Graph Coloring and Its Application in Index Generation Functions Minimization
Publikacja -
Toward Fast Calculation of Communication Paths for Resilient Routing
PublikacjaUtilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari’s approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands...
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublikacjaProtection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...
-
Efficiency of service recovery in scale-free optical networks under multiple node failures
PublikacjaIn this paper we examine the properties of scale-free networks in case of simultaneous failures of two networknodes. Survivability assumptions are as follows: end-to-end path protection with two node-disjoint backup pathsfor each working path. We investigate three models of scale-free networks generation: IG, PFP and BA.Simulations were to measure the lengths of active and backup paths and the values of service recovery time.We...
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublikacjaThis paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...
-
Analysis of radiation and scattering problems with the use of hybrid techniques based on the discrete Green's function formulation of the FDTD method
PublikacjaIn this contribution, simulation scenarios are presented which take advantage of the hybrid techniques based on the discrete Green's function formulation of the finite-difference time-domain (DGF-FDTD) method. DGF-FDTD solutions are compatible with the finite-difference grid and can be applied for perfect hybridization of the FDTD method. The following techniques are considered: (i) DGF-FDTD for antenna simulations, (ii) DGF-based...
-
Disaster-Resilient Routing Schemes for Regional Failures
PublikacjaLarge-scale natural disasters can have a profound effect on the telecommunication services in the affected geographical area. Hence, it is important to develop routing approaches that may help in circumventing damaged regional areas of a network. This prompted the development of geographically diverse routing schemes and also of disaster-risk aware routing schemes. A minimum-cost geodiverse routing, where a minimum geographical...
-
Applications of the discrete green's function in the finite-difference time-domain method
PublikacjaIn this paper, applications of the discrete Green's function (DGF) in the three-dimensional (3-D) finite-difference time-domain (FDTD) method are presented. The FDTD method on disjoint domains was developed employing DGF to couple the subdomains as well as to compute the electromagnetic field outside these subdomains. Hence, source and scatterer are simulated in separate subdomains and updating of vacuum cells, being of little...
-
Quantum-classical calculations of the nanomechanical properties of metals
PublikacjaTradycyjnie symulacje komputerowe układów w skali atomowej prowadzone są przy użyciu klasycznej metody dynamiki molekularnej (MD) bądź kwantowych metod ab initio. Główną wadą ujęcia klasycznego jest jego empiryczna natura, a co za tym idzie - niewielka przenośność, jego prostota natomiast pozwala na przeprowadzanie symulacji układów zawierających miliony atomów. W wyniku zastosowania metod kwantowych otrzymuje się bardziej wiarygodne...