J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....based on such an approach would not be stable and could not guarantee a maximum delay for a system to acquire a data channel. Because of the desirability of providing channel assignment delay guarantees, we designed our etiquette using a deterministic tree splitting collision resolution algorithm [2] tailored for the case in which the number of systems competing for the available data channels is finite. Fig. 1 shows an example of an etiquette frame with three channelcontrol periods suitable for a band with three data channels. Let # be the maximum propagation time for systems in the band, ....

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

....the channel to collapse, bringing the flow of data packets to a halt when no new data transmission queues can be started. A way to stabilize the system is by increasing the retransmission delays. Several stable MAC protocols have been proposed in the past based on tree splitting algorithms (e.g. [7, 10, 18]) Those protocols in which data packets are used to resolve collisions achieve throughput below 0.6 [24] More recent MAC protocols have been proposed that implement collision resolution using either control packets that are much smaller than data packets, or are based on the ability of the ....

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol. IT-25, pp. 505-515, Sept. 1979.

....[7] 9] Clearly, the backoff also reduces the likelihood of a collision in the case of multiple newcomer stations. If two or more stations transmit requests in the same contention slot, the headend executes a CRP, which, in the case of the 802.14 MAC, is a blocking ternary tree algorithm [3] [4], 15] Blocking refers to the restriction that newcomer stations may not transmit in CS designated by the headend for the The protocol is actually a variable n ary stack algorithm. The default value of n is 3, and for simplicity of presentation, we will use the default value. resolution ....

J. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol. IT-25, pp. 505--515, Sept. 1979.

....where a 1, Slotted Aloha or scheduling protocols remain as the main options [5] The Aloha protocols, including CSMA, have a basic rule that ready stations continue to retransmit after collisions, subject to back off rules, until successful. The tree protocols based upon the work of Capetanakis [6] block all new arrivals after a collision occurs. The best of the tree protocols provides a throughput of 0.487 [7] but they have not proved practical. Control minislots were introduced into the tree protocols with the goal of reducing the occurrence of collisions in the dataslot and on paper ....

J. Capetanakis, "Tree algorithm for a packet broadcasting channel," IEEE Trans. Inform. Theory, Vol. IT-25, pp. 505-515, Sept. 1979.

....based on such an approach would not be stable and could not guarantee a maximum delay for a system to acquire a data channel. Because of the desirability of providing channel assignment delay guarantees, we designed our etiquette using a deterministic tree splitting collision resolution algorithm [1] tailored for the case in which the number of systems competing for the available data channels is finite. Fig. 1 shows an example of an etiquette frame with three channel control periods suitable for a band with three data channels. Let # be the maximum propagation time for systems in the band, ....

J.I. Capetanakis, Tree algorithm for packet broadcasting channel, IEEE Trans. Inform. Theory IT-25 (1979) 505--515.

....where a 1, Slotted Aloha or scheduling protocols remain as the main options [7] The Aloha protocols, including CSMA, have a basic rule that ready stations continue to retransmit after collisions, subject to back off rules, until successful. The tree protocols based upon the work of Capetanakis [8] block all new arrivals after a collision occurs. The best of the tree protocols provides a throughput of 0.487 [9] but they have not proved practical. Control minislots were introduced into the tree protocols with the goal of reducing the occurrence of collisions in the dataslot and on paper ....

J. Capetanakis, "Tree algorithm for a packet broadcasting channel," IEEE Trans. Inform. Theory, Vol. IT-25, pp. 505-515, Sept. 1979 .

....methods use contention resolution schemes such as ALOHA to resolve the collision among multiplecable modems. However, the schemes could be more complicated if one wants to obtain high throughput in broadcasting channels with long propagation delay, i.e. using the tree resolution algorithm [9]. Meanwhile, standardization activity has been undertaken by IEEE 802.14 project [10] and DAVIC (Digital Audio Visual Council) 11] It usually takes a long time for the standard process to be formally finalized. And even the standard having been released, it is quite uncertain whether the ....

T. Capetanakis, "Tree Algorithm for a Packet Broadcasting Channel", IEEE Transactions on InformationTheory, Vol. IT-25, Sept. 1979, pp. 505-515.

....methods use contention resolution schemes such as ALOHA to resolve the collision among multiple cable modems. However, the schemes could be more complicated if one wants to obtain high throughput in broadcasting channels with long propagation delay, i.e. using the tree resolution algorithm [9]. Meanwhile, standardization activity has been undertaken by IEEE 802.14 project [10] and DAVIC (Digital Audio Visual Council) 11] It usually takes a long time for the standard process to be formally finalized. And even the standard having been released, it is quite uncertain whether the ....

T. Capetanakis, "Tree Algorithm for a Packet Broadcasting Channel", IEEE Transactions on Information Theory, Vol. IT-25, Sept. 1979, pp. 505-515.

....suffer collisions again in the second cycle of the process. Again, those stations colliding in the second minislot drop out until the stations competing for the first minislot resolve. The resolution process is very similar to the tree resolution algorithm proposed as an enhancement to Ethernet [3]. During the contention resolution process all stations must track the process at each stage. Failure to do so, even by a station not making a request, would prevent the station from joining the reservation process at a later stage as it would not know when a cycle was completing and thus when it ....

Capetanakis, T. "Tree Algorithm For a Packet Broadcasting Channel", IEEE Transacation Information Theory, Vol, IT-25, pp. 505-515, September, 1979.

....also reduces the likelihood of a collision in the case of multiple newcomer stations. If two or more stations transmit requests in the same contention slot, the headend executes a Collision Resolution Protocol (CRP) which, in the case of the 802.14 MAC, is a blocking ternary tree algorithm [3] [4], 15] 1 Blocking refers to the restriction that newcomer stations may not transmit in CS designated by the headend for the resolution of collisions [2] Ternary tree refers to a three way splitting of each collision. A complete review of this and other collision resolution schemes can be ....

J. Capetanakis. Tree Algorithm for Packet Broadcasting Channel. IEEE Transactions on Information Theory, IT25: 505--515, Spetember 1979.

....packets increases and throughput in the system drops. A way to stabilize the operation of contention based protocols is by means of collision resolution mechanisms. Several stable MAC protocols have been proposed in the past based on tree splitting algorithms for collision resolution (e.g. [4], 7] 20] Those protocols in which data packets are used to resolve collisions achieve throughput below 0:6 [22] for a single channel and fully connected networks. Several MAC The work at UCSC was supported in part by the Defense Advanced Research Projects Agency (DARPA) under grant ....

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

....based on such an approach would not be stable and could not guarantee a maximum delay for a system to acquire a data channel. Because of the desirability of providing channel assignment delay guarantees, we designed our etiquette using a deterministic tree splitting collision resolution algorithm [2] tailored for the case in which the number of systems competing for the available data channels is finite. Fig. 1 shows an example of an etiquette frame with three channelcontrol periods suitable for a band with three data channels. Let be the maximum propagation time for systems in the band, ....

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

....required to resolve collisions, differentiating among steps involving collisions, successful transmissions, and idle times, and upper bounds on these averages. These bounds extend prior results on tree splitting algorithms, which focused on the total number of steps needed for collision resolution [4,15]. The importance of the bounds we present is that they are independent of the number of stations in the network; Section 4 uses them to compute lower bounds of the average throughput achieved by CARMA when a very large population of nodes is assumed. We show that the throughput achieved by CARMA ....

....acquire the floor are much smaller than the data packet trains sent by stations. Our analysis of the average number of collisions and idle steps needed to resolve m collisions in a net of n nodes extends prior work on collision resolution, which focused in the total average number of steps needed [4]. Obtaining these results is essential to the accurate analysis of MAC protocols in which control packets used to resolve collisions have different length than data packets. Appendix Proof of Theorem 3.1. It is trivial to show that C(n; 0) and C(n; 1) equal 0 for all n 1. If we have two ....

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

....packets increases and throughput in the system drops. A way to stabilize the operation of contention based protocols is by means of collision resolution mechanisms. Several stable MAC protocols have been proposed in the past based on tree splitting algorithms for collision resolution (e.g. [4], 7] 20] Those protocols in which data packets are used to resolve collisions achieve throughput below 0:6 [22] for a single channel and fully connected networks. Several MAC The work at UCSC was supported in part by the Defense Advanced Research Projects Agency (DARPA) under grant ....

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

....2 to collapse, bringing the flow of data packets to a halt when no new data transmission queues can be started. A way to stabilize the system is by increasing the retransmission delays. Several stable MAC protocols have been proposed in the past based on tree splitting algorithms (e.g. [5,8,14]) Those protocols in which data packets are used to resolve collisions achieve throughput below 0:6 [20] More recent MAC protocols have been proposed that implement collision resolution using either control packets that are much smaller than data packets, or are based on the ability of the ....

....is used in CARMA NTQ, a collision, an idle time, and a successful RTS CTS exchange all last different times and contribute differently to the protocol overhead. Previous results on the number of steps needed for collision resolution in tree slitting protocols focus on the total number of steps [5,8,14], rather than on computing the number of idle steps, collision steps, and success steps (one for first success) Section 3 provides new upper bounds on the number of idle steps and collision steps required by a deterministic tree splitting algorithm to resolve collisions up to the first successful ....

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

....busy transmitting. A way to stabilize the system is by increasing the retransmission delays. However, a more efficient way can be devised by using collision resolution. Several stable MAC protocols have been proposed in the past based on tree splitting algorithms for collision resolution (e.g. [9, 17, 40]) In these protocols data packets are used to resolve collisions achieving throughputs below 0:6 [55] for a single channel and fully connected networks. The focus of this dissertation is the design and analysis of MAC protocols that mitigate multiple access interference by means of two basic ....

....and analyzes the throughput achieved by the deterministic treesplitting algorithm assuming a slotted channel. We first compare our results with the slotted ALOHA results presented by Roberts [44] We then review the probabilistic tree splitting algorithm proposed independently by Capetanakis [9], Tsybakov and Mikhailovic [54] and Hayes [27] We show that the average number of steps required by the probabilistic treesplitting collision resolution protocol is greater than the average number of steps required by the deterministic version of the tree splitting protocol. The analysis shows ....

[Article contains additional citation context not shown here]

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

....of errors users lose the global state which can lead to a deadlock situation due to the lack of synchronization. Deadlock problems can only be recovered with a centralized recovery scheme. Properties Maximum Bounded Algorithm # Sensing Feedback Throughput CRI Stable Robustness DPD Tree[3] Static Tree Full Ternary 0.346 YES YES Poor NO Dynamic Tree 0.43 q = 3, fair coin) Stack[23] Full Binary 0.366204 YES YES Poor NO q = 2 p = 0.582492 Stack[23] Full Ternary 0.38126 YES YES Poor NO q = 3, fair coin) Stack[23] Limited Binary 0.401599 NO NO Good NO q = 3 pq = 0.370911 Stack [23] ....

....identifier. The H E includes in the poll message two parameters (n; m) All stations with identifier that satisfies the following expression can transmit: station identifier DIV 2 n = m This algorithm is a limited sensing implementation of the binary tree scheme with interference of new users [3] . To support multiple traffic a frame of 6ms length is defined. The frame structure includes a CBR, VBR RT, VBR NRT, ABR and UBR regions followed by the individual polling messages for next frame in addition to the retry poll for inactive stations. The CBR and VBR RT traffic are polled every ....

J. I. Capetanakis "Tree Algorithm for Packet Broadcasting Channel" IEEE Trans. Inform. Theory, Vol. IT-25, pp.505-515, September 1979.

No context found.

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

No context found.

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

No context found.

J.I. Capetanakis, "Tree algorithm for packet broadcasting channel," IEEE Trans. Inform. Theory, vol.IT-25, pp. 505-515, Sept. 1979.

No context found.

J. I. Capetanakis, "Tree Algorithm for Packet Broadcasting Channel", IEEE Trans. Inform. Theory, vol. IT.25, pp. 505-515, September 1979.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC