Matches in SemOpenAlex for { <https://semopenalex.org/work/W2243370768> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W2243370768 abstract "Many services envisaged for B-ISDN and ATM networks involve point-to-multipoint working. Multipoint services with many recipients can impose a much heavier burden on the network than simple point-to-point services, so multicast routing should aim to minimise their demand on the network. Many B-ISDN services are also delay-sensitive. Appropriate multicast routing algorithms for ATM networks are therefore subject to two constraints: they must be economic in their use of network resources and they should offer a delay bound for all recipients. To date, most work on multicast routing algorithms has concerned minimising the total cost of a multicast tree; this problem is known to be NP-complete, being the Steiner tree problem. Combining minimal cost with bounded delay is therefore also an NP-complete problem. Our approach to a heuristic for both constraints works as follows. First, a delay bound is found using Dijkstra's algorithm, which also gives the edges of the original network graph available to a bounded delay solution. An iterative techniques is then used to reduce this graph to a low-cost tree. The paper presents preliminary results comparing our heuristic with solutions obtained using Dijkstra's algorithm alone for delays (which generally gives a high-cost solution) and a heuristic for a low-cost solution based in the Minimum Spanning Tree approach (which in general can give high delays). In both cases, our heuristic performs well. We also compare it with some of our earlier work in which the cost metric was proportional to delay. A reasonably simple solution can be found under this assumption using a minor change to the normal coding of Dijkstra's algorithm." @default.
- W2243370768 created "2016-06-24" @default.
- W2243370768 creator A5070638561 @default.
- W2243370768 date "1994-07-01" @default.
- W2243370768 modified "2023-09-26" @default.
- W2243370768 title "A new heuristic for ATM multicast routing" @default.
- W2243370768 hasPublicationYear "1994" @default.
- W2243370768 type Work @default.
- W2243370768 sameAs 2243370768 @default.
- W2243370768 citedByCount "5" @default.
- W2243370768 countsByYear W22433707682014 @default.
- W2243370768 crossrefType "journal-article" @default.
- W2243370768 hasAuthorship W2243370768A5070638561 @default.
- W2243370768 hasConcept C120314980 @default.
- W2243370768 hasConcept C126255220 @default.
- W2243370768 hasConcept C132525143 @default.
- W2243370768 hasConcept C154945302 @default.
- W2243370768 hasConcept C173801870 @default.
- W2243370768 hasConcept C173870130 @default.
- W2243370768 hasConcept C192059732 @default.
- W2243370768 hasConcept C22590252 @default.
- W2243370768 hasConcept C31258907 @default.
- W2243370768 hasConcept C32295351 @default.
- W2243370768 hasConcept C33923547 @default.
- W2243370768 hasConcept C41008148 @default.
- W2243370768 hasConcept C44892269 @default.
- W2243370768 hasConcept C76220878 @default.
- W2243370768 hasConcept C80444323 @default.
- W2243370768 hasConceptScore W2243370768C120314980 @default.
- W2243370768 hasConceptScore W2243370768C126255220 @default.
- W2243370768 hasConceptScore W2243370768C132525143 @default.
- W2243370768 hasConceptScore W2243370768C154945302 @default.
- W2243370768 hasConceptScore W2243370768C173801870 @default.
- W2243370768 hasConceptScore W2243370768C173870130 @default.
- W2243370768 hasConceptScore W2243370768C192059732 @default.
- W2243370768 hasConceptScore W2243370768C22590252 @default.
- W2243370768 hasConceptScore W2243370768C31258907 @default.
- W2243370768 hasConceptScore W2243370768C32295351 @default.
- W2243370768 hasConceptScore W2243370768C33923547 @default.
- W2243370768 hasConceptScore W2243370768C41008148 @default.
- W2243370768 hasConceptScore W2243370768C44892269 @default.
- W2243370768 hasConceptScore W2243370768C76220878 @default.
- W2243370768 hasConceptScore W2243370768C80444323 @default.
- W2243370768 hasLocation W22433707681 @default.
- W2243370768 hasOpenAccess W2243370768 @default.
- W2243370768 hasPrimaryLocation W22433707681 @default.
- W2243370768 hasRelatedWork W1642957770 @default.
- W2243370768 hasRelatedWork W1828114673 @default.
- W2243370768 hasRelatedWork W1954856029 @default.
- W2243370768 hasRelatedWork W1975290397 @default.
- W2243370768 hasRelatedWork W2006322807 @default.
- W2243370768 hasRelatedWork W2014113465 @default.
- W2243370768 hasRelatedWork W2033350901 @default.
- W2243370768 hasRelatedWork W2074919325 @default.
- W2243370768 hasRelatedWork W2095788461 @default.
- W2243370768 hasRelatedWork W2118720071 @default.
- W2243370768 hasRelatedWork W2127240180 @default.
- W2243370768 hasRelatedWork W2139426038 @default.
- W2243370768 hasRelatedWork W2142564250 @default.
- W2243370768 hasRelatedWork W2152950844 @default.
- W2243370768 hasRelatedWork W2160272630 @default.
- W2243370768 hasRelatedWork W2171979579 @default.
- W2243370768 hasRelatedWork W2352286670 @default.
- W2243370768 hasRelatedWork W2352840430 @default.
- W2243370768 hasRelatedWork W2527549211 @default.
- W2243370768 hasRelatedWork W2556632273 @default.
- W2243370768 isParatext "false" @default.
- W2243370768 isRetracted "false" @default.
- W2243370768 magId "2243370768" @default.
- W2243370768 workType "article" @default.