Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,669
Table 1. Some physical layer characteristics of Bluetooth and HiperLAN/2
2003
"... In PAGE 2: ... The research is carried out by two chairs of the University of Twente: the IC-Design group which focusses on the analog part and the chair Signals and Systems on the digital part. Table1 shows some characteristics of the physical layer of both standards. HiperLAN/2 is a high-speed Wireless LAN (WLAN) standard using Orthogonal Frequency Divi- sion Multiplexing (OFDM).... ..."
Cited by 7
Table 6.2: End-user languages considered. C++ support indicates how easy the lan- guage interfaces with C++ objects. Speed is a general indication of execution speed. Syntax is an estimate of how hard the language syntax is for a non-programmer. Size is the size of the required runtime code and libraries.
Table 1: Wireless LAN Performance for Various Datagram Sizes
1998
"... In PAGE 6: ... On the other hand, the simple framing strategy of one TCP segment mapping to one IP datagram, which is mapped to one wireless LAN frame, requires a constantoverhead of 66 bytes per frame #28since a minimal TCP header takes 20 bytes#29. Adjusting existing UDP measurements #5B38#5D for TCP overheads, we showin Table1 that by reducing the frame size, the increase in header overhead more than balances the scale. Regardless of transmission speed #5B38#5D, the nominal usable throughput at the link layer is maximized with 1388 byte frames, and is roughly 94#25 of the link capacity.... ..."
Cited by 2
Table 1. Performance test of single user
"... In PAGE 5: ... a) Performance of single client under various network conditions A client sends a request of 3D image rotate operation to the Visualization Server through LAN(10BaseT) and ISDN(64K), and receives JPEG image (400x400) from the Visualization Server. Table1 shows the result of this test. A Comparison of network speed between LAN and ISDN, the network speed of LAN is about 400 times that of ISDN.... ..."
Table 11: The network usage classes for some ViewStation application components. future networks must support tra c patterns that are at least as bursty as those on present-day LANs, at speeds and burst sizes that are orders of magnitude larger. The presence of bursty tra c may have signi cant implications with respect to the distribution of memory bu ers across the network, and the presence of short subsessions may a ect the design of network signaling systems. If network tra c is fundamentally bursty even at large bit-rates, then high-speed networks must be designed to support higher peaks in load than if the tra c is less bursty. Except for backbone networks that support highly aggregated tra c, gigabit network designers should not plan for high utilization, but instead should accommodate highly variable loads, especially during peak busy hours.
"... In PAGE 30: ... Although some continuous bit rate (CBR) and predictable variable bit rate (VBR) components may remain they will be relatively insigni cant. Table11 categorizes the network usage for the capture and browsing components of the ViewStation applications we have developed. The table indicates the video data format, network tra c type, bits transferred, subsession duration, and subsession frequency for example application components.... ..."
Table 1: Wireless LAN Performance for Various Datagram Sizes Datagram Payload (bytes) Datagram Error Rate (%) Overhead (%) Throughput (%)
1998
"... In PAGE 6: ... On the other hand, the simple framing strategy of one TCP segment mapping to one IP datagram, which is mapped to one wireless LAN frame, requires a constant overhead of 66 bytes per frame (since a minimal TCP header takes 20 bytes). Adjusting existing UDP measurements [38] for TCP overheads, we show in Table1 that by reducing the frame size, the increase in header overhead more than balances the scale. Regardless of transmission speed [38], the nominal usable throughput at the link layer is maximized with 1388 byte frames, and is roughly 94% of the link capacity.... ..."
Cited by 2
Table 1. Speeding up group operations on hyperelliptic curves of genus two.
2003
"... In PAGE 3: ... There was also some effort to find explicit formulae to perform the group operation for HECC without using inversions for genus-2 curves [Lan02b,Lan02c]. Table1 summarizes the efforts made to date to speed up genus-2 curves. In Table 1, I refers to inversion, M to multiplication, S to squaring, and M=S to multiplications or squarings, since squarings are assumed to be of the same complexity as a multiplication in these publications.... ..."
Cited by 35
Table 1. Speeding up group operations on hyperelliptic curves of genus two.
"... In PAGE 3: ... There was also some effort to find explicit formulae to perform the group operation for HECC without using inversions for genus-2 curves [Lan02b,Lan02c]. Table1 summarizes the efforts made to date to speed up genus-2 curves. In Table 1, I refers to inversion, M to multiplication, S to squaring, and M/S to multiplications or squarings, since squarings are assumed to be of the same complexity as a multiplication in these publications.... ..."
Table 3. Employed Machine Models. In Table 1 and Table 2 we presented those two measurements of our experiments with the maximum number of machines. Since a network of several hundred machines permanently changes its con guration, it is impossible to get a xed number of machines with reproducable load situation for reference measurements. We had hands on about 1,000 machines but typically about 20% of them were shut down. Most of the LANs we used had processor idle percentages of at least 90% of the time when our parallel application did not run. Such values are very common as we also con rmed by logging CPU idle percentage data in our LAN for a period of several months. This average utilization remains almost constant from our experience, although the utilization of individual workstations varies permanently. However, some LANs with high speed workstations were heavily loaded with parallel cluster applications.
1993
"... In PAGE 8: ... Table3 shows the di erent machine models which have been incorporated in our con guration. There have been various di erent types of most machine models and even more di erent UNIX operating system versions.... ..."
Cited by 11
Table 2. Performance of ATM and two traditional LAN technologies under a simple RPC protocol. RPC time ( s)
1996
"... In PAGE 3: ... Table2 shows the results presented in [13], where the latency experienced by a lightweight RPC (Remote proce- dure Call) protocol is analyzed with Ethernet, FDDI and ATM, as before. In particular, the different contributions to latency are separately studied, and two sizes of messages have been considered, which are labeled short and long .... In PAGE 3: ... In particular, the different contributions to latency are separately studied, and two sizes of messages have been considered, which are labeled short and long . The speed improvements achieved by each contribution to latency with respect to the performance over Ethernet have been included in Table2 . These results show that the 14- /19-foldbandwidthincrement of ATM results in an effective speed increase of a factor of only 2, highlighting the influ- ence of both hardware and software concerns in addition to the networkingtechnologyitself.... ..."
Cited by 4
Results 1 - 10
of
9,669
