Spelling suggestions: "subject:"[een] PROTOCOL"" "subject:"[enn] PROTOCOL""
101 |
Research of Protocol Stacks for Future Space NetworksWei, Huang, Peng, Wan, Shijie, Song, Feng, Liu 10 1900 (has links)
ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada / The increasing of space explorations requires space communication protocols to provide more capabilities, such as dynamic routing, adaptive data transformation and automatic resource allocation. Accordingly, a universal space communication protocol stack should be provided instead of specially designing protocol for given space mission. Considering the requirements and characters of space mission, potential protocols of all layers were compared and analyzed. Simulations were made based on OPNET. And a suggestion for space communication protocol stacks is proposed.
|
102 |
Simulating iNET's Protocol Stack with OPNET ModelerJaber, Nur, Moazzemi, Paria 10 1900 (has links)
ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada / This paper discusses simulating iNET's protocol stack using OPNET Modeler. It shows an example of a custom protocol simulated in OPNET Modeler, and how to model the test article, and ground station as reusable components for future simulation. Network simulation is a critical tool for iNET as it enables design decisions that cannot be made analytically due to the complexity of the problem. This work addresses the incorporation of iNET's protocol stack into the OPNET Modeler tool set as this piece of iNET is unique and is not available in OPNET Modeler.
|
103 |
The Design and Application of a Simplified Guaranteed Service for the InternetOssipov, Evgueni January 2003 (has links)
<p>Much effort today in the Internet research community isaimed at providing network services for applications that werenot under consideration when the Internet was originallydesigned. Nowadays the network has to support real-timecommunication services that allow clients to transportinformation with expectations on network performance in termsof loss rate, maximum end-to-end delay, and maximum delayjitter. Today there exist two quality of service (QoS)architecture for the Internet: The integrated services, whichis usually referred to as intserv, and the differentiatedservices referred to as diffserv. Although the intserv clearlydefines the quality levels for each of its three serviceclasses, the limited scalability of this QoS architecture is acontinuous topic for discussion among the researchers. Theanalysis of the tradeoffs of the two QoS architecturesmotivated us to design a new QoS architecture which will takethe strength of the existing approaches and will combine themin a simpler, efficient and more scalable manner.</p><p>In this LicentiateThesis we introduce a guaranteed servicefor the Internet, which definition is similar to the one inintserv: The guaranteed service (GS) is a network servicerecommended for applications with firm requirements on qualityof end-to-end communication. The service should provide zeropacket loss in routers and tightly bound the end-to-end delay.The capacity for a GS connection should be explicitly reservedin every router along a path of a connection. However, incontrary to intserv the necessary quality level will beprovided without per-flow scheduling in the core routers, whichis the major drawback of the intserv architecture. We use thediffserv principle of dealing with aggregates in the corenetwork since this approach is proven to be scalable andefficient.</p><p>The thesis considers two major building blocks of the newarchitecture: The packet scheduling and the signaling protocol.We have developed a special scheduling algorithm. Our formaland experimental analysis of its delay properties shows thatthe maximum end-to-end delay is acceptable for real-timecommunication. Moreover, our scheme provides a fair service tothe traffic of other service classes. In order to achieve thedesired QoS level, a sufficient amount of capacity should bereserved for the GS connections in all intermediate routersend-to-end. We have developed a both simple and robustsignaling protocol. The realization of our protocol shows thatrouters are able to process up to 700,000 signaling messagesper second without overloading the processor.</p>
|
104 |
Process of Conducting Research on the Colorado River Indian Tribes (C.R.I.T.) Reservation, ArizonaTuttle, Sabrina, Masters, Linda 10 1900 (has links)
3 pp. / This fact sheet briefly describes the research protocol of the Colorado River Indian Tribes reservation.
|
105 |
Process of Conducting Research on the Hualapai Reservation, ArizonaTuttle, Sabrina, Crowley, Terry 10 1900 (has links)
2 pp. / This fact sheet briefly describes research protocol on the Hualapai reservation.
|
106 |
RELIABILITY ORIENTED TRANSPORT PROTOCOL IN WSNBejoy, B.J., Paramasivan, B. 01 June 2012 (has links)
Wireless Sensor Network consists of tens or thousands of
sensor nodes scattered in a physical space and one or
more Base stations or Sinks. Even thought developed for
military applications now they find a wide variety of
civilian applications also. Some of the applications are
Target tracking, Animal monitoring, Vehicle monitoring.
The need (or lack thereof) for reliability in a sensor
network is firmly dependent upon the specific
application the sensor network is used for. Some
applications like re-tasking or reprogramming sensor
nodes [upgrading software or algorithms, adding codes,
scripts etc] over -the-air requires assured delivery of
high-priority events to sinks. We believe that as the
number of sensor network applications grows, there will
be a need to build more powerful general-purpose
hardware and software environments capable of
reprogramming or retasking sensors to. / Wireless sensor network is a special form of wireless networks
dedicated to surveillance and monitoring applications
Reliability in wireless sensor network is application specific.
The specific form of reliability might change from application
to application. Our idea is to generate reliability based transport
protocol that is customizable to meet the needs of emerging
reliable data applications in sensor networks and is also
adaptive when the nodes are mobile. In our approach, clusters
are formed for minimizing energy dissipation. The nodes
maintain a neighbor list to forward data and any changes in the
local topology can trigger updates to a node’s neighbor list. If a
node notices that its neighbor list has changed, it can
spontaneously re-advertise all of its data thus providing reliable
transport in mobility conditions also. Our approach has five
phases-setup, relaying, relay initiated error recovery, selective
status reporting and node supervising. Our simulation results
prove that the proposed approach can outperform existing
related techniques and is highly responsive to the various error
and mobility conditions experienced in sensor networks.
|
107 |
Synchronous bandwidth allocation for time-critical communicationZhang, Sijing January 1996 (has links)
No description available.
|
108 |
The design and performance evaluation of a point-to-multipoint millimetric radio networkRamos, Reuben Elroy January 1998 (has links)
No description available.
|
109 |
Internet governance in transition : just who is the master of this domain?Pare, Daniel J. January 2000 (has links)
No description available.
|
110 |
Adaptive Coarse-grain Reconfigurable Protocol Processing ArchitectureBadawi, Mohammad January 2016 (has links)
Digital signal processors and their variants have provided significant benefit to efficient implementation of Physical Layer (PHY) of Open Systems Interconnection (OSI) model’s seven-layer protocol processing stack compared to the general purpose processors. Protocol processors promise to provide a similar advantage for implementing higher layers in the (OSI)'s seven-layer model. This thesis addresses the problem of designing customizable coarse-grain reconfigurable protocol processing fabrics as a solution to achieving high performance and computational efficiency. A key requirement that this thesis addresses is the ability to not only adapt to varying applications and standards, and different modes in each standard but also to time varying load and performance demands while maintaining quality of service.This thesis presents a tile-based multicore protocol processing architecture that can be customized at design time to meet the requirements of the target application. The architecture can then be reconfigured at boot time and tuned to suit the desired use-case. This architecture includes a packet-oriented memory system that has deterministic access time and access energy costs, and hence can be accurately dimensioned to fulfill the requirements of the desired use-case. Moreover, to maintain quality of service as predicted, while minimizing the use of energy and resources, this architecture encompasses an elastic management scheme that controls run-time configuration to deploy processing resources based on use-case and traffic demands.To evaluate the architecture presented in this thesis, different case studies were conducted while quantitative and qualitative metrics were used for assessment. Energy-delay product, energy efficiency, area efficiency and throughput show the improvements that were achieved using the processing cores and the memory of the presented architecture, compared with other solutions. Furthermore, the results show the reduction in latency and power consumption required to evaluate controlling states when using the elastic management scheme. The elasticity of the scheme also resulted in reducing the total area required for the controllers that serve multiple processing cores in comparison with other designs. Finally, the results validate the ability of the presented architecture to support quality of service without misutilizing available energy during a real-life case study of a multi-participant Voice Over Internet Protocol (VOIP) call. / <p>QC 20161028</p>
|
Page generated in 0.0295 seconds