{"title":"A hybrid MAC protocol for multimedia traffic in wireless networks","authors":"M. Chatterjee, Sajal K. Das","doi":"10.1109/ICON.2000.875765","DOIUrl":"https://doi.org/10.1109/ICON.2000.875765","url":null,"abstract":"This paper proposes a new MAC protocol, called request-TDMA/CDMA protocol, for supporting multimedia traffic in wireless networks. The protocol has CDMA laid over TDMA like frame structure which has two kinds of slots, viz., data slots and control slots. The control slot holds the information of the next frame's data slot allocation. Whenever a mobile terminal needs to transmit a message, it sends a request to the base station and enters the contention process. The scheduler at the base station takes into consideration the time of generation of a call, the bit rate requirement and the message length while reserving slots for the entire length of the message generated. Three scheduling algorithms are proposed and their performances are studied for four classes of traffic. We also model our protocol using a two-dimensional Markov chain, and for a given system load we compute the state transition probabilities and derive the average waiting time. By simulation experiments we show that our (hybrid) request-TDMA/CDMA protocol is able to effectively combine the orthogonality of both time and code division multiplexing.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A sensor-based intrusion detection engine","authors":"Zhu Hui, Daniel T. H. Tan","doi":"10.1109/ICON.2000.875847","DOIUrl":"https://doi.org/10.1109/ICON.2000.875847","url":null,"abstract":"This paper describes a sensor-based intrusion detection engine-SenIDS, which can process different security-relevant data types with various intrusion detection methods.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123539286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Wave & wait protocol (WWP): high throughput and low energy for mobile IP-devices","authors":"V. Tsaoussidis, A. Llahanns, H. Badr","doi":"10.1109/ICON.2000.875832","DOIUrl":"https://doi.org/10.1109/ICON.2000.875832","url":null,"abstract":"The work we present here reports on the further development and testing of an experimental transport-level protocol. The protocol runs on top of the IP, and is intended for mobile, wireless devices. Its central concern is to conserve battery-powered energy used for transmission while maintaining high levels of data throughput. It can be adjusted to achieve higher throughput at the expense of lesser energy-saving in accordance with the application's needs. It conserves transmission effort, adjusting data transmission below the perceived network congestion level, and thereby minimizes the need for duplicate data retransmission due to congested routers losing packets, and so on. It achieves high throughput by implementing a network probing mechanism that enables it to investigate instances in which prevailing throughput conditions appear to be deteriorating before committing to further data transmission. The probing mechanism also permits it to continuously monitor the network during high congestion periods in order to locate windows of sufficiently low congestion opportunity to exploit for transmission.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125272112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"XOR retransmission in multicast error recovery","authors":"Shen Yong, L. B. Sung","doi":"10.1109/ICON.2000.875810","DOIUrl":"https://doi.org/10.1109/ICON.2000.875810","url":null,"abstract":"A growing number of network applications require the use of a reliable multicast protocol to disseminate data from a source to a potentially large number of receivers. We present a new error recovery mechanism, called XOR, which is based on the selective repeat ARQ protocols. The idea is to combine several NACKed packets by XORing them. The analytical and simulative result show that XOR achieves a better throughput than both 'N1' and 'N2' do.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114909431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modelling multi-channel slotted ring networks with tunable transmitters and fixed receivers","authors":"Jun-Yao Wang, W. Hwang, Wen-Fong Wang, C. Shieh","doi":"10.1109/ICON.2000.875829","DOIUrl":"https://doi.org/10.1109/ICON.2000.875829","url":null,"abstract":"This study presents a non-preemptive priority queue model to approximate the cell delay of a multi-channel slotted ring network with tunable transmitters and fixed receivers, and one queue for storing cells for each channel at each node. To analyze network performance, this network is translated to the proposed non-preemptive priority queue model. With this model, the approximated analytical cell delay results can be obtained by close-form formulas. This investigation assumes that the cell arrival rate for every destination at each node can be different and the number of nodes equals the number of channels. The accuracy of the model is assessed using the simulation results, and the two are found to be very close.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122687052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design and analysis of efficient remote buffering strategies for LAN based architectures","authors":"Ligang Dong, B. Veeravalli, C. Ko","doi":"10.1109/ICON.2000.875830","DOIUrl":"https://doi.org/10.1109/ICON.2000.875830","url":null,"abstract":"We design two efficient remote caching algorithms, referred to as DPRPEM and PRPARI for a distributed system with a LAN based architecture to manage the available buffer space at every site and to minimize the average response time. The proposed algorithms, which determine the page that needs to be swapped out of main memory to make sufficient room for an incoming page, form one of the three components of a remote caching architecture (RCA) paradigm. The algorithms are based on computing the relative importance of a page and then performing operations like page-exchange and page-migration. DPRPEM exploits actual page access information and its performance is proven to outperform the existing algorithms in the existing literature. PRPARI is used to obtain the optimal page allocation among sites when page access rate information is known. We present a rigorous simulation study on the behavior of these algorithms, compare with the existing algorithms, and provide a detailed discussion of the results.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121060506","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed quality of service multicast routing with multiple metrics for receiver initiated joins","authors":"M. Rio, P. Linington","doi":"10.1109/ICON.2000.875787","DOIUrl":"https://doi.org/10.1109/ICON.2000.875787","url":null,"abstract":"This paper describes a novel method of building multicast trees for real time traffic with quality of service constraints. There is a wide range of heuristics to calculate the optimal multicast distribution trees with bounds on the maximum delay from the source to all members. However these heuristics require all the members to be known in advance and assume the existence of a centralized service. We present a heuristic-best cost individual join (BCIJ)-that joins members one by one, randomly to the existing tree. The method does not need previous knowledge of the group members. Trees are dynamically built when each member arrives in the group. A distributed method-multiple metric broadcast (MMB)-for nodes to obtain the best valid path to the existing tree is also presented. MMB is inspired by reverse path forwarding and broadcasts queries to the network that reach existing on-tree members. These reply with the best valid paths to the joining member. The member then selects the best path. This avoids the use of any centralized service and the need for link-state information to be available in any node. The evaluation presented shows that the BCIJ produces trees with better cost than existing centralized heuristics and that MMB does not have a major effect on the network if the group participation is sufficiently large.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132866043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}