Pub Date : 1996-05-07DOI: 10.1109/ETACOM.1996.502470
F. El Guibaly, A. Sabaa, D. Shpak
In this paper, we introduce a new ATM switch architecture. The proposed design takes the best features of input, output and shared buffers schemes. Furthermore, buffer access speeds match the port speeds and the buffer acts in effect, as a multiport memory. The input buffers are implemented as a group of parallel shift registers. The parallel shift registers overcome the HOL and low throughput problems of input buffers. The use of shift register buffers allows operating speeds much higher than is possible using RAM buffers. Furthermore, switch speed is independent of buffer size. This is a very important feature for ATM networks that require storage of large amounts of cells in the switching nodes. The parallel nature of the input queues simplifies the supporting of multicast functions. In addition, the modularity of the proposed architecture facilitates its scalability.
{"title":"A new shift-register based ATM switch","authors":"F. El Guibaly, A. Sabaa, D. Shpak","doi":"10.1109/ETACOM.1996.502470","DOIUrl":"https://doi.org/10.1109/ETACOM.1996.502470","url":null,"abstract":"In this paper, we introduce a new ATM switch architecture. The proposed design takes the best features of input, output and shared buffers schemes. Furthermore, buffer access speeds match the port speeds and the buffer acts in effect, as a multiport memory. The input buffers are implemented as a group of parallel shift registers. The parallel shift registers overcome the HOL and low throughput problems of input buffers. The use of shift register buffers allows operating speeds much higher than is possible using RAM buffers. Furthermore, switch speed is independent of buffer size. This is a very important feature for ATM networks that require storage of large amounts of cells in the switching nodes. The parallel nature of the input queues simplifies the supporting of multicast functions. In addition, the modularity of the proposed architecture facilitates its scalability.","PeriodicalId":130942,"journal":{"name":"Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121963001","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}
Pub Date : 1996-05-07DOI: 10.1109/ETACOM.1996.502505
Joann J. Ordille
Roaming agents threaten a server with theft of assets, system resources and reputation. Generally ignored is the reciprocal threat of server against agent. Not only might a server steal the assets, resources, and reputation of an agent, but it might actually kill the agent. The central security concern for systems that allow agents to roam is how to establish trust, and how to limit risk for both the server and the agent. The travels of the agent are key to establishing trust, and trust determines the level of risk.
{"title":"When agents roam, who can you trust?","authors":"Joann J. Ordille","doi":"10.1109/ETACOM.1996.502505","DOIUrl":"https://doi.org/10.1109/ETACOM.1996.502505","url":null,"abstract":"Roaming agents threaten a server with theft of assets, system resources and reputation. Generally ignored is the reciprocal threat of server against agent. Not only might a server steal the assets, resources, and reputation of an agent, but it might actually kill the agent. The central security concern for systems that allow agents to roam is how to establish trust, and how to limit risk for both the server and the agent. The travels of the agent are key to establishing trust, and trust determines the level of risk.","PeriodicalId":130942,"journal":{"name":"Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122053265","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}
Pub Date : 1996-05-07DOI: 10.1109/ETACOM.1996.502492
C. Niznik
Virtual Reality is defined as the process of turning an event into a reality by creating the illusionary effects necessary to make a person believe the event is occumng. In War Games such as ARPA’s STOW(Synthetic Theatre Of War) Program the virtual reality of the interaction or completion of the exercises within the games can be described by the congestion controlled fairness criteria for the Sub Game Perfect Theory equilibrium points, analogous to the computer networking power point. This operating point criteria for removing constraints at the conclusion of exercises allows the Lagrangian optimization to continue unconstrained minimization of delay for the platform terminal protocols. The Meta Model Constraint RemovJ(MMCR) Protocol was developed to enable access of Silicon Graphics Computer Network platforms to perform War Game Exercises with the Defense Simulation Intemetwork(DS1) ST(Sueam) Protocol or the Intemetwork RSVP Protocol. The internal section of the MMCR Protocol utilizes latency and capacity measurements coordinated with computer networking fairness, wavelet theory decision tree performance evaluation, fractal data compression theory and Category theory admissibility and construction specifications to enable the operation of this virtual overlay protocol with Strategic Game theory, and Minimax and Maximin Game Theory. The outer section of the MMCR Protocol begins at the input to the VR Data Glove with the Two Person Zero Sum Game Theory and concludes with the subgame perfect theory at the VR Data Glove Output. L OVERVIEW OF IMGTAMODELMEAWREMENT OF PERFORM~NCE REQUIREMEN% CONCEPT THEORY FOR THE SDI NTB Referring to Figure 1, the META MODEL [26] Stratagic Defense Initiative Organization software protocol theory for National Test Bed simulation decided which modules are running on which processors and the connectivity between the analyzer resources. Using neural network stress control theory[27], the META MODEL leamed from the multiple NTB simulation executions[26] to compute an estimate of the resources available during different time frames connected with different topological sections of the simulation, by monitoring the results of the simulation from the running time measurements of the simulation. Therefore, the META MODEL determined the resources to formalize the simulation goals achieved by monitoring network information measures during running time for information storage, and time complexity measurement optimization. This operation of the Distributed Simulation also required the provision of inputs to the neural networking protocol architecture to observe run times to perform predictions based on this run time. The META MODEL simulated the real and artificial simulation of the SDS system, performing capacity planning by illustrating the effects of the simulation modules I
虚拟现实被定义为通过创造必要的幻觉效果使人相信事件正在发生，从而将事件变为现实的过程。在ARPA的STOW(Synthetic Theatre Of War)程序等战争游戏中，游戏中互动或完成练习的虚拟现实可以用子游戏完美理论均衡点的拥塞控制公平标准来描述，类似于计算机网络电源点。这个在演习结束时消除约束的工作点标准允许拉格朗日优化继续对平台终端协议的延迟进行无约束最小化。开发了元模型约束移除(MMCR)协议，使硅图形计算机网络平台能够使用国防模拟网络(DS1) ST(Sueam)协议或网络RSVP协议执行战争游戏演习。MMCR协议的内部部分利用延迟和容量测量与计算机网络公平性、小波理论决策树性能评估、分形数据压缩理论和范畴论的可接受性和构造规范相协调，使该虚拟覆盖协议能够与策略博弈论、极小和极大博弈论相协调。MMCR协议的外部部分从VR数据手套的输入开始，使用两人零和博弈理论，并以VR数据手套输出的子博弈完美理论结束。参考图1，用于国家试验台仿真的META模型[26]战略防御倡议组织软件协议理论决定了哪些模块在哪些处理器上运行以及分析仪资源之间的连接。META模型利用神经网络应力控制理论[27]，从多个NTB仿真执行中学习[26]，通过监测仿真运行时间测量的仿真结果，计算出与仿真的不同拓扑部分相连的不同时间框架内可用资源的估计值。因此，META模型确定资源，通过在运行时监控网络信息度量，实现信息存储和时间复杂度度量优化的仿真目标。分布式仿真的这种操作还需要向神经网络协议体系结构提供输入，以观察运行时，并基于此运行时执行预测。META模型模拟了SDS系统的真实和人工仿真，通过说明仿真模块1的效果进行容量规划
{"title":"THE META MODEL CONSTRAINT REMOVAL PROTOCOL: VIRTUAL REALITY FAIRNESS FOR WAR GAME NETWORKED EXERCISE","authors":"C. Niznik","doi":"10.1109/ETACOM.1996.502492","DOIUrl":"https://doi.org/10.1109/ETACOM.1996.502492","url":null,"abstract":"Virtual Reality is defined as the process of turning an event into a reality by creating the illusionary effects necessary to make a person believe the event is occumng. In War Games such as ARPA’s STOW(Synthetic Theatre Of War) Program the virtual reality of the interaction or completion of the exercises within the games can be described by the congestion controlled fairness criteria for the Sub Game Perfect Theory equilibrium points, analogous to the computer networking power point. This operating point criteria for removing constraints at the conclusion of exercises allows the Lagrangian optimization to continue unconstrained minimization of delay for the platform terminal protocols. The Meta Model Constraint RemovJ(MMCR) Protocol was developed to enable access of Silicon Graphics Computer Network platforms to perform War Game Exercises with the Defense Simulation Intemetwork(DS1) ST(Sueam) Protocol or the Intemetwork RSVP Protocol. The internal section of the MMCR Protocol utilizes latency and capacity measurements coordinated with computer networking fairness, wavelet theory decision tree performance evaluation, fractal data compression theory and Category theory admissibility and construction specifications to enable the operation of this virtual overlay protocol with Strategic Game theory, and Minimax and Maximin Game Theory. The outer section of the MMCR Protocol begins at the input to the VR Data Glove with the Two Person Zero Sum Game Theory and concludes with the subgame perfect theory at the VR Data Glove Output. L OVERVIEW OF IMGTAMODELMEAWREMENT OF PERFORM~NCE REQUIREMEN% CONCEPT THEORY FOR THE SDI NTB Referring to Figure 1, the META MODEL [26] Stratagic Defense Initiative Organization software protocol theory for National Test Bed simulation decided which modules are running on which processors and the connectivity between the analyzer resources. Using neural network stress control theory[27], the META MODEL leamed from the multiple NTB simulation executions[26] to compute an estimate of the resources available during different time frames connected with different topological sections of the simulation, by monitoring the results of the simulation from the running time measurements of the simulation. Therefore, the META MODEL determined the resources to formalize the simulation goals achieved by monitoring network information measures during running time for information storage, and time complexity measurement optimization. This operation of the Distributed Simulation also required the provision of inputs to the neural networking protocol architecture to observe run times to perform predictions based on this run time. The META MODEL simulated the real and artificial simulation of the SDS system, performing capacity planning by illustrating the effects of the simulation modules I","PeriodicalId":130942,"journal":{"name":"Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126617324","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}
Pub Date : 1900-01-01DOI: 10.1109/ETACOM.1996.502479
H.R. Salloum
The delay performance was studied for a fiber to the home (FTTH) system, where an optical fiber is dedicated to each customer. There may be applications requiring the sharing of the electronics among multiple customers using a fiber to the curb (FTTC) system. In such an application, delay performance is more complex than the FTTH case because of allowing multiple customers to share the fiber upstream bandwidth. The paper covers this case and shows the maximum delay that can result for FTTC systems carrying ATM.
{"title":"Delay performance for ATM-based fiber to the curb systems","authors":"H.R. Salloum","doi":"10.1109/ETACOM.1996.502479","DOIUrl":"https://doi.org/10.1109/ETACOM.1996.502479","url":null,"abstract":"The delay performance was studied for a fiber to the home (FTTH) system, where an optical fiber is dedicated to each customer. There may be applications requiring the sharing of the electronics among multiple customers using a fiber to the curb (FTTC) system. In such an application, delay performance is more complex than the FTTH case because of allowing multiple customers to share the fiber upstream bandwidth. The paper covers this case and shows the maximum delay that can result for FTTC systems carrying ATM.","PeriodicalId":130942,"journal":{"name":"Proceedings of COM'96. First Annual Conference on Emerging Technologies and Applications in Communications","volume":"20 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":"130715001","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：