OIAr - User contributions [en]

GF.Queuing

2015-01-02T22:15:41Z

Mischa Frenk:

{{Maturity|0}}
{{Pageheaderbox4GF
|name=Queuing
|WorkingArea=Network
|version=0.4
|owner=Mischa Frenk
|summary=Provides the ability to process traffic based various queuing policies.
}}
This Function serves to optimise processing of traffic or resource usage, based on one or more queuing policies. A queuing policy formulates a decision on which job to perform next, where "job" can mean an action, processing task, data packet transfer et cetera. Queuing policies generally can occur in two different forms:
* non-pre-emptive: in this form a job being processed cannot be interrupted; the queuing function simply decides on the next job in line;
* pre-emptive: in this form an active job can be interrupted as soon as another non-active job takes precedence according to the queuing policy. The active job is deactivated (usually without losing the results of the processing thusfar), and the higher precedence job starts processing.
To be able to prioritize jobs, Queuing must be paired with Caching, which then serves as the buffer for jobs that cannot be processed yet.

Examples of queuing policies are:
* First in first out:
This policy states that the job that has been waiting the longest is served first.
* Last in first out:
This policy states that the job that was added most recently will be served first.
* Resource sharing:
Service capacity is shared equally over multiple jobs.
* Priority:
A job with an assigned priority that is higher than that of another job is served first. This ofcourse means a priority criterium must be available, e.g. based on metadata.
* Shortest job first:
The next job to be served is the one with the smallest size or shortest expected duration.
* Pre-emptive shortest job first:
The next job to be served is the one with the smallest size or shortest expected duration; if a new job comes in with smaller size or expected duration than the remaining size/duration of the currently running job, the running job is interrupted.
{{FunctionIcon
|image=Icon GF Queuing.png
}}
{{Text Footer GF}}

GF.Queuing

2014-12-24T15:24:14Z

Mischa Frenk:

{{Maturity|0}}
{{Pageheaderbox4GF
|name=Queuing
|WorkingArea=Network
|version=0.3
|owner=Mischa Frenk
|summary=Provides the ability to process traffic based various queuing policies.
}}
Function to optimise traffic or resource usage based on various queuing policies. Examples of queuing policies can be:

* First in first out This policy states that data elements are processed one at a time and that the data elements that has been waiting the longest is served first.
* Last in first out This policy also serves data elements one at a time, however the data element with the shortest waiting time will be served first.
* Resource sharing Service capacity is shared equally.
* Priority Data elements with an assigned priority that is higher than that of another data element is served first. Priority queues can be of two types, non-pre-emptive (where a job in service cannot be interrupted) and pre-emptive (where a job in service can be interrupted by a higher priority job). No work is lost in either model.
* Shortest job first The next job to be served is the one with the smallest size
* Pre-emptive shortest job first The next job to be served is the one with the original smallest size
* Shortest remaining processing time The next job to serve is the one with the smallest remaining processing requirement.
{{FunctionIcon
|image=Icon
}}
{{Text Footer GF}}

GF.Queuing

2014-12-24T13:50:23Z

Mischa Frenk:

{{Maturity|0}}
{{Pageheaderbox4GF
|name=Queuing
|WorkingArea=Network
|version=0.2
|owner=Mischa Frenk
|summary=Provides the ability to process traffic based various scheduling policies.
}}
Function to optimise resources usage or traffic based on various scheduling policies. Examples of scheduling policies can be:

* First in first out
This principle states that customers are served one at a time and that the customer that has been waiting the longest is served first.
* Last in first out
This principle also serves customers one at a time, however the customer with the shortest waiting time will be served first. Also known as a stack.
* Processor sharing
Service capacity is shared equally between customers.[16]
* Priority
Customers with high priority are served first. Priority queues can be of two types, non-pre-emptive (where a job in service cannot be interrupted) and pre-emptive (where a job in service can be interrupted by a higher priority job). No work is lost in either model.
* Shortest job first
The next job to be served is the one with the smallest size
* Pre-emptive shortest job first
The next job to be served is the one with the original smallest size
* Shortest remaining processing time
The next job to serve is the one with the smallest remaining processing requirement.
{{FunctionIcon
|image=Icon
}}
{{Text Footer GF}}

GF.Queuing

2014-12-19T15:37:38Z

Mischa Frenk:

{{Maturity|0}}
{{Pageheaderbox4GF
|name=Priority Queuing
|WorkingArea=Network
|version=0.1
|owner=Mischa Frenk
|summary=Provides the ability to process traffic based on the assigned priority of data elements.
}}
Function to optimise traffic by allowing data elements with high priority to be served before a data elements with low priority.
{{FunctionIcon
|image=Icon
}}
{{Text Footer GF}}

GF.Queuing

2014-12-19T15:37:07Z

Mischa Frenk:

{{Maturity|0}}
{{Pageheaderbox4GF
|name=Priority Queuing
|WorkingArea=Network
|version=0.1
|owner=Mischa Frenk
|summary=Provides the ability to process traffic based on the assigned priority of the data elements.
}}
Function to optimise traffic by allowing data elements with high priority to be served before a data elements with low priority.
{{FunctionIcon
|image=Icon
}}
{{Text Footer GF}}

GF.Queuing

2014-12-19T15:32:18Z

Mischa Frenk: It is more and more common to make better usage of the network infrastructure and optimise traffic by allowing a data element with high priority to be served before a data element with low priority.

{{Maturity|0}}
{{Pageheaderbox4GF
|name=Priority Queuing
|WorkingArea=Network
|version=0.1
|owner=Mischa Frenk
|summary=Provides the ability to give different priority to different traffic
}}
Function to optimise traffic by allowing data elements with high priority to be served before a data elements with low priority.
{{FunctionIcon
|image=Icon
}}
{{Text Footer GF}}

Talk:GF.Access Conditioning

2014-12-19T15:01:15Z

Mischa Frenk: Created page with "Maybe "Access Control" is a more suitable name because they concern all control mechanisms (these mechanisms can range from authentication to verifying if a client is up-to-da..."

Maybe "Access Control" is a more suitable name because they concern all control mechanisms (these mechanisms can range from authentication to verifying if a client is up-to-date on security patches and anti-virus software) before obtaining access
--[[User:Mischa Frenk|Mischa Frenk]] ([[User talk:Mischa Frenk|talk]]) 16:01, 19 December 2014 (CET)

GF.Interconnection

2014-12-19T10:43:34Z

Mischa Frenk: An Interconnection function offers to transport data over relatively long distances.

{{Maturity|3}}
{{Pageheaderbox4GF
|name=Interconnection
|WorkingArea=Network
|version=0.1
|owner=Mischa Frenk
|summary=An Interconnection function offers to transport data over relatively long distances
}}
An Interconnection function offers to transport data over relatively long distances.

The following approaches are available to implement this type of facility:
* a dedicated circuit (permanent or on demand);
* access to a virtual private network (VPN) cloud, provided by a Network Service Provider;
* (encrypted) virtual circuits over insecure network clouds of third parties (typically the Internet).
{{FunctionIcon
|image=Icon GF Interconnection.png
}}
{{Text Footer GF}}

GF.Connection Handling

2014-12-19T10:41:11Z

Mischa Frenk: This function covers all behaviour associated with the management of one end of a communication session.

{{Maturity|3}}
{{Pageheaderbox4GF
|name=Connection Handling
|WorkingArea=Network
|version=0.1
|owner=Mischa Frenk
|summary=This function covers all behaviour associated with the management of one end of a communication session.
}}
This function covers all behaviour associated with the management of one end of a communication session. Thus, a logical communication circuit is established, separated from other logical circuits. The function takes care of signaling activities, can signal congestion or busy-situations, and provide the means to multiply one connection to multiple receivers.
{{FunctionIcon
|image=Icon GF Connection Handling.png
}}
{{Text Footer GF}}

GF.Access Aggregation

2014-12-19T10:21:03Z

Mischa Frenk:

{{Maturity|9}}
{{Pageheaderbox4GF
|name=Access Aggregation
|WorkingArea=Network
|version=0.2
|owner=Mischa Frenk
|summary=Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.
}}
Access Aggregation groups multiple network types made available by one or more Access Conditioning instances.
{{FunctionIcon
|image=Icon GF Access Aggregation.png
}}
{{Text Footer GF}}

GF.Access Aggregation

2014-12-19T10:11:35Z

Mischa Frenk:

{{Maturity|2}}
{{Pageheaderbox4GF
|name=Access Aggregation
|WorkingArea=Network
|version=0.2
|owner=Mischa Frenk
|summary=Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.
}}
Access Aggregation bundles the functionality of two or more Access Conditioning instances in order to connect to the Distribution function.
{{FunctionIcon
|image=Icon GF Access Aggregation.png
}}
{{Text Footer GF}}

GF.Access Aggregation

2014-12-19T09:49:20Z

Mischa Frenk:

{{Maturity|2}}
{{Pageheaderbox4GF
|name=Access Aggregation
|WorkingArea=Network
|version=0.2
|owner=Mischa Frenk
|summary=Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.
}}
Access Aggregation is

a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.

intermediate save
{{FunctionIcon
|image=Icon GF Access Aggregation.png
}}
{{Text Footer GF}}

User:Mischa Frenk

2014-12-19T09:41:47Z

Mischa Frenk:

{{Contact Data
|displayname=Mischa Frenk
|title=Enterprise Architect
|company=Ministerie van Defensie
|pic=Mischa.jpg
|sex=M
}}

{{Table Owner Of|Mischa Frenk}}

File:Mischa.jpg

2014-12-19T09:41:06Z

Mischa Frenk:

GF.Access Aggregation

2014-12-19T09:39:25Z

Mischa Frenk:

{{Maturity|2}}
{{Pageheaderbox4GF
|name=Access Aggregation
|WorkingArea=Network
|version=0.2
|owner=Mischa Frenk
|summary=Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.
}}
Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.

intermediate save
{{FunctionIcon
|image=Icon GF Access Conditioning.png
}}
{{Text Footer GF}}

GF.Access Aggregation

2014-12-19T09:38:38Z

Mischa Frenk:

{{Maturity|2}}
{{Pageheaderbox4GF
|name=Access Aggregation
|WorkingArea=Network
|version=0.1
|owner=Mischa Frenk
|summary=Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.
}}
Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.

intermediate save
{{FunctionIcon
|image=Icon
}}
{{Text Footer GF}}

GF.Access Aggregation

2014-12-19T09:38:04Z

Mischa Frenk: Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.

{{Maturity|2}}
{{Pageheaderbox4GF
|name=Access Aggregation
|WorkingArea=Network
|version=0.1
|owner=Mischa Frenk
|summary=unspecified
}}
Access Aggregation is a logical infrastructure function that performs the tasks required to group multiple Access Conditioning instances.

intermediate save
{{FunctionIcon
|image=Icon
}}
{{Text Footer GF}}