61 |
The Research of Group Assignment in Bluetooth PiconetChen, Chuen-Long 30 June 2001 (has links)
Bluetooth Piconet has become an important area of research and development in the short-range wireless network system. It is well known that bluetooth causes disturbing interference since sharing frequency band is used in communication channels. This thesis proposes a new and efficient method to solve the retransmission problem that occurs in wireless interference. The proposed method is developed based on average transmit times and margin of grouping to find out the grouping rule of the Bluetooth Piconet. A computer simulation shows in this thesis that the performance of the proposed group assignment approach is much bettter than can be obtained by other conventional means. Furthermore, in order to reduce retransmit time and save time-slot, a new packet combine retransmit method is developed based on different reliability of packet's transmit conditions in this thesis. As a consequence, for total duty cycle and time slots, the proposed packet combine retransmit method obtains a better performance than the conventional retransmit method.
|
62 |
WHITE : achieving fair bandwidth allocation with priority dropping based on round trip timesLee, Choong-Soo. January 2002 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: fair active queue management; RED; CSFQ; DRR; round trip time. Includes bibliographical references (p. 53-55).
|
63 |
Differentiated quality of service in packet-switching networks /Wang, Xinyu, January 2001 (has links)
Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (leaves 132-139).
|
64 |
A delay-efficient rerouting scheme for voice over ip trafficKamat, Narasinha. January 2002 (has links)
Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Includes vita. Includes bibliographical references.
|
65 |
Routing protocols in all-optical packet switched networks /Yuan, Xiaochun, January 2002 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2002. / Includes bibliographical references (leaves 98-103).
|
66 |
Addressing the memory bottleneck in packet processing systemsMudigonda, Jayaram 28 August 2008 (has links)
Not available / text
|
67 |
A novel approach to deadlock prevention in store-and-forward networks劉少華, Lau, Siu-wah. January 1991 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
|
68 |
Multimedia communications over mobile packet networksFabri, S. N. January 2001 (has links)
This thesis describes several concepts associated with the transmission of multimedia services over mobile radio access networks. The error performance and traffic requirements of real-time video transmission over the General Packet Radio Services (GPRS) access network and its successor Enhanced-GPRS is examined. In view of this. video error resilience techniques which exploit channel prioritisation mechanisms are introduced with a view to increasing the robustness of received video sequences encoded with MPEG-4 to channel errors. These include stream prioritisation using unequal error protection and region-of-interest prioritisation for use in multiparty communications and streaming applications. A new forward-error correction scheme for EGPRS which uses iterative serially-concatenated convolutional-Reed Solomon codes is designed and is shown to significantly enhance the error performance for real-time services. A study of (he use of backward error correction mechanisms when transmitting streaming multimedia services is carried out, and a new retransmission scheme is introduced to increase the capacity of the radio access network when supporting streaming services
|
69 |
Queues and packet multiplexing networksShalmon, Michael S. January 1985 (has links)
This thesis has to do with certain fundamental queues that are well established as models for delay in simple packet-switching concentrators and networks. We first revisit the single server queue with Poisson arrivals and general independent service times. We then work out a complete delay analysis for a traffic concentrating tandem network of queues with deterministic service and batch Poisson sources connected to every node; this is the most comprehensive analysis available for a network which is not of Jackson type. We also show how to (partially) extend the analysis to a concentrating tree network, and to an arrival process somewhat more general that batch Poisson. / The two parts of the thesis have a close methodological relationship. Our contribution in both cases is to rederive certain known results, and to produce a variety of new ones, using techniques that are essentially qualitative. Our particular view of the stochastic processes in question is guided by a very special queue discipline, namely Last Come First Served preemptive resume; by identifying certain structural features of the sample paths, one can read, almost without calculation, a host of statistics of common interest. The LCFS preemptive resume discipline also enables us: (i) to strengthen the connection between the single server queue with general independent service times and interarrival times, and the fluctuation theory of random walks; (ii) to strengthen the connection between the queue with Poisson arrivals and branching processes.
|
70 |
On the choice of packet size in computer communication networksEvequoz, Claude. January 1986 (has links)
No description available.
|
Page generated in 0.0317 seconds