نتایج جستجو برای: tree connection

تعداد نتایج: 266924  

1998
Xiaohua Jia Yanchun Zhang Niki Pissinou Kia Makki

There are two major difficulties in real-time multicast connection setup. One is the design of an efficient distributed routing algorithm which optimizes the network cost of routing trees under the real-time constraints. The other is the integration of routing with admission control into one single phase of operations. This paper presents a real-time multicast connection setup mechanism, which ...

2002
Seok Joo Koh Juyoung Park Eunsook Kim Shin-Gak Kang

This paper proposes a new multicast transport protocol, called the Enhanced Communications Transport Protocol (ECTP). The proposed protocol is currently being standardized in the ITU-T SG7 and ISO/IEC JTC 1/SC 6. The ECTP is designed to support tightly controlled multicast connections. The sender is at the heart of one-to-many multicast group communications. The sender is responsible for overal...

Journal: :J. Inf. Sci. Eng. 1999
Kuochen Wang Jun-Hung Chen

In this paper, we propose a dynamic multicast routing algorithm based on probability for multimedia communications in an asynchronous transfer mode (ATM) network environment. For multimedia communications, we not only aim to arrange a transmission path with the minimal cost from a source node to each destination node, but also consider the dynamic multicast situation with node joining/leaving. ...

Journal: :European Journal of Theology and Philosophy 2023

In this essay, I explore the relationship between kabbalistic Tree of Life and that Logic. begin defining my terms, then analyze question posed through science; philosophy; art concept knowledge in general. conclude while a unified complete account cannot be gained, one can get semblance knowledge. This call tending towards infinity or more precisely – calculus infinity. conjecture may lead to ...

2007
Eija Jurvanen Marjo Lipponen

Innnite leaf alphabets provide a new approach to remove the connection between the sizes of the leaf alphabet and the set of states of a tree automaton. Unique minimal tree automata can be constructed for classes of tree automata; however, such a class cannot be nite.

Journal: :Networks 2000
Deying Li Xiufeng Du Xiao-Dong Hu Lu Ruan Xiaohua Jia

In a WDM network under multihop architecture, each link is associated with a set of wavelengths available for channel connections, and in the network, the number of wavelengths that can be used is limited. Data transmission over one wavelength to another requires wavelength conversion, which causes a long delay. Given a multicast connection, routing is to construct a tree for the connection tha...

1991
W. H. Wu L. A. Bergman A. R. Johnston André DeHon Thomas F. Knight

Acknowledgments Tom Knight originally suggested the idea of using fat-tree structures as a means for scaling Transit networks. Tom Knight and Henry Minsky were invaluable for discussion and criticism of these ideas throughout the development process. Discussions with Tom Leighton, Charles Leiserson, and Alex Ishii were valuable to my understanding of the more theoretical aspects of network orga...

2017

The effectiveness and the efficiency of the Wireless Sensor Networks (WSNs) entirely depend on the data accumulation method. Numerous data accumulation methods like multipath, tree, chain, hybrid and cluster topologies are available in the past for accumulating data in WSNs. The subsisting data accumulation methods in the past don’t provide an assured reliable network from the perspective of mo...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید