Internet Protocol - Research by Kirils Solovjovs

Recommendations

Info

Finite-state machine 110 UML state machines State transition table Current state → Input ↓ State A State B State C Input X ... ... ... Input Y ... State C ... Input Z ... ... ... The Unified Modeling Language has a notation for describing state machines. UML state machines overcome the limitations of traditional finite state machines while retaining their main benefits. UML state machines introduce the new concepts of hierarchically nested states and orthogonal regions, while extending the notion of actions. UML state machines have the characteristics of both Mealy machines and Moore machines. They support actions that depend on both the state of the system and the triggering event, as in Mealy machines, as well as entry and exit actions, which are associated with states rather than transitions, as in Moore machines. SDL state machines The Specification and Description Language is a standard from ITU which includes graphical symbols to describe actions in the transition: • send an event • receive an event • start a timer • cancel a timer • start another concurrent state machine • decision SDL embeds basic data types called Abstract Data Types, an action language, and an execution semantic in order to make the finite state machine executable. Other state diagrams There are a large number of variants to represent an FSM such as the one in figure 3. Usage In addition to their use in modeling reactive systems presented here, finite state automata are significant in many different areas, including electrical engineering, linguistics, computer science, philosophy, biology, mathematics, and logic. Finite state machines are a class of automata studied in automata theory and the theory of computation. In computer science, finite state machines are widely used in modeling of application behavior, design of hardware digital systems, software engineering, compilers, network protocols, and the study of computation and languages.
Finite-state machine 111 Classification There are two different groups of state machines: Acceptors/Recognizers and Transducers. Acceptors and recognizers Acceptors and recognizers (also sequence detectors) produce a binary output, saying either yes or no to answer whether the input is accepted by the machine or not. All states of the FSM are said to be either accepting or not accepting. At the time when all input is processed, if the current state is an accepting state, the input is accepted; otherwise it is rejected. As a rule the input are symbols (characters); actions are not used. The example in figure 4 shows a finite state machine which accepts the word "nice". In this FSM the only accepting state is number 7. Fig. 4 Acceptor FSM: parsing the word "nice" The machine can also be described as defining a language, which would contain every word accepted by the machine but none of the rejected ones; we say then that the language is accepted by the machine. By definition, the languages accepted by FSMs are the regular languages—that is, a language is regular if there is some FSM that accepts it. Start state The start state is usually shown drawn with an arrow "pointing at it from any where" (Sipser (2006) p. 34). Accept (or final) states Accept states (also referred to as accepting or final states) are those at which the machine reports that the input string, as processed so far, is a member of the language it accepts. It is usually represented by a double circle. An example of an accepting state appears in the diagram to the right: a deterministic finite automaton (DFA) that detects whether the binary input string contains an even number of 0's. S 1 (which is also the start state) indicates the state at which an even number of 0's has been input. S 1 is therefore an accepting state. This machine will finish in an accept state, if the binary string contains an even number of 0's (including any binary Fig. 5: Representation of a finite-state machine; this example shows one that determines whether a binary number has an odd or even number of 0's, where is an accepting state. string containing no 0's). Examples of strings accepted by this DFA are epsilon (the empty string), 1, 11, 11..., 00, 010, 1010, 10110, etc...
Page 1 and 2:
An Introduction to Computer Network
Page 3 and 4:
--WEEK ONE-- 1
Page 5 and 6:
Internet 3 Internet portal World Wi
Page 7 and 8:
Internet 5 in the late 1980s and ea
Page 9 and 10:
Internet 7 Internet, though they ma
Page 11 and 12:
Internet 9 Services World Wide Web
Page 13 and 14:
Internet 11 Digital media streaming
Page 15 and 16:
Internet 13 In an American study in
Page 17 and 18:
Internet 15 Internet, Berdal also n
Page 19 and 20:
Internet 17 [32] Walter Willinger,
Page 21 and 22:
Internet 19 • "The Internet sprea
Page 23 and 24:
Internet protocol suite 21 The netw
Page 25 and 26:
Internet protocol suite 23 Layers i
Page 27 and 28:
Internet protocol suite 25 3. The S
Page 29 and 30:
Internet protocol suite 27 Applicat
Page 31 and 32:
Internet protocol suite 29 implemen
Page 33 and 34:
OSI model 31 OSI model The Open Sys
Page 35 and 36:
OSI model 33 Parallel SCSI buses op
Page 37 and 38:
OSI model 35 While Generic Routing
Page 39 and 40:
OSI model 37 5 Session ISO/IEC 8327
Page 41 and 42:
OSI model 39 citeseerx. ist. psu. e
Page 43 and 44:
Internet Protocol 41 The Internet P
Page 45 and 46:
Transmission Control Protocol 43 re
Page 47 and 48:
Transmission Control Protocol 45 tw
Page 49 and 50:
Transmission Control Protocol 47 Co
Page 51 and 52:
Transmission Control Protocol 49 Er
Page 53 and 54:
Transmission Control Protocol 51 se
Page 55 and 56:
Transmission Control Protocol 53 Co
Page 57 and 58:
Transmission Control Protocol 55 Al
Page 59 and 60:
Transmission Control Protocol 57
Page 61 and 62: Transmission Control Protocol 59
Page 63 and 64: User Datagram Protocol 61 Checksum
Page 65 and 66: User Datagram Protocol 63 Applicati
Page 67 and 68: Internet Control Message Protocol 6
Page 69 and 70: Internet Control Message Protocol 6
Page 71 and 72: Hypertext Transfer Protocol 69 HTTP
Page 73 and 74: Hypertext Transfer Protocol 71 Is u
Page 75 and 76: Hypertext Transfer Protocol 73 Secu
Page 77 and 78: Hypertext Transfer Protocol 75 [17]
Page 79 and 80: Skype protocol 77 Login A Skype cli
Page 81 and 82: Skype protocol 79 TCP TCP packets:
Page 83 and 84: Skype protocol 81 • L. De Cicco,
Page 85 and 86: BitTorrent 83 Operation A BitTorren
Page 87 and 88: BitTorrent 85 order to complete the
Page 89 and 90: BitTorrent 87 table capacities. Bit
Page 91 and 92: BitTorrent 89 torrent for each encl
Page 93 and 94: BitTorrent 91 Legal issues There ha
Page 95 and 96: BitTorrent 93 [50] http:/ / bittorr
Page 97 and 98: Architectural Principles Encapsulat
Page 99 and 100: Packet switching 97 Baran's study m
Page 101 and 102: Packet switching 99 References [1]
Page 103 and 104: Hostname 101 rr.pmtpa.wikimedia.org
Page 105 and 106: End-to-end principle 103 History Th
Page 107 and 108: End-to-end principle 105 [5] Saltze
Page 109 and 110: Finite-state machine 107 Finite-sta
Page 111: Finite-state machine 109 Fig. 2 SDL
Page 115 and 116: Finite-state machine 113 orthogonal
Page 117 and 118: Finite-state machine 115 [8] Alur,
Page 119 and 120: Finite-state machine 117 Finite Mar
Page 121 and 122: Article Sources and Contributors 11
Page 127: License 125 License Creative Common
show all

Internet Protocol - Research by Kirils Solovjovs

Create successful ePaper yourself

Delete template?

Save as template?