Scheduling Packet Transmissions in a Multi-hop Packet Switched Network Based on Message Length PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Scheduling Packet Transmissions in a Multi-hop Packet Switched Network Based on Message Length PDF full book. Access full book title Scheduling Packet Transmissions in a Multi-hop Packet Switched Network Based on Message Length by . Download full books in PDF and EPUB format.
Author: Publisher: ISBN: Category : Languages : en Pages : 27
Book Description
This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the second is based on the shortest-remaining-transmit-time principle. We develop simulation models for analyzing the algorithms. The simulations show that when message sizes vary widely, these algorithms can significantly reduce average end-to-end message delays compared to First-Come-First-Serve scheduling.
Author: Publisher: ISBN: Category : Languages : en Pages : 27
Book Description
This paper describes two algorithms for scheduling packets in a multi-hop network. The objective of the algorithms is to reduce end-to-end message (not packet) transmission delays. Both algorithms schedule packet transmissions based on the length of the original message that the packet belongs to. The first algorithm is preemptive and is based on the shortest-message-first principle and the second is based on the shortest-remaining-transmit-time principle. We develop simulation models for analyzing the algorithms. The simulations show that when message sizes vary widely, these algorithms can significantly reduce average end-to-end message delays compared to First-Come-First-Serve scheduling.
Author: Publisher: ISBN: Category : Languages : en Pages : 4
Book Description
In the classic transmission scheduling problem, the nodes of a Packed Radio Network (PRN) broadcast fixed-length packets over a common resource (the channel). Packet transmissions are subject to interference constraints; for example, if a node is transmitting a packet, then all adjacent (neighboring) nodes must refrain from transmission. One then adopts a slotted time model where every slot is allocated to a set of nodes which can simultaneously transmit without conflict. Thus, a node is generally belongs to one or more of these sets(called transmission sets). Our approach is based on viewing the transmission scheduling problem as a single server multiclass polling problem with simultaneous resource possession. Here, a class corresponds to a transmission set. The server corresponds to a channel operating with deterministic service times: a service time is equal to one time slot required for transmitting a packet. The scheduling problem is then equivalent to assigning the server (equivalently, each time slot) to a particular transmissions set. The simultaneous resource possession feature arises because the server is assigned to a transmission set, i.e. it can simultaneously provide service to packets from all nodes which belong to that set. The construction of the transmission set is dependent upon the topology and connectivity of the PRN and is equivalent to a graph partitioning problem. For our purposes, we assume M transmission sets have been specified. Finally, we allow for overlapping transmission sets, i.e. a node can belong to two or more difference transmission sets.
Author: Swapan Bhattacharyya Publisher: Springer ISBN: 9811039534 Category : Technology & Engineering Languages : en Pages : 617
Book Description
The book is a collection of peer-reviewed scientific papers submitted by active researchers in the International Conference on Industry Interactive Innovation in Science, Engineering and Technology (I3SET 2016). The conference is a collective initiative of all departments and disciplines of JIS College of Engineering (an autonomous institution), Kalyani, West Bengal, India. The primary objective of the conference is to strengthen interdisciplinary research and encourage innovation in a demand-driven way as desired by the industry for escalating technology for mankind. A galaxy of academicians, professionals, scientists, industry people and researchers from different parts of the country and abroad shared and contributed their knowledge. The major areas of I3SET 2016 include nonconventional energy and advanced power systems; nanotechnology and applications; pattern recognition and machine intelligence; digital signal and image processing; modern instrumentation, control, robotics and automation; civil engineering and structural design; real-time and embedded systems, communication and devices; advanced optimization techniques; biotechnology, biomedical instrumentation and bioinformatics; and outcome based education.
Author: Peng-Jun Wan Publisher: American Mathematical Soc. ISBN: 0821810049 Category : Computers Languages : en Pages : 265
Book Description
A response to the exhaustion of fiber-optic cable network capacity for digital telecommunication and the resulting shift from time-division multiplexing (TDM) to wavelength-division multiplexing (WDM) to add capacity, and the rapid sales of the new technology. Theorists and practitioners in computer science present 17 papers applying theoretical and algorithmic results to such practical problems as admissions control, routing and channel assignments, multicasting and protection, and fault-tolerance. No index. Annotation copyrighted by Book News, Inc., Portland, OR.
Author: Jong-Hoon Youn Publisher: ISBN: Category : Mobile communication systems Languages : en Pages : 19
Book Description
In this paper, based on coding theory concepts, new time scheduling algorithms for multihop packet radio networks are described. Each mobile host is assigned a word from an appropriate constant weight code of length n, distance d and weight w. The host can send a message at the j[superscipt th] slot provided the assigned code has a 1 in this j[superscipt th] bit. The proposed algorithms are better than the previously known algorithms in terms of minimum system throughput and/or delay bound. The algorithms also preserve other desired properties, such as topology independence, guaranteed minimum throughput, bounded maximum delay, and fair transmission policy. In the simulation, we measure the average system throughput of transmission scheduling algorithms. The simulation results show that the proposed algorithms outperform the previously known algorithms in terms of mean system throughput.
Author: Peng-Jun Wan Publisher: American Mathematical Soc. ISBN: 9780821870907 Category : Technology & Engineering Languages : en Pages : 268
Book Description
Time division multiplexing (TDM) has been the fundamental basis for adding capacity to digital telecommunications networks for decades. However, within the past two years, wavelength division multiplexing (WDM) has been emerging as an important and widely deployed complement to TDM. Sales of systems based on the new technology have risen at breathtaking speed. The driving force behind this sales explosion was the unexpected rapid exhaustion of long distance fiber network capacity. This fiber exhaust, combined with favorable economics for WDM, led to the use of this technology over other alternatives. The WDM deployment raises fundamental and challenging problems that require novel and innovative solutions. This volume presents papers from an interdisciplinary workshop held at DIMACS on multichannel optical networks. Leading computer science theorists and practitioners discussed admissions control, routing and channel assignment, multicasting and protection, and fault-tolerance. The book features application of theoretical and/or algorithmical results to practical problems and addresses the influence of practical problems to theoretical/algorithmic studies. The volume can serve as a text for an advanced course in computer science, networking, and operations research.
Author: Parth H. Pathak Publisher: Springer Science & Business Media ISBN: 1461446279 Category : Technology & Engineering Languages : en Pages : 226
Book Description
“Designing for Network and Service Continuity in Wireless Mesh Networks” describes performance predictability of the new wireless mesh network paradigm, and describes considerations in designing networks from the perspective of survivability and service continuity metrics. The work provides design insights for network design researchers and industry professionals. It includes designs for new mesh networks and extensions of existing networks with predictable performance.
Author: Akbar G. Rahbar Publisher: John Wiley & Sons ISBN: 1119056853 Category : Science Languages : en Pages : 451
Book Description
This book is a comprehensive study on OPS networks, its architectures, and developed techniques for improving its quality of switching and managing quality of service. The book includes: Introduction to OPS networks, OOFDM networks, GMPLS-enabled optical networks, QoS in OPS networks Hybrid contention avoidance/resolution schemes in both long-haul and metro optical networks Hybrid optical switching schemes
Author: 
Author: 
Author: Eytan Modiano
Author: 
Author: Swapan Bhattacharyya
Author: Peng-Jun Wan
Author: Jong-Hoon Youn
Author: Peng-Jun Wan
Author: Ye Bao
Author: Parth H. Pathak
Author: Akbar G. Rahbar