CORD: contention resolution by delay lines

The implementation of optical packet-switched networks requires that the problems of resource contention, signalling and local and global synchronization be resolved. A possible optical solution to resource contention is based on the use of switching matrices suitably connected with optical delay lines. Signalling could be dealt with using subcarrier multiplexing of packet headers. Synchronization could take advantage of clock tone multiplexing techniques, digital processing for ultra-fast clock recovery, and new distributed techniques for global packet-slot alignment. To explore the practical feasibility and effectiveness of these key techniques, a consortium was formed among the University of Massachusetts, Stanford University, and GTE Laboratories. The consortium, funded by ARPA, has three main goals: investigating networking issues involved in optical contention resolution (University of Massachusetts), constructing an experimental contention-resolution optical (CRO) device (GTE Laboratories), and building a packet-switched optical network prototype employing a CRO and novel signaling/synchronization techniques (Stanford University). This paper describes the details of the project and provides an overview of the main results obtained so far     

Evaluation of the Random Token Protocol for High-Speed and Radio Networks

In high-speed communication networks, the ratio between the end-to-end propagation delay to packet transmission time is large, causing increased scheduling overhead in demand assignment protocols and increased collision probabilities in random access schemes. These lead to rapid degradation of the channel utilization in both channel access control approaches. In this paper, we present a "random token" oriented protocol where channel access is scheduled by random, implicit token passing leading to lower channel access control penalty. By optimally balancing the collision and scheduling penalties, the protocol allows the network to reach better performance than that obtained from random access schemes in networks with and without collision detection, without imposing additional system operational assumptions. Specifically, the random token protocol does not require knowledge of the number of stations, their identities, or synchronization in periods of silence. Therefore, the protocol is also suitable for high-speed networks with frequent reconfiguration and for mobile radio networks.     

Prioritized demand assignment protocols and their evaluation

A class of message-based or station-based priority protocols for demand-assignment-based local area networks (LANs), such as Token Bus, HYPERbus, LCN, etc., is defined. It is shown how existing priority protocols can be represented within this class and how they can be extended for a more efficient realization with regard to both delay and capacity of prioritized channel access in LANs. An analytic approach for analyzing multiple-access systems operating under prioritized demand assignment protocols is introduced. The approach permits the modeling of station-dependent and priority-dependent arrival rates and generally distributed transmission times. The introduced finite-population model is especially appropriate for prioritized systems where the number of users per priority class is typically small and users place different service demands on the system. For modeling systems with large populations of users, an approximate model, which is shown to be significantly more computationally efficient than the exact model without imposing additional modeling restrictions, is introduced     

Performance of Multibeam Packet Satellite Systems with Conflict Free Scheduling

The concept of a multibeam satellite system With on-board processing and memory is studied. In this system multiple slotted ALOHA uplinks carry the traffic to the satellite. Packets are accepted at the satellite, when memory is available, and are routed to their destination zones using a TDM protocol. We present a model which can be used to evaluate a satellite system with conflict-free scheduling, i.e., a system in which several packets can be simultaneously chosen for downlink transmissions, given each earth zone is served by at most one satellite transponder in each slot. We compute the system throughput, packet delays, and buffer overflow probabilities for a general configuration. It is shown that for some configurations the one beam per zone restriction can have a significant effect on the system performance. The presented model can be also used to evaluate satellite systems when this restriction is removed and to evaluate a variety of other satellite systems.     

Energy-conserving access protocols for identification networks

A myriad of applications are emerging, in which energy conservation is a critical system parameter for communications. Radio frequency identification device (RFID) networks, smart cards, and even mobile computing devices, in general, need to conserve energy. In RFID systems, nodes are small battery-operated inexpensive devices with radio receiving/transmitting and processing capabilities, integrated into the size of an ID card or smaller. These identification devices are designed for extremely low-cost large-scale applications, such that the replacement of batteries is not feasible. This imposes a critical energy constraint on the communications (access) protocols used in these systems, so that the total time a node needs to be active for transmitting or receiving information should be minimized. Among existing protocols, classical random access protocols are not energy conserving, while deterministic protocols lead to unacceptable delays. This paper deals with designing communications protocols with energy constraint, in which the number of time slots in which tags need to be in the active state is minimized, while the access delay meets the applications constraints. We propose three classes of protocols which combine the fairness of random access protocols with low energy requirements     

Intermediate-node initiated reservation (IIR): a new signaling scheme for wavelength-routed networks

A problem of many distributed lightpath provisioning schemes is wavelength contention, which occurs when a connection request attempts to reserve a wavelength channel that is no longer available. This situation results from the lack of updated global link-state information at every node. In networks with highly dynamic traffic loads, wavelength contention may seriously degrade the network performance. To overcome this problem, we propose a new framework for distributed signaling and introduce a class of schemes referred to as intermediate-node initiated reservation. In the new scheme, reservations may be initiated at any set of nodes along the route; in contrast, reservations can only be initiated by the destination node in the classic destination initiated reservation (DIR) scheme. As a result, the possibility of having outdated information due to propagation delay is significantly lowered. Specifically, we consider two schemes within this framework, for networks with no wavelength conversion and for networks with sparse wavelength conversion, respectively. Theoretical and simulation results show that, compared with the classic DIR scheme, the new schemes can significantly improve the network blocking performance. The accuracy of the analytical models is also confirmed by extensive numerical simulations.     

Differential service in high-speed interconnection systems: analgorithm for prioritized access

The requirement to connect high-performance components of supercomputer systems has caused an increasing demand for connection-oriented, high-speed communication in a peer-to-peer environment. The importance of this type of communication is underscored by the advent of the high-performance parallel interface (HIPPI) standard, designed to support the commercial development of interconnection systems for this environment. For such interconnection systems, we present a connection management algorithm that supports priorities to provide preferential access for important classes of traffic, and that assures equitable access for all connections within the same priority class. At the same time, the algorithm utilizes the connection resources efficiently and assures low overhead at the nodes. We demonstrate the algorithm's applicability by outlining a centralized as well as a distributed implementation in an HIPPI-based interconnection system. Furthermore, we introduce an analytic priority model that can be used to evaluate an interconnection system's performance under the algorithm. Using this model, we analyze the efficacy of the nonpreemptive priority discipline and show the load/throughput behavior of a typical system     

Interference and traffic aware channel assignment in WiFi-based wireless mesh networks

Wireless mesh networks (WMN) typically employ mesh routers that are equipped with multiple radio interfaces to improve network capacity. The key aspect is to cleverly assign different channels (i.e., frequency bands) to each radio interface to form a WMN with minimum interference. The channel assignment must obey the constraints that the number of different channels assigned to a mesh router is at most the number of interfaces on the router, and the resultant mesh network is connected. This problem is known to be NP-hard. In this paper we propose a hybrid, interference and traffic aware channel assignment (ITACA) scheme that achieves good multi-hop path performance between every node and the designated gateway nodes in a multi-radio WMN network. ITACA addresses the scalability issue by routing traffic over low-interference, high-capacity links and by assigning operating channels in such a way to reduce both intra-flow and inter-flow interference. The proposed solution has been evaluated by means of both simulations and by implementing it over a real-world WMN testbed. Results demonstrate the validity of the proposed approach with performance increase as high as 111%.     

End-to-end QoS framework for heterogeneous wired-cum-wireless networks

With information access becoming more and more ubiquitous, there is a need for providing QoS support for communication that spans wired and wireless networks. For the wired side, RSVP/SBM has been widely accepted as a flow reservation scheme in IEEE 802 style LANs. Thus, it would be desirable to investigate the integration of RSVP and a flow reservation scheme in wireless LANs, as an end-to-end solution for QoS guarantee in wired-cum-wireless networks. For this purpose, we propose WRESV, a lightweight RSVP-like flow reservation and admission control scheme for IEEE 802.11 wireless LANs. Using WRESV, wired/wireless integration can be easily implemented by cross-layer interaction at the Access Point. Main components of the integration are RSVP-WRESV parameter mapping and the initiation of new reservation messages, depending on where senders/receivers are located. In addition, to support smooth roaming of mobile users among different basic service sets (BSS), we devise an efficient handoff scheme that considers both the flow rate demand and network resource availability for continuous QoS support. Furthermore, various optimizations for supporting multicast session and QoS re-negotiation are proposed for better performance improvement. Extensive simulation results show that the proposed scheme is promising in enriching the QoS support of multimedia applications in heterogeneous wired-cum-wireless networks. Ming Li received his B.S. and M.S. in Engineering from Shanghai Jiao Tong University, China, in 1995 and 1998, respectively. He is currently a Ph.D. candidate in department of Computer Science, University of Texas at Dallas, where he received M.S. degree in Computer Science in Dec. 2001. His research interest includes QoSschemes for mobile ad-hoc networks and multimedia over wireless networks. Hua Zhu received the Ph.D. degree in Electrical Engineering from the University of Texas at Dallas, Texas. Since 2005, he has been working for San Diego Research Center, Inc., San Diego, CA, as a Research Engineer. His research interests include all layers of wireless communication systems. His particular interest is in L2/3 air interface design, performance analysis, and optimization for ad hoc and sensor networks. Imrich Chlamtac is the President of CREATE-NET and the Bruno Kessler Professor at the University of Trento, Italy. He has held various honorary and chaired professorships in USA and Europe including the Distinguished Chair in Telecommunications Professorship at the University of Texas at Dallas, Sackler Professroship at Tel Aviv University and has been on faculty at Technion, and UMass. Dr. Imrich Chlamtac has made significant contribution to various networking technologies as scientist, educator and entrepreneur. Dr. Chlamtac is the recipient of multiple awards and recognitions including Fellow of the IEEE, Fellow of the ACM, Fulbright Scholar, the ACM Award for Outstanding Contributions to Research on Mobility and the IEEE Award for Outstanding Technical Contributions to Wireless Personal Communications. Dr. Chlamtac published over three hundred and fifty refereed journal, book, and conference articles and is the co-author of four books. Dr. Chlamtac has widely contributed to the scientific community as founder and Chair of ACM Sigmobile, founder and steering committee chair of some of the lead conferences in networking including Mobicom, OptiComm, Mobiquitous, Broadnets, Securecomm. Dr. Chlamtac also serves as the founding Editor in Chief of the ACM/URSI/Springer Wireless Networks (WINET), the ACM/Springer Journal on Special Topics in Mobile Networks and Applications (MONET). B. Prahbakaran is with the faculty of Computer Science Department, University of Texas at Dallas. He has been working in the area of multimedia systems: animation & multimedia databases, authoring & presentation, resource management, and scalable web-based multimedia presentation servers. Dr. Prabhakaran received the prestigious National Science Foundation (NSF) CAREER Award in 2003 for his proposal on Animation Databases. He has published several research papers in various refereed conferences and journals in this area. He has served as guest-editor (special issue on Multimedia Authoring and Presentation) for ACM Multimedia Systems journal. He is also serving on the editorial board of Multimedia Tools and Applications journal, Kluwer Academic Publishers. He has also served as program committee member on several multimedia conferences and workshops. B. Prabhakaran has served as a visiting research faculty with the Department of Computer Science, University of Maryland, College Park. He also served as a faculty in the Department of Computer Science, National University of Singapore as well as in the Indian Institute of Technology, Madras, India.