{"title":"A general fractal model of Internet traffic","authors":"S. Molnár, G. Terdik","doi":"10.1109/LCN.2001.990828","DOIUrl":"https://doi.org/10.1109/LCN.2001.990828","url":null,"abstract":"The fractal nature of Internet traffic has been observed by several measurements and statistical studies. A new monofractal stochastic process called Limit of the Integrated Superposition of Diffusion processes with Linear differential Generator (LISDLG) is presented, which effectively characterizes network traffic monofractality. Several properties of the LISDLG model are presented including the covariance structure, cumulants, spectrum and bispectrum. The model captures high-order statistics by means of the cumulants. The relevance and validation of the proposed model are demonstrated by application studies for measured Internet traffic.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124971817","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 link adaptation approach for QoS enhancement in wireless networks","authors":"S. Ci, H. Sharif, A. Young","doi":"10.1109/LCN.2001.990810","DOIUrl":"https://doi.org/10.1109/LCN.2001.990810","url":null,"abstract":"We propose a new link adaptation approach for QoS enhancement in wireless networks. We utilize the Kalman filter, which predicts the local optimal frame size based on the channel quality varying based on the derived channel model. We have also presented the simulations and experimental results. The results show that the performance of proposed predictor is much better than other prediction methods like the moving average.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129499175","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":"Multi-period resource allocation at system edges - capacity management in a multi-provider multi-service Internet","authors":"O. Heckmann, J. Schmitt, R. Steinmetz","doi":"10.1109/LCN.2001.990817","DOIUrl":"https://doi.org/10.1109/LCN.2001.990817","url":null,"abstract":"Providing guaranteed QoS necessarily requires allocation of scarce resources. It is conceivable that at least at system edges scarcity of resources, exposed in the form of non-negligible (virtual) costs, will prevail to necessitate explicit allocation of resources as opposed to pure over-dimensioning. An example of this logic is constituted by the Differentiated Services (DiffServ) architecture. Often such resource allocation decisions are done on a multi-period basis because resource allocation decisions at a certain point in time may depend on earlier decisions and thus it can turn out sub-optimal to look at decisions in an isolated fashion. Therefore, we investigate a fairly large and diverse set of (network) QoS problems all of which deal with the problem of multi-period resource allocation at system edges. We devise a taxonomy for the classification of these problems and introduce a common mathematical framework under which these problems can be tackled. The ultimate goal of our work is to strive for solution techniques towards the generalized class of problems such that these are applicable in a number of scenarios which have so far not been regarded in an integrated fashion.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127292109","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":"Notes on the per-flow packet count flow classifier","authors":"M. Ilvesmäki, J. Karvo","doi":"10.1109/LCN.2001.990804","DOIUrl":"https://doi.org/10.1109/LCN.2001.990804","url":null,"abstract":"To realize a packet count classifier, in addition to the active flow table, a candidate table is needed, where information on flow candidates is kept. We observe the temporal behavior of both the active flow table and flow candidate table size using actual traffic traces. The results indicate that the performance bottleneck in a packet count classifier lies within the candidate table management. Also, the changes in the candidate table size occur much faster than in the active flow table. Therefore, fast methods of creating entries and deletions in the candidate table are needed.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128968531","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":"Mobility in a future Internet","authors":"B. Stiller, Lev Kacnelson, C. Perkins, P. Dini","doi":"10.1109/LCN.2001.990764","DOIUrl":"https://doi.org/10.1109/LCN.2001.990764","url":null,"abstract":"Mobility of users in a future Internet has become a reality due to highly mobile end-systems. However, the new dimension of protocol functionality, Mobile IP, resource control, quality of service (QoS) support and AAA (authentication, authorization and accounting) features extended by charging schemes are still to be integrated effectively. Therefore, this position paper addresses these three areas of research concern, discusses basic concepts and outlines major problem fields still to be worked on.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116765768","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":"Transparent distributed Web caching","authors":"Zheng Liang, H. Hassanein, Patrick Martin","doi":"10.1109/LCN.2001.990791","DOIUrl":"https://doi.org/10.1109/LCN.2001.990791","url":null,"abstract":"Layer 5 switching-based transparent Web caching intercepts HTTP requests and redirects requests according to their contents. This technique makes the deployment and configuration of a caching system easier and improves its performance by ensuring that non-cacheable HTTP requests bypass the cache servers. We propose a Load Balancing Layer 5 switching-based (LB-L5) Web caching scheme that uses the Layer 5 switching-based technique to support distributed Web caching. We present simulation results that show that LB-L5 outperforms existing Web caching schemes, namely ICP, Cache Digest, and basic L5 transparent Web caching, in terms of cache server workload balancing and response time. LB-L5 is also shown to be more adaptable to high HTTP request intensity than the other schemes.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115182567","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":"SBM+: enhanced SBM for managing bandwidth in multiple access subnets","authors":"S. Jha, Mahbub Hassan","doi":"10.1109/LCN.2001.990819","DOIUrl":"https://doi.org/10.1109/LCN.2001.990819","url":null,"abstract":"This paper proposes an extension to the standard subnet bandwidth manager (SBM). The extension controls the best effort traffic on the subnet to minimize its impact on the QoS of the RSVP (resource reservation protocol) flows. The extension is achieved by adding extra messages to the standard RSVP that enables the SBM to signal the hosts about the available bandwidth. The hosts then control the rate of best effort traffic accordingly to avoid excessive collisions on the subnet. The implementation of the proposed extension on a shared Ethernet LAN demonstrates the benefits of this extension.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115930461","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":"RoMR: a robust multicast routing protocol for ad-hoc networks","authors":"G. H. Lynn, T. Znati","doi":"10.1109/LCN.2001.990795","DOIUrl":"https://doi.org/10.1109/LCN.2001.990795","url":null,"abstract":"Support for multicast services is crucial for ad-hoc networks to become a viable alternative to infrastructured wired and wireless networks. We propose RoMR, a robust multicast routing algorithm for ad-hoc networks. The basic tenet of the algorithm is to build multiple reliable multicast trees that adapt to topology changes in a dynamic fashion. The main characteristics of RoMR are its robustness and mobility awareness in efficiently supporting multicast communication. The robustness of our multicast strategy stems from two techniques in creating the multicast trees. First, RoMR constructs the multicast trees with links that are less prone to failure than other links. Second, multiple trees are constructed, possibly interconnected, so that if a link fails in one tree, reliable paths established from an alternate tree are immediately available. Links that have a high probability of existing in the next time interval are chosen as the links that the trees have in common.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115263502","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":"Experiences with class of service (CoS) translations in IP/MPLS networks","authors":"R. Prabagaran, Joseph B. Evans","doi":"10.1109/LCN.2001.990793","DOIUrl":"https://doi.org/10.1109/LCN.2001.990793","url":null,"abstract":"This paper presents some experiences with class of service (CoS) translation in IP and MPLS based networks. IP provides CoS in the form of eight priority classes that can be used to distinguish between a variety of traffic types. Since most of the layer-2 technologies provide support for strict QoS, an appropriate translation from the coarse grained IP CoS to the fine-grained layer-2 QoS is fundamental to obtaining desired end-to-end throughput. Multiprotocol label switching (MPLS), residing in between IP and layer-2 in the protocol stack, provides an interface to translate IP CoS to appropriate layer-2 QoS. This paper presents some of the results obtained by using MPLS CoS with relative and fixed bandwidth allocation to MPLS classes. Experiments were conducted to observe the effects of per-CoS weighted fair queuing (WFQ) and class based queueing (CBQ) inside the MPLS cloud on fixed size high bandwidth traffic and bursty traffic. It was found that MPLS CoS did relative allocation of bandwidth and prevented starvation of lower priority flows inside the MPLS core. This paper also discusses some of the experiments conducted to evaluate the effects of improper CoS mapping, as a packet traverses multiple networks.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123473914","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":"Channel planning and fault recovery in hierarchical hybrid cellular networks with mobile routers","authors":"Wei Cui, M. Bassiouni","doi":"10.1109/LCN.2001.990846","DOIUrl":"https://doi.org/10.1109/LCN.2001.990846","url":null,"abstract":"Hierarchical cellular networks with mobile routers were proposed in our previous work to migrate the hierarchical feature from stationary cellular networks into totally mobile wireless networks (see Cui, W. and Bassiouni, M.A., Proc. IEEE Int. Conf. on Third Generation Wireless Communications, 2000). We briefly cover the basic idea of the proposed architecture and its channel planning issues. Then we introduce a fault recovery protocol using backup routers. Simulation results are presented for evaluation purposes. In addition, the steady-state performance of the recovery protocol is analyzed with stochastic models.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122077490","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}