Germany-wide DWDM field trial: transparent connection of a long haul link and a multiclient metro network

Richter, A.; Bock, H.; Fischler, W.; Leisching, P.; Krummrich, Peter M.; Mayer, A.; Neuhauser, R.E.; Elbers, Jörg-Peter; Glingener, C.

doi:10.1109/ofc.2001.927912

Cited by 9 publications

(4 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This network has to accommodate to the increase usage of traffic data in the metropolitan area. There were some projects that proposed the architecture of the MAN in a ring topology which were HORNET [Shrikhande et al, 2000], RINGO [Gaudino et al, 2001] and KOMNET [Richter et al, 2001].…”

Section: Graph Topologiesmentioning

confidence: 99%

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

Changaival

Rosalie

Danoy

et al. 2017

Int. J. Bifurcation Chaos

View full text Add to dashboard Cite

Graph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying. The exploration can be considered as a first stepping stone into knowledge extraction from the graph which is now a popular topic. Classical solutions such as Breadth First Search (BFS) and Depth First Search (DFS) require huge amounts of memory for exploring very large graphs. In this research, we present a novel memoryless graph traversal algorithm, Chaotic Traversal (CHAT) which integrates chaotic dynamics to traverse large unknown graphs via the Lozi map and the Rössler system. To compare various dynamics effects on our algorithm, we present an original way to perform the exploration of a parameter space using a bifurcation diagram with respect to the topological structure of attractors. The resulting algorithm is an efficient and nonresource demanding algorithm, and is therefore very suitable for partial traversal of very large and/or unknown environment graphs. CHAT performance using Lozi map is proven superior than the, commonly known, Random Walk, in terms of number of nodes visited (coverage percentage) and computation time where the environment is unknown and memory usage is restricted.

show abstract

Section: Graph Topologiesmentioning

confidence: 99%

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

Changaival

Rosalie

Danoy

et al. 2017

Int. J. Bifurcation Chaos

View full text Add to dashboard Cite

show abstract

“…The network applies a destination-stripping technique, in which the destination marks a slot as an idle slot once it has successfully retrieved the transmitted data. Dual-ring networks [7,8,16,20] have several key advantages compared to their single ring counterparts, including a greater scalability and a higher throughput. Furthermore, dual-ring networks provide an enhanced fault tolerance toward node/fiber failures.…”

Section: Network Architecturementioning

confidence: 99%

“…[6][7][8]Nodes 8,9,10,11,17,28,29,32,36,41,42, and 52 are all assumed to be fully loaded. Figure 6 shows the throughput of each node in the FT 2 -TR 2 system for the case where Jelger's fairness scheme [7] is combined with a destination-stripping mechanism. Under this particular fairness scheme, when a receiver successfully retrieves the data from a slot on its assigned wavelength, it is prevented from immediately reusing the same slot for its next transmission.…”

Section: Figmentioning

confidence: 99%

“…Many studies have investigated appropriate WDM-based network topologies and optical packet switching techniques for metropolitan areas [3][4][5]. WDM metro networks, which typically have either a star [3][4][5] or a ring topology [6][7][8][9][10][11][12][13][14][15], have attracted particular interest due to their potential to support next-generation MANs with huge bandwidth.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Integration of differentiated services with fairness control on a WDM metro ring

Chang

Lin

2006

Photon Netw Commun

View full text Add to dashboard Cite

This study develops a Fair and Efficient Integrated Media Access Control (FEIMAC) protocol, designated FEIMAC, for a wavelength division multiplexing (WDM) dual-ring network known as FT 2 -TR 2 . This system is an extended version of the original unidirectional FT-TR ring architecture, in which the nodes are equipped with a fixed-tuned transmitter and a tunable receiver on each ring. FEIMAC is derived from the Fairness Control with Collision Avoidance (FCCA) protocol proposed in a previous study by the current authors (Chang, W.-R. et al.: FCCA: A reversedirection-based MAC protocol suite for WDM Metropolitan Ring Networks, Proc. of IEEE APCC 05, Perth, Australia, October 2005, pp. 946-950). FCCA is a collision-free medium access control (MAC) protocol, which achieves an efficient exploitation of the available bandwidth while guaranteeing each node a fair access to the network resources. In addition to the capabilities described above, FEIMAC employs a framed approach, in which each frame consists of a "real-time subframe" followed by a "best-effort subframe", to support differentiated services of real-time and best-effort traffic streams. The simulation results demonstrate the effectiveness and efficiency of the proposed integrated protocol.

show abstract

FARE: An efficient integrated MAC protocol for differentiated services in WDM metro rings

Lin

Chang

2007

Computer Communications

View full text Add to dashboard Cite

Germany-wide DWDM field trial: transparent connection of a long haul link and a multiclient metro network

Cited by 9 publications

References 2 publications

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics

Integration of differentiated services with fairness control on a WDM metro ring

FARE: An efficient integrated MAC protocol for differentiated services in WDM metro rings

Contact Info

Product

Resources

About