Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
18
Efficient Bandwidth Allocation in Directed Optical Fibre Trees
"... We present improved bounds for efficient bandwidth allocation in a WDM optical network whose topology is that of a directed tree of fibre-optic links. The problem of bandwidth allocation is modelled as a colouring problem, where each path in a set of communication paths must be assigned a colour (re ..."
Abstract
- Add to MetaCart
We present improved bounds for efficient bandwidth allocation in a WDM optical network whose topology is that of a directed tree of fibre-optic links. The problem of bandwidth allocation is modelled as a colouring problem, where each path in a set of communication paths must be assigned a colour
Call Scheduling in Trees, Rings and Meshes
- In Proc. of HICSS
, 1997
"... The problem of establishing and completing a given set of calls as early as possible is studied for bidirectional and directed calls in various classes of networks. Even under the assumption of unit bandwidth requirements and unit call durations, call scheduling is NP–hard for trees with unbounded d ..."
Abstract
-
Cited by 32 (5 self)
- Add to MetaCart
The problem of establishing and completing a given set of calls as early as possible is studied for bidirectional and directed calls in various classes of networks. Even under the assumption of unit bandwidth requirements and unit call durations, call scheduling is NP–hard for trees with unbounded
Bandwidth Optimal All-reduce Algorithms for Clusters of Workstations
"... We consider an efficient realization of the all-reduce operation with large data sizes in cluster environments, under the assumption that the reduce operator is associative and commutative. We derive a tight lower bound of the amount of data that must be communicated in order to complete this operat ..."
Abstract
- Add to MetaCart
this operation and propose a ring-based algorithm that only requires tree connectivity to achieve bandwidth optimality. Unlike the widely used butterfly-like all-reduce algorithm that incurs network contention in SMP/multi-core clusters, the proposed algorithm can achieve contention-free communication in almost
Improved Heuristics for static Wavelength Assignment in Undirected Rings and Tree of Rings
"... Abstract. In All-Optical networks it is crucial to optimize the use of the avail-able bandwidth resource. We consider the static wavelength assignment problem in all-optical Rings and Tree of Rings without wavelength conversion, and de-vise new wavelength assignment heuristics. In turn, we perform e ..."
Abstract
- Add to MetaCart
Abstract. In All-Optical networks it is crucial to optimize the use of the avail-able bandwidth resource. We consider the static wavelength assignment problem in all-optical Rings and Tree of Rings without wavelength conversion, and de-vise new wavelength assignment heuristics. In turn, we perform
1 Long-Reach Optical Access Networks: A Survey of Research Challenges, Demonstrations, and Bandwidth Assignment Mechanisms
"... Abstract—Long-Reach optical access is a promising proposal for future access networks. This technology can enable broadband access for a large number of customers in the access/metro area, while decreasing capital and operational expenditures for the network operator. First, the paper reviews the ev ..."
Abstract
- Add to MetaCart
protection (tree-and-branch, ring-and-spur). Then, some relevant demonstrations of Long-Reach Optical Access Networks developed worldwide by different research institutes are presented. Finally, Dynamic Bandwidth Allocation (DBA) algorithms that allow to mitigate the effect of the increased control
Performance Assessment and Comparison between Star-ring based and Tree based EPONs
"... Abstract—In this paper, a meaningful star-ring based EPON architecture is proposed to reduce the local traffic transmitted from ONUs (Optical Network Units) to OLT (Optical Line Terminal) which can provide the bandwidth efficiency. One of ONUs is assigned as a Sub-OLT to control the partial traffic ..."
Abstract
- Add to MetaCart
’s EF traffic and Sub-OLT’s traffic by tree topology; and the RDBA (ring dynamic bandwidth allocation) in Sub-OLT handles all AF and BE traffics from each ONU circulated along the ring topology. Simulation results show that the proposed scheme bandwidth efficiency, and reduces traffic delay even system
Wavelength Assignment Algorithms for WDM Optical Networks
, 2003
"... The explosive growth of the Internet and bandwidth-intensive applications such as video-ondemand and multimedia conferences require high-bandwidth networks. The current highspeed electronic networks cannot provide such capacity. Optical networks offer much higher bandwidth than traditional networks. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
. When employed with the wavelength division multiplexing (WDM) technology, they can provide the huge bandwidth needed. The tree of rings is a popular topology which can often be found in WDM networks. In this thesis, we first study wavelength assignment (WA) algorithms for trees of rings. A tree of
The Complexity of Path Coloring and Call Scheduling
- Theoretical Computer Science
, 2000
"... Modern high-performance communication networks pose a number of challenging problems concerning the efficient allocation of resources to connection requests. In all-optical networks with wavelength-division multiplexing, connection requests must be assigned paths and colors (wavelengths) such that i ..."
Abstract
-
Cited by 28 (5 self)
- Add to MetaCart
) such that intersecting paths receive different colors, and the goal is to minimize the number of colors used. This path coloring problem is proved NP-hard for undirected and bidirected ring networks. Path coloring in undirected tree networks is shown to be equivalent to edge coloring of multigraphs, which implies a
Routing and Broadcasting in Ad-Hoc Networks
"... I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present ..."
Abstract
- Add to MetaCart
I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present
New Techniques for Geographic Routing
, 2006
"... As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but ..."
Abstract
- Add to MetaCart
As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing
Results 1 - 10
of
18
