### Table 4: Parameters for the Provoked Broadcast scheme.

2003

Cited by 3

### Table 1. The two parallelisms involved in a single simulation time step Monte Carlo part Poisson part

"... In PAGE 9: ... Beyond 12 processors, this part takes more than 10 % of the total computing time. During potential exchange: the scheme described in Table1 has been modi ed for the SPMD implementation. Each processor broadcasts the potential values to all the processors.... ..."

### Table 1 summarizes the complexities of the minimization problems related to the multicast and the broadcast problems. Even if the situation seems \despairing quot; at the rst glance (most of the 19

"... In PAGE 22: ... However, if minimizing these parameters turn to be a major issue for some speci c reasons, such algorithms should be given. Broadcasting/multicasting Pseudo-matching Sum of the paths lengths NP-complete (Theorem 3) P (Theorem 1) Number of transmitters NP-complete (Property 2) NP-complete (Theorem 6) Load of the transmitters NP-complete (Property 3) NP-complete (Theorem 7) Maximum path length NP-complete (Property 4) NP-complete (Theorem 8) Sum of the maximum paths lengths NP-complete (Property 5) Table1 : Complexities of minimization problems related to the pseudo-matching problem, and to the broadcast and multicast problems Other problems seem to be more important to solve. We indicate below two directions that we are currently investigating: the all-port model.... ..."

### Table 6-l. Message Frequency Categories for Broadcast Systems

"... In PAGE 69: ...2.1 Broadcast Systems: Wide-Area Radio, Cellular Radio, One-Way FM Subcarrier Table6 -l lists the message frequency categories for single-source messages associated with broadcast-type architectures. Single source refers to one equipped vehicle or the TMC.... In PAGE 69: ...2.2 Localized Beacons Table6 -2 contains the single-source message frequency assumptions for architectures using beacons. Single source here refers to a one equipped vehicle, one beacon, or the TMC.... In PAGE 70: ... Table6 -2. Message Frequency Categories Unique to Beacon Systems Single Source Message Frequency Category (once.... In PAGE 71: ...3 SELECTION OF COMMUNICATION SYSTEM PARAMETERS The important communication system and message parameters that were required to calculate communication and processing loads are presented in this subsection. Table6 -3 lists those parameters that describe the operational characteristics of the communication systems, such as the TMC update cycle length. In addition, several parameters that were used in the calcu- lation of message lengths are specified in the lower half of the table.... In PAGE 71: ...Parameter codes listed here are used in the equations in the tables in section 7. Table6 -3 also specifies the values of many of the message length parameters that were originally defined in table 5-2. As indicated in table 6-3, the period of most update cycles was assumed to be five minutes.... In PAGE 72: ...Table6 -3. Communication System Message Parameters and Their Values Parameter Value Units Code1 Basis Link time long update cycle (vehicle routing) 5 minutes Assumed Link time short update cycle (vehicle routing) 1 minutes Assumed TMC update cycle 5 minutes Assumed TMC-beacon processor update cycle 5 minutes Assumed Beacon processor-TMCupdate cycle 5 minutes Assumed UST be sent in Number of links sentin the link-timeshort cters in AssistanceRes Number of links changed in each map update 2 Lu Assumed 1 Parameter codes are used in tables 7-1 through 7-5 in section 7.... In PAGE 73: ... This strategy enables users just beginning their journey to receive critical links in a timely fashion, while still being updated on all reportable links every five minutes. Table6 -4 lists the parameters that describe the characteristics of beacon and cellular radio communication systems. The analysis of the beacon system required assumptions about the number of and spacing between beacons on the highway network.... In PAGE 74: ...Table6 -4. Characteristics of Beacon and Cellular Radio Systems Parameter Value Units Code1 Basis DATA FOR BEACONS Avg.... ..."

### TABLE I PARAMETERS OF THE PARTICLE SWARMS. Parameter Value

### Table 1: Comparisons of analytical performances of various periodic broadcast schemes Technique Worst Delay Max. No. Storage Space Client Disk

"... In PAGE 3: ... Perhaps, it is because some schemes are not implementable using cur- rent technologies. Table1 depicts the analytical performance of Striping Broadcast compared to some existing periodic broadcast schemes for a broadcast of a 2-hour video with the aver- age playback rate of 1.5 Mbps.... In PAGE 3: ... Note that it is not always possible to control the worst service delay to be exactly the desired maximum delay since the worst delay depends on broadcast tech- niques, broadcast parameters, and video characteristics. For each broadcast technique in Table1 , we choose the broadcast parameters such that the worst delay is closest to, but at most the desired maximum delay unless it is not possible for the technique to offer such a delay. 1.... ..."

### Table 7. Number of updates, N

"... In PAGE 11: ... First-Order MultigridScheme As a model for the convergence of the linear im- plicit matrix equation, we consider the multigrid scheme with #14 t = #14 d = ,3 and with various relax- ation schemes. Table7 shows results corresponding to a V#281,0#29 FAS multigrid cycle. Because this partic- ular model is a linear equation with consistent target and driver schemes, the FAS cycle is equivalentto a CS cycle.... In PAGE 11: ... Although not shown here, single-grid cal- culations showed a clear doubling of the number of iterations on each successive mesh re#0Cnement. Second-Order Multigrid Scheme The convergence for the multigrid scheme with no subiterations is shown in Table 8; the parameters are the same as those for the results in Table7 ex- cept that #14 t = 0. There is some dependence of the number of cycles to reach convergence, as expected, because even if we eliminate the factorization errors, there is dependence on the mesh density#28Table 1#29.... ..."

### Table 1. Time (in seconds) spent by different schemes on 100 broadcasts.

2000

"... In PAGE 2: ... Table1 presents the results of running 100 broadcasts for each protocol on the sets of 15, 16, and 63 processing elements (PEs). A new cycle of broadcasting is not started until the previous one is completed.... ..."

Cited by 1

### Table 1. Time (in seconds) spent by different schemes on 100 broadcasts.

"... In PAGE 2: ... Table1 presents the results of running 100 broadcasts for each protocol on the sets of 15, 16, and 63 processing elements (PEs). A new cycle of broadcasting is not started until the previous one is completed.... ..."

### Table 8. Number of updates, N

"... In PAGE 11: ... Although not shown here, single-grid cal- culations showed a clear doubling of the number of iterations on each successive mesh re#0Cnement. Second-Order Multigrid Scheme The convergence for the multigrid scheme with no subiterations is shown in Table8 ; the parameters are the same as those for the results in Table 7 ex- cept that #14 t = 0. There is some dependence of the number of cycles to reach convergence, as expected, because even if we eliminate the factorization errors, there is dependence on the mesh density#28Table 1#29.... ..."