{"title":"An agent-based traffic grooming and management mechanism for IP over optical networks","authors":"C. Xin, Y. Ye, S. Dixit, C. Qiao","doi":"10.1109/ICCCN.2002.1043101","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043101","url":null,"abstract":"We propose an agent-based traffic grooming and management mechanism for IP over wavelength division multiplexing (WDM) optical networks. The agent-based mechanism effectively manages the traffic aggregation across the optical core between the IP client networks. It offers the benefit of efficient resource usage and reduced connectivity complexity for IP over WDM optical networks. We have studied this mechanism and evaluated its performance over various traffic patterns.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122929428","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}
Qiu Qiang, L. Jacob, R. Pillai, Balakrishnan Prabhakaran
{"title":"MAC protocol enhancements for QoS guarantee and fairness over the IEEE 802.11 wireless LANs","authors":"Qiu Qiang, L. Jacob, R. Pillai, Balakrishnan Prabhakaran","doi":"10.1109/ICCCN.2002.1043138","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043138","url":null,"abstract":"In future wireless networks, different traffic classes will exhibit a large variety of characteristics and QoS requirements, such as transmission rate, maximum tolerable bit error rate and timeout specifications. However, currently there is no standard way of guaranteeing QoS in wireless access networks like wireless LAN based on IEEE 802.11. In this paper, we propose medium access control protocol enhancements and a distributed scheduler for QoS guarantees and fairness over IEEE 802.11 WLAN. The proposed scheme uses distributed scheduling at both the access point and the user terminals to schedule the transmission of packets according to their delay requirements. The algorithms used for both scheduling are the same. A flexible and fair resource allocation method among the traffic classes and the user terminals is provided by this scheme. Its performance has been evaluated using the UCB/LBNL/VINT Network Simulator and an implementation in the Linux kernel.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128724808","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":"Reconfigurable memory architecture for scalable IP forwarding engines","authors":"M. Nourani, M. Akhbarizadeh","doi":"10.1109/ICCCN.2002.1043102","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043102","url":null,"abstract":"A reconfigurable memory architecture and lookup technique for IP packet forwarding engines is presented. This is a flexible technique that significantly elevates the scalability of the next generation network processors and other packet processing equipments, especially in terms of increased routing table sizes, increased traffic and bandwidth, increased frequency of route updates, and migration to IPv6.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125394930","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":"Traffic-based bandwidth allocation for DOCSIS cable networks","authors":"César Heyaime-Duverge, V. Prabhu","doi":"10.1109/ICCCN.2002.1043130","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043130","url":null,"abstract":"We explore an approach for bandwidth allocation for the centralized MAC protocol employed by DOCSIS (data over cable service interface specification) compliant cable networks. The proposed approach is based on the statistics of the source traffic models. It aims at achieving low excess bandwidth while still offering delays that are acceptable from the point of view of the application's QoS requirements. The access and total delays as well as the excess bandwidth are our performance metrics. Computer programs were used to compute the performance metrics for a system servicing two applications with different QoS requirements. The selected applications are an Internet video game, which is delay sensitive, and data transfer, which is delay tolerant. The performance metrics were computed for different offered loads. Results show our approach yields QoS complying delays while achieving high bandwidth utilization.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"os-53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127790157","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":"AKMP: an adaptive key management protocol for secure multicast","authors":"H. Bettahar, A. Bouabdallah, Y. Challal","doi":"10.1109/ICCCN.2002.1043065","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043065","url":null,"abstract":"IP multicast is increasingly used as an efficient communication mechanism for group-oriented applications on the Internet. This success urged the development of security mechanisms for that communication model. A common drawback of the proposed solutions is that they do not take into consideration the dynamicity of group members. This leads to inefficient solutions for real multicast sessions. In this paper, we first classify proposed protocols for secure multicast and point out their non-suitability for dynamic groups. We then propose an efficient protocol, called AKMP, which maintains good performance by adapting the key management process to the membership frequency during the multicast session. Simulation results show that our protocol is more efficient than existing protocols.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125214006","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}
S. Jagannathan, Anthony T. Chronopoulos, S. Ponipireddy
{"title":"Distributed power control in wireless communication systems","authors":"S. Jagannathan, Anthony T. Chronopoulos, S. Ponipireddy","doi":"10.1109/ICCCN.2002.1043112","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043112","url":null,"abstract":"Energy efficiency is a measure of performance in wireless networks. Therefore, controlling the transmitter power at a given node increases not only battery operating life, but also overall system capacity by successfully admitting new links. It is essential to find effective means of power control in point-to-point, broadcasting and multicasting scenarios. Wireless networking presents formidable challenges and we consider the problem of unicast or point-to-point (peer-to-peer) communication in wireless networks in the presence of other nodes. We study the feasibility of admitting new links in an wireless network operating area while maintaining quality of service (QoS), in terms of signal-to-interference ratio (SIR), for each link. SIR is maintained by adjusting the transmitter power levels at each source for a given link. Distributed power control (DPC) is a natural choice for this purpose because, unlike centralized power control, DPC should be able to adjust the power levels of each transmitted signal using local measurements, so that in a reasonable time, all nodes/links maintain the desired SIR. We present a suite of DPC schemes using both state space and optimal control methodology in discrete-time. Further, we prove the convergence of the overall network with our algorithm using Lyapunov stability analysis in comparison with a well known DPC scheme (see Bambos, N. et al., IEEE ACM Trans. on Networking, p.583-97, 2000). We present simulation results and comparisons for point to point communications in an overlapping scenario.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124792276","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":"Efficient hybrid key agreement protocol for wireless ad hoc networks","authors":"Xiangyang Li, Yang Wang, O. Frieder","doi":"10.1109/ICCCN.2002.1043099","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043099","url":null,"abstract":"Secure and efficient communication among a set of mobile nodes is one of the most important aspects in ad-hoc wireless networks. To ensure the security, several cryptography protocols must be implemented. Due to the resource scarcity in wireless networks, the protocols must be communication efficient and need as less computational power as possible. To secure the group broadcasting in wireless networks, often a group key is needed so that efficient conventional encryption, such as DES and AES, can be used. Several group key management protocols have been proposed. However, not all of them are communication efficient when applied to wireless ad-hoc networks. In this paper, we propose a key agreement protocol that is communication efficient by using connected dominating set concept to set up subgroups among all wireless nodes. We also show how to manage the group efficiently in a mobile environment.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126490447","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":"Visualising interactions between TCP's congestion and flow control algorithms","authors":"A. Ruddle, C. Allison, P. Lindsay","doi":"10.1109/ICCCN.2002.1043042","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043042","url":null,"abstract":"The Transmission Control Protocol, TCP, is used in over 90% of the traffic on the Internet. The effect of the protocol itself on the efficiency and fairness of Internet traffic is accordingly the focus of much study. In particular, the tight timeliness constraints required by Web traffic require that TCP should not unnecessarily introduce delay. TCP continues to evolve, and insights into its behaviour are of great potential value. The work reported offers novel approaches to understanding the subtle interactions between TCP's congestion control and flow control algorithms across a wide range of transfer sizes and congestion regimes. A model of TCP's behaviour is described in the form of a program used to generate data sets. These are then processed to generate 3D graphics that are used to visualise the model. This leads to a re-evaluation of TCP's congestion control algorithms within the context of high bandwidth WANs and a high level of multiplexing. As new access technologies are deployed and more users acquire high bandwidth access to the Internet, the limitation imposed by the needs of competing traffic will reinforce the importance of the fair distribution of network resources.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128234107","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":"All-terminal reliability analysis of the SRP-ring: the effect of enhanced intelligent protection switching","authors":"Ming Qian, D. Logothetis, Kishor S. Trivedi","doi":"10.1109/ICCCN.2002.1043045","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043045","url":null,"abstract":"Spatial reuse protocol (SRP) is a media access control (MAC)-layer protocol that operates over a double counter-rotating ring network topology. SRP is designed to enhance the SONET network so that it can handle data traffic more efficiently. We study the all-terminal reliability of an SRP ring implementing intelligent protection switch (IPS) and enhanced intelligent protection switch (E-IPS). We calculate reliability for all scenarios under which all-terminal connectivity is maintained. By summing up the results arising from individual mutually exclusive events, all-terminal reliabilities for IPS and E-IPS are obtained. By further assuming constant and time-dependent component failure rates, mean time to failure (MTTF) and mean time to failure improvement factor (MTIF) measures are calculated. Results show that MTTF/MTIF vary as functions of network size, component reliability and coverage factor. The advantage of E-IPS over IPS is more obvious when network size is big and concentrator failure rate is small. Our analysis could be helpful to network designers who wish to determine whether the additional cost/complexity added by the E-IPS scheme is justified.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128884674","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}
M. Gusat, F. Abel, F. Gramsamer, R. Luijten, C. Minkenberg, M. Verhappen
{"title":"Stability of CIOQ switches with finite buffers and non-negligible round-trip time","authors":"M. Gusat, F. Abel, F. Gramsamer, R. Luijten, C. Minkenberg, M. Verhappen","doi":"10.1109/ICCCN.2002.1043104","DOIUrl":"https://doi.org/10.1109/ICCCN.2002.1043104","url":null,"abstract":"We propose a systematic method to determine the lower bound for internal buffering of practical CIOQ (combined input-output queued) switching systems. We introduce a deterministic traffic scenario that stresses the global stability of finite output queues. We demonstrate its usefulness by dimensioning the buffer capacity of the CIOQ under such traffic patterns. Compliance with this property maximizes the performance achievable with finite buffers.","PeriodicalId":302787,"journal":{"name":"Proceedings. Eleventh International Conference on Computer Communications and Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130703990","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}